# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
59841 |
2018-07-23T07:53:52 Z |
hamzqq9 |
Game (IOI14_game) |
C++14 |
|
9 ms |
1440 KB |
#include "game.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define sz(x) x.size()
using namespace std;
#define N 1505
set< pair<int,int> > edge_set[N];
int ata[N],rem[N],n;
int bul(int node) {
if(ata[node]==node) return node;
return ata[node]=bul(ata[node]);
}
int ok[N][N];
int cnt=0;
void initialize(int n) {
::n=n;
for(int i=0;i<n;i++) {
edge_set[i].clear();
for(int j=0;j<n;j++) {
if(j==i) continue ;
edge_set[i].insert({min(i,j),max(i,j)});
}
cnt=0;
ata[i]=i;
}
for(int i=0;i<n;i++) for(int j=0;j<n;j++) ok[i][j]=0;
}
void finish(int au) {
int node1=edge_set[au].begin()->st;
int node2=edge_set[au].begin()->nd;
ok[node1][node2]=ok[node2][node1]=1;
edge_set[bul(node1)].erase(edge_set[bul(node1)].find({min(node1,node2),max(node1,node2)}));
edge_set[bul(node2)].erase(edge_set[bul(node2)].find({min(node1,node2),max(node1,node2)}));
int anode1=bul(node1);
int anode2=bul(node2);
if(sz(edge_set[anode1])<sz(edge_set[anode2])) swap(anode1,anode2);
ata[anode2]=anode1;
if(sz(edge_set[bul(node1)])==1) {
finish(bul(node1));
}
}
int tot=0;
bool flag=false;
int hasEdge(int u, int v) {
tot++;
if(flag) printf("ok[u][v]-->%d\n",ok[u][v]);
if(ok[u][v]) {
++cnt;
assert(!(cnt==n && tot<n*(n-1)/2));
return 1;
}
int au=bul(u);
int av=bul(v);
if(flag) printf("au-->%d av-->%d\n",au,av);
edge_set[au].erase(edge_set[au].find({min(u,v),max(u,v)}));
edge_set[av].erase(edge_set[av].find({min(u,v),max(u,v)}));
if(sz(edge_set[au])==1) {
if(flag) printf("au-->%d\n",au);
finish(au);
}
if(sz(edge_set[av])==1) {
if(flag) printf("av-->%d\n",av);
finish(av);
}
return 0;
}
/*
#include <cstdio>
#include <cassert>
#include "game.h"
int read_int() {
int x;
assert(scanf("%d", &x) == 1);
return x;
}
int bab[N];
int fin(int node) {
if(bab[node]==node) return node;
return bab[node]=fin(bab[node]);
}
void bug(vector< pair<int,int> > ed,int n) {
flag=1;
initialize(n);
for(auto x:ed) {
printf("%d %d\n",x.st,x.nd);
printf("%d\n",hasEdge(x.st,x.nd));
}
}
int main() {
int n, u, v;
n = 5;
vector< pair<int,int> > ed;
for(int i=0;i<n;i++) {
for(int j=0;j<i;j++) {
ed.push_back(mp(i,j));
}
}
int tot=0;
do {
int comp=n;
for(int i=0;i<n;i++) bab[i]=i;
initialize(n);
for (int i = 0; i < n * (n - 1) / 2; i++) {
u = ed[i].st;
v = ed[i].nd;
// printf("%d %d ",u,v);
int res=hasEdge(u,v);
if(res) {
int bu=fin(u);
int bv=fin(v);
if(bu!=bv) {
bab[bu]=bv;
comp--;
}
}
if(comp==1 && i<n*(n-1)/2-1) {
bug(ed,n);
return 0;
}
}
if(comp>1) {
bug(ed,n);
return 0;
}
} while(next_permutation(ed.begin(),ed.end()));
return 0;
}
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
524 KB |
Output is correct |
4 |
Correct |
2 ms |
544 KB |
Output is correct |
5 |
Correct |
4 ms |
544 KB |
Output is correct |
6 |
Correct |
3 ms |
544 KB |
Output is correct |
7 |
Correct |
3 ms |
588 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
2 ms |
588 KB |
Output is correct |
10 |
Correct |
3 ms |
672 KB |
Output is correct |
11 |
Correct |
2 ms |
672 KB |
Output is correct |
12 |
Correct |
2 ms |
672 KB |
Output is correct |
13 |
Correct |
4 ms |
672 KB |
Output is correct |
14 |
Correct |
3 ms |
672 KB |
Output is correct |
15 |
Correct |
3 ms |
672 KB |
Output is correct |
16 |
Correct |
3 ms |
672 KB |
Output is correct |
17 |
Correct |
3 ms |
672 KB |
Output is correct |
18 |
Correct |
2 ms |
672 KB |
Output is correct |
19 |
Correct |
2 ms |
672 KB |
Output is correct |
20 |
Correct |
3 ms |
672 KB |
Output is correct |
21 |
Correct |
3 ms |
672 KB |
Output is correct |
22 |
Correct |
3 ms |
672 KB |
Output is correct |
23 |
Correct |
2 ms |
672 KB |
Output is correct |
24 |
Correct |
3 ms |
672 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
672 KB |
Output is correct |
2 |
Correct |
3 ms |
672 KB |
Output is correct |
3 |
Correct |
2 ms |
672 KB |
Output is correct |
4 |
Correct |
2 ms |
672 KB |
Output is correct |
5 |
Correct |
6 ms |
672 KB |
Output is correct |
6 |
Correct |
3 ms |
672 KB |
Output is correct |
7 |
Correct |
3 ms |
672 KB |
Output is correct |
8 |
Correct |
3 ms |
672 KB |
Output is correct |
9 |
Correct |
4 ms |
672 KB |
Output is correct |
10 |
Correct |
2 ms |
672 KB |
Output is correct |
11 |
Correct |
3 ms |
672 KB |
Output is correct |
12 |
Correct |
2 ms |
672 KB |
Output is correct |
13 |
Correct |
3 ms |
672 KB |
Output is correct |
14 |
Correct |
3 ms |
672 KB |
Output is correct |
15 |
Correct |
2 ms |
672 KB |
Output is correct |
16 |
Correct |
2 ms |
672 KB |
Output is correct |
17 |
Correct |
4 ms |
672 KB |
Output is correct |
18 |
Correct |
3 ms |
672 KB |
Output is correct |
19 |
Correct |
2 ms |
672 KB |
Output is correct |
20 |
Correct |
3 ms |
672 KB |
Output is correct |
21 |
Correct |
2 ms |
672 KB |
Output is correct |
22 |
Correct |
3 ms |
672 KB |
Output is correct |
23 |
Correct |
3 ms |
672 KB |
Output is correct |
24 |
Correct |
3 ms |
672 KB |
Output is correct |
25 |
Correct |
3 ms |
948 KB |
Output is correct |
26 |
Correct |
5 ms |
948 KB |
Output is correct |
27 |
Correct |
5 ms |
948 KB |
Output is correct |
28 |
Correct |
3 ms |
948 KB |
Output is correct |
29 |
Correct |
3 ms |
948 KB |
Output is correct |
30 |
Correct |
3 ms |
948 KB |
Output is correct |
31 |
Correct |
3 ms |
948 KB |
Output is correct |
32 |
Correct |
3 ms |
948 KB |
Output is correct |
33 |
Correct |
3 ms |
948 KB |
Output is correct |
34 |
Correct |
6 ms |
1260 KB |
Output is correct |
35 |
Correct |
6 ms |
1260 KB |
Output is correct |
36 |
Correct |
6 ms |
1276 KB |
Output is correct |
37 |
Correct |
6 ms |
1292 KB |
Output is correct |
38 |
Correct |
7 ms |
1292 KB |
Output is correct |
39 |
Correct |
9 ms |
1308 KB |
Output is correct |
40 |
Correct |
6 ms |
1308 KB |
Output is correct |
41 |
Correct |
7 ms |
1308 KB |
Output is correct |
42 |
Incorrect |
7 ms |
1308 KB |
Output isn't correct |
43 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1308 KB |
Output is correct |
2 |
Correct |
2 ms |
1308 KB |
Output is correct |
3 |
Correct |
1 ms |
1308 KB |
Output is correct |
4 |
Correct |
3 ms |
1308 KB |
Output is correct |
5 |
Correct |
3 ms |
1308 KB |
Output is correct |
6 |
Correct |
3 ms |
1308 KB |
Output is correct |
7 |
Correct |
3 ms |
1308 KB |
Output is correct |
8 |
Correct |
2 ms |
1308 KB |
Output is correct |
9 |
Correct |
3 ms |
1308 KB |
Output is correct |
10 |
Correct |
3 ms |
1308 KB |
Output is correct |
11 |
Correct |
4 ms |
1308 KB |
Output is correct |
12 |
Correct |
3 ms |
1308 KB |
Output is correct |
13 |
Correct |
3 ms |
1308 KB |
Output is correct |
14 |
Correct |
3 ms |
1308 KB |
Output is correct |
15 |
Correct |
3 ms |
1308 KB |
Output is correct |
16 |
Correct |
3 ms |
1308 KB |
Output is correct |
17 |
Correct |
3 ms |
1308 KB |
Output is correct |
18 |
Correct |
4 ms |
1308 KB |
Output is correct |
19 |
Correct |
3 ms |
1308 KB |
Output is correct |
20 |
Correct |
3 ms |
1308 KB |
Output is correct |
21 |
Correct |
3 ms |
1308 KB |
Output is correct |
22 |
Correct |
3 ms |
1308 KB |
Output is correct |
23 |
Correct |
3 ms |
1308 KB |
Output is correct |
24 |
Correct |
3 ms |
1308 KB |
Output is correct |
25 |
Correct |
4 ms |
1308 KB |
Output is correct |
26 |
Correct |
4 ms |
1308 KB |
Output is correct |
27 |
Correct |
3 ms |
1308 KB |
Output is correct |
28 |
Correct |
3 ms |
1308 KB |
Output is correct |
29 |
Correct |
3 ms |
1308 KB |
Output is correct |
30 |
Correct |
3 ms |
1308 KB |
Output is correct |
31 |
Correct |
4 ms |
1308 KB |
Output is correct |
32 |
Correct |
3 ms |
1308 KB |
Output is correct |
33 |
Correct |
4 ms |
1308 KB |
Output is correct |
34 |
Correct |
7 ms |
1440 KB |
Output is correct |
35 |
Correct |
7 ms |
1440 KB |
Output is correct |
36 |
Correct |
7 ms |
1440 KB |
Output is correct |
37 |
Correct |
6 ms |
1440 KB |
Output is correct |
38 |
Correct |
8 ms |
1440 KB |
Output is correct |
39 |
Correct |
6 ms |
1440 KB |
Output is correct |
40 |
Correct |
7 ms |
1440 KB |
Output is correct |
41 |
Correct |
7 ms |
1440 KB |
Output is correct |
42 |
Incorrect |
7 ms |
1440 KB |
Output isn't correct |
43 |
Halted |
0 ms |
0 KB |
- |