#include "game.h"
#include <vector>
#include <iostream>
#include <set>
#include <queue>
#include <algorithm>
#include <cassert>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
int U[1500];
int find(int x) {
if (U[x] == x) return x;
return U[x] = find(U[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y) return;
U[x] = y;
}
int N;
bool G[1500][1500];
void initialize(int n) {
N = n;
rep(i, N) U[i] = i;
}
int hasEdge(int u, int v) {
int a = find(u), b = find(v);
if (a == b) {
assert(false);
//G[u][v] = G[v][u] = true;
//return 1;
}
int unused = 0;
G[u][v] = G[v][u] = true;
rep(i, N) rep(j, N) if (i != j && find(i) == a && find(j) == b) unused += G[i][j]==0;
if (unused == 0) {
unite(u, v);
return 1;
}
else return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
13008 KB |
Output is correct |
2 |
Correct |
0 ms |
13008 KB |
Output is correct |
3 |
Correct |
0 ms |
13008 KB |
Output is correct |
4 |
Correct |
0 ms |
13008 KB |
Output is correct |
5 |
Correct |
0 ms |
13008 KB |
Output is correct |
6 |
Correct |
0 ms |
13008 KB |
Output is correct |
7 |
Correct |
0 ms |
13008 KB |
Output is correct |
8 |
Correct |
0 ms |
13008 KB |
Output is correct |
9 |
Correct |
0 ms |
13008 KB |
Output is correct |
10 |
Correct |
0 ms |
13008 KB |
Output is correct |
11 |
Correct |
0 ms |
13008 KB |
Output is correct |
12 |
Correct |
0 ms |
13008 KB |
Output is correct |
13 |
Correct |
0 ms |
13008 KB |
Output is correct |
14 |
Correct |
0 ms |
13008 KB |
Output is correct |
15 |
Correct |
0 ms |
13008 KB |
Output is correct |
16 |
Correct |
0 ms |
13008 KB |
Output is correct |
17 |
Correct |
0 ms |
13008 KB |
Output is correct |
18 |
Correct |
0 ms |
13008 KB |
Output is correct |
19 |
Correct |
0 ms |
13008 KB |
Output is correct |
20 |
Correct |
0 ms |
13008 KB |
Output is correct |
21 |
Correct |
0 ms |
13008 KB |
Output is correct |
22 |
Correct |
0 ms |
13008 KB |
Output is correct |
23 |
Correct |
0 ms |
13008 KB |
Output is correct |
24 |
Correct |
0 ms |
13008 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
13008 KB |
Output is correct |
2 |
Correct |
0 ms |
13008 KB |
Output is correct |
3 |
Correct |
0 ms |
13008 KB |
Output is correct |
4 |
Correct |
0 ms |
13008 KB |
Output is correct |
5 |
Correct |
0 ms |
13008 KB |
Output is correct |
6 |
Correct |
0 ms |
13008 KB |
Output is correct |
7 |
Correct |
0 ms |
13008 KB |
Output is correct |
8 |
Correct |
0 ms |
13008 KB |
Output is correct |
9 |
Correct |
0 ms |
13008 KB |
Output is correct |
10 |
Correct |
0 ms |
13008 KB |
Output is correct |
11 |
Correct |
0 ms |
13008 KB |
Output is correct |
12 |
Correct |
0 ms |
13008 KB |
Output is correct |
13 |
Correct |
0 ms |
13008 KB |
Output is correct |
14 |
Correct |
0 ms |
13008 KB |
Output is correct |
15 |
Correct |
0 ms |
13008 KB |
Output is correct |
16 |
Correct |
0 ms |
13008 KB |
Output is correct |
17 |
Correct |
0 ms |
13008 KB |
Output is correct |
18 |
Correct |
0 ms |
13008 KB |
Output is correct |
19 |
Correct |
0 ms |
13008 KB |
Output is correct |
20 |
Correct |
0 ms |
13008 KB |
Output is correct |
21 |
Correct |
0 ms |
13008 KB |
Output is correct |
22 |
Correct |
0 ms |
13008 KB |
Output is correct |
23 |
Correct |
0 ms |
13008 KB |
Output is correct |
24 |
Correct |
0 ms |
13008 KB |
Output is correct |
25 |
Correct |
3 ms |
13008 KB |
Output is correct |
26 |
Correct |
3 ms |
13008 KB |
Output is correct |
27 |
Correct |
3 ms |
13008 KB |
Output is correct |
28 |
Correct |
0 ms |
13008 KB |
Output is correct |
29 |
Correct |
3 ms |
13008 KB |
Output is correct |
30 |
Correct |
3 ms |
13008 KB |
Output is correct |
31 |
Correct |
3 ms |
13008 KB |
Output is correct |
32 |
Correct |
3 ms |
13008 KB |
Output is correct |
33 |
Correct |
0 ms |
13008 KB |
Output is correct |
34 |
Correct |
86 ms |
13008 KB |
Output is correct |
35 |
Correct |
83 ms |
13008 KB |
Output is correct |
36 |
Correct |
83 ms |
13008 KB |
Output is correct |
37 |
Correct |
83 ms |
13008 KB |
Output is correct |
38 |
Correct |
79 ms |
13008 KB |
Output is correct |
39 |
Correct |
79 ms |
13008 KB |
Output is correct |
40 |
Correct |
79 ms |
13008 KB |
Output is correct |
41 |
Correct |
79 ms |
13008 KB |
Output is correct |
42 |
Correct |
83 ms |
13008 KB |
Output is correct |
43 |
Correct |
59 ms |
13008 KB |
Output is correct |
44 |
Correct |
83 ms |
13008 KB |
Output is correct |
45 |
Correct |
73 ms |
13008 KB |
Output is correct |
46 |
Correct |
73 ms |
13008 KB |
Output is correct |
47 |
Correct |
73 ms |
13008 KB |
Output is correct |
48 |
Correct |
73 ms |
13008 KB |
Output is correct |
49 |
Correct |
79 ms |
13008 KB |
Output is correct |
50 |
Correct |
96 ms |
13008 KB |
Output is correct |
51 |
Correct |
89 ms |
13008 KB |
Output is correct |
52 |
Correct |
96 ms |
13008 KB |
Output is correct |
53 |
Correct |
96 ms |
13008 KB |
Output is correct |
54 |
Correct |
103 ms |
13008 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
13008 KB |
Output is correct |
2 |
Correct |
0 ms |
13008 KB |
Output is correct |
3 |
Correct |
0 ms |
13008 KB |
Output is correct |
4 |
Correct |
0 ms |
13008 KB |
Output is correct |
5 |
Correct |
0 ms |
13008 KB |
Output is correct |
6 |
Correct |
0 ms |
13008 KB |
Output is correct |
7 |
Correct |
0 ms |
13008 KB |
Output is correct |
8 |
Correct |
0 ms |
13008 KB |
Output is correct |
9 |
Correct |
0 ms |
13008 KB |
Output is correct |
10 |
Correct |
0 ms |
13008 KB |
Output is correct |
11 |
Correct |
0 ms |
13008 KB |
Output is correct |
12 |
Correct |
0 ms |
13008 KB |
Output is correct |
13 |
Correct |
0 ms |
13008 KB |
Output is correct |
14 |
Correct |
0 ms |
13008 KB |
Output is correct |
15 |
Correct |
0 ms |
13008 KB |
Output is correct |
16 |
Correct |
0 ms |
13008 KB |
Output is correct |
17 |
Correct |
0 ms |
13008 KB |
Output is correct |
18 |
Correct |
0 ms |
13008 KB |
Output is correct |
19 |
Correct |
0 ms |
13008 KB |
Output is correct |
20 |
Correct |
0 ms |
13008 KB |
Output is correct |
21 |
Correct |
0 ms |
13008 KB |
Output is correct |
22 |
Correct |
0 ms |
13008 KB |
Output is correct |
23 |
Correct |
0 ms |
13008 KB |
Output is correct |
24 |
Correct |
0 ms |
13008 KB |
Output is correct |
25 |
Correct |
3 ms |
13008 KB |
Output is correct |
26 |
Correct |
3 ms |
13008 KB |
Output is correct |
27 |
Correct |
0 ms |
13008 KB |
Output is correct |
28 |
Correct |
3 ms |
13008 KB |
Output is correct |
29 |
Correct |
3 ms |
13008 KB |
Output is correct |
30 |
Correct |
3 ms |
13008 KB |
Output is correct |
31 |
Correct |
0 ms |
13008 KB |
Output is correct |
32 |
Correct |
3 ms |
13008 KB |
Output is correct |
33 |
Correct |
3 ms |
13008 KB |
Output is correct |
34 |
Correct |
83 ms |
13008 KB |
Output is correct |
35 |
Correct |
89 ms |
13008 KB |
Output is correct |
36 |
Correct |
83 ms |
13008 KB |
Output is correct |
37 |
Correct |
86 ms |
13008 KB |
Output is correct |
38 |
Correct |
86 ms |
13008 KB |
Output is correct |
39 |
Correct |
79 ms |
13008 KB |
Output is correct |
40 |
Correct |
86 ms |
13008 KB |
Output is correct |
41 |
Correct |
86 ms |
13008 KB |
Output is correct |
42 |
Correct |
79 ms |
13008 KB |
Output is correct |
43 |
Correct |
59 ms |
13008 KB |
Output is correct |
44 |
Correct |
83 ms |
13008 KB |
Output is correct |
45 |
Correct |
76 ms |
13008 KB |
Output is correct |
46 |
Correct |
73 ms |
13008 KB |
Output is correct |
47 |
Correct |
73 ms |
13008 KB |
Output is correct |
48 |
Correct |
76 ms |
13008 KB |
Output is correct |
49 |
Correct |
76 ms |
13008 KB |
Output is correct |
50 |
Correct |
96 ms |
13008 KB |
Output is correct |
51 |
Correct |
106 ms |
13008 KB |
Output is correct |
52 |
Correct |
113 ms |
13008 KB |
Output is correct |
53 |
Correct |
109 ms |
13008 KB |
Output is correct |
54 |
Correct |
96 ms |
13008 KB |
Output is correct |
55 |
Execution timed out |
1000 ms |
13008 KB |
Execution timed out |
56 |
Halted |
0 ms |
0 KB |
- |