2016 Multi-University Training Contest 7
6/12
2016 Multi-University Training Contest 7
期望 B Balls and Boxes(BH)
题意:
n个球放到m个盒子里,xi表示第i个盒子里的球的数量,求V的期望值。
思路:
官方题解:
代码:
#include <bits/stdc++.h> typedef long long ll; ll GCD(ll a, ll b) {
return b ? GCD (b, a % b) : a;
} int main() {
ll n, m;
while (scanf ("%I64d%I64d", &n, &m) == 2 && n + m) {
ll x = n * (m - 1);
ll y = m * m;
ll gcd = GCD (x, y);
printf ("%I64d/%I64d\n", x / gcd, y / gcd);
}
return 0;
}
图论 E Elegant Construction(BH)
题意:
构造一张图,使得第i个点恰好能走到a[i]个点。
思路:
显然从a[i]=0的点开始,a[i]大的点一定会连向少的点,类似拓扑排序的做法。时间复杂度O(n^2)。
代码:
#include <bits/stdc++.h> const int N = 1e3 + 5;
int n; struct Edge {
int u, v;
};
std::vector<Edge> edges; struct Node {
int v, id;
bool operator < (const Node &rhs) const {
return v < rhs.v;
}
}a[N]; bool vis[N]; int solve() {
std::sort (a+1, a+1+n);
edges.clear ();
memset (vis, false, sizeof (vis));
for (int i=1; i<=n; ++i) {
if (a[i].v != 0) return -1;
vis[a[i].id] = true;
for (int j=1; j<=n; ++j) {
if (vis[a[j].id]) continue;
if (a[j].v == 0) continue;
edges.push_back ({a[j].id, a[i].id});
a[j].v--;
}
}
return (int) edges.size ();
} int main() {
int T;
scanf ("%d", &T);
for (int cas=1; cas<=T; ++cas) {
scanf ("%d", &n);
for (int i=1; i<=n; ++i) {
scanf ("%d", &a[i].v);
a[i].id = i;
}
int m = solve ();
printf ("Case #%d: %s\n", cas, m != -1 ? "Yes" : "No");
if (m != -1) {
printf ("%d\n", m);
for (int i=0; i<m; ++i) {
printf ("%d %d\n", edges[i].u, edges[i].v);
}
}
}
return 0;
}
优先队列+优化 J Joint Stacks(BH)
题意:
两个栈,A和B,三种操作:入栈,出栈,以及A,B按照入栈时间合并,输出每次出栈的数字。
思路:
可以用优先队列来模拟栈操作,合并的话就是按照时间排序后合并,时间复杂度应该是O(nlogn)(应该还要大),结果超时了。后来试过用并查集乱搞可是写搓了,一度想弃疗。。。后来再回到原来的做法,加了一个优化(队列小的合并到大的),就AC了!(也就是想到了并查集按秩合并的思想)
当然巧妙的做法还是官方的三个栈。
代码:
优先队列
#include <bits/stdc++.h> const int N = 1e5 + 5;
int n; struct Node {
int x, t;
bool operator < (const Node &rhs) const {
return t < rhs.t;
}
};
std::priority_queue<Node> pque[2]; int real[2]; void merge(int id1, int id2) {
if (pque[id2].size () > pque[id1].size ()) {
std::swap (id1, id2);
std::swap (real[0], real[1]);
}
while (!pque[id2].empty ()) {
pque[id1].push (pque[id2].top ());
pque[id2].pop ();
}
} int main() {
int cas = 0;
while (scanf ("%d", &n) == 1 && n) {
printf ("Case #%d:\n", ++cas);
char op[10], C[2], D[2];
for (int i=0; i<2; ++i) {
while (!pque[i].empty ()) pque[i].pop ();
}
real[0] = 0; real[1] = 1;
for (int i=1; i<=n; ++i) {
scanf ("%s", op);
if (op[0] == 'p') {
scanf ("%s", C);
int id = C[0] - 'A';
id = real[id];
if (op[1] == 'u') {
int x;
scanf ("%d", &x);
pque[id].push ({x, i});
} else {
printf ("%d\n", pque[id].top ().x);
pque[id].pop ();
}
} else {
scanf ("%s%s", C, D);
int id1 = C[0] - 'A';
int id2 = D[0] - 'A';
merge (real[id1], real[id2]);
}
}
}
return 0;
}
O(n)
void work()
{
top[0] = top[1] = top[2] = 0;
for (int i = 0; i < n; ++i) {
char op[10], s[5];
scanf("%s%s", op, s);
int a = s[0] - 'A';
if (op[1] == 'u') {
scanf("%d", &x[i]);
sta[a][top[a]++] = i;
} else if (op[1] == 'o') {
if (!top[a]) a = 2;
printf("%d\n", x[sta[a][--top[a]]]);
} else {
scanf("%s", s);
top[2] = merge(sta[0], sta[0] + top[0],
sta[1], sta[1] + top[1],
sta[2] + top[2]) - sta[2];
top[0] = top[1] = 0;
}
}
}
2016 Multi-University Training Contest 7的更多相关文章
- 2016 Al-Baath University Training Camp Contest-1
2016 Al-Baath University Training Camp Contest-1 A题:http://codeforces.com/gym/101028/problem/A 题意:比赛 ...
- 2016 Al-Baath University Training Camp Contest-1 E
Description ACM-SCPC-2017 is approaching every university is trying to do its best in order to be th ...
- 2016 Al-Baath University Training Camp Contest-1 A
Description Tourist likes competitive programming and he has his own Codeforces account. He particip ...
- 2016 Al-Baath University Training Camp Contest-1 J
Description X is fighting beasts in the forest, in order to have a better chance to survive he's gon ...
- 2016 Al-Baath University Training Camp Contest-1 I
Description It is raining again! Youssef really forgot that there is a chance of rain in March, so h ...
- 2016 Al-Baath University Training Camp Contest-1 H
Description You've possibly heard about 'The Endless River'. However, if not, we are introducing it ...
- 2016 Al-Baath University Training Camp Contest-1 G
Description The forces of evil are about to disappear since our hero is now on top on the tower of e ...
- 2016 Al-Baath University Training Camp Contest-1 F
Description Zaid has two words, a of length between 4 and 1000 and b of length 4 exactly. The word a ...
- 2016 Al-Baath University Training Camp Contest-1 D
Description X is well known artist, no one knows the secrete behind the beautiful paintings of X exc ...
- 2016 Al-Baath University Training Camp Contest-1 C
Description Rami went back from school and he had an easy homework about bitwise operations (and,or, ...
随机推荐
- 最新 DEDECMS SQL 注入 0day
4月29日消息:国内安全研究团队“知道创宇”称截获到最新DEDECMS SQL注入0day,DEDECMS官网目前提供下载的最新版5.7也受影响,截止本告警发出时官方尚未给出补丁或解决方案,此漏洞利用 ...
- nginx: [error] invalid PID number "" in "/usr/local/nginx/logs/nginx.pid"
iwangzheng.com tty:[0] jobs:[0] cwd:[/opt/nginx/conf] 12:45 [root@a02.cmsapi]$ /usr/local/nginx/sbin ...
- ZeroMQ安装
一.ZeroMQ介绍 ZeroMQ是一个开源的消息队列系统,按照官方的定义,它是一个消息通信库,帮助开发者设计分布式和并行的应用程序. 首先,我们需要明白,ZeroMQ不是传统的消息队列系统(比如Ac ...
- [官方教程] [ES4封装教程]1.使用 VMware Player 创建适合封装的虚拟机
[转载处,http://bbs.itiankong.com/] 前言: 首先要明确的一点,系统封装操作的源计算机一般为虚拟计算机(简称虚拟机.VM等),这也是为什么我们要在封装教程的第一章就专门学习虚 ...
- redhat 6 / centos 6 搭建Django环境
1)首先 安装的时候 到 选择安装那些包的时候 把 编译环境和开发的包 那块全部打上勾 2)系统虽然自带Python安装包,但是版本比较低.所以推荐自行进行tar包编译安装比较新的 https:// ...
- object-c 继承多态 动态数据类型
在c#中我们知道有继承的.同样在object-c中也有继承. 例如我们写一个人类(父),一个学生类.我们可以这么写: demo: @interface Person:NSobject{ NSStrin ...
- C++调用Object-C界面
在C++代码中想调用显示一个IOS界面,使用NSNotificationCenter 1.在界面中注册消息 [[NSNotificationCenter defaultCenter] addObse ...
- SQLServer语句大使
1.创建数据库create database 数据库名字 2.删除数据库drop database 数据库名字3.创建表(identity(1,1)自动增长,倍数为1,primary key设置主键) ...
- Win7中打开chm文件内容无法显示问题
今天下载了一个linux的2.6.22.14中文文档,下载后发现显示异常 www.2cto.com 怀疑是API的问题,连续从几个网站下来了很多版本,发现都存在这个问题,然后就开始自己的身上找原 ...
- gitlab web登入密码忘记以后可以用如下方式修改密码
➜ ~ gitlab-rails console production Loading production environment (Rails ) irb(main)::> ➜ ~ gitl ...