Submission #369153

# Submission time Handle Problem Language Result Execution time Memory
369153 2021-02-20T14:46:43 Z mjhmjh1104 Game (IOI14_game) C++14
42 / 100
1000 ms 4960 KB
#include "game.h"
#include <vector>
#include <algorithm>
using namespace std;

int uf[1506], sz[1506], ds[1506], n;

int _find(int x) {
    if (uf[x] == -1) return x;
    return uf[x] = _find(uf[x]);
}

void _merge(int x, int y) {
    x = _find(x), y = _find(y);
    if (x == y) return;
    sz[y] += sz[x], ds[y] += ds[x], uf[x] = y;
}

vector<pair<int, int>> lt;
int k, idx[1506][1506];

void initialize(int N) {
    n = N;
    for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) {
        idx[i][j] = (int)lt.size();
        lt.push_back({ i, j });
    }
}

int hasEdge(int u, int v) {
    if (u > v) swap(u, v);
    swap(lt[idx[u][v]], lt[k]);
    swap(idx[lt[k].first][lt[k].second], idx[lt[idx[u][v]].first][lt[idx[u][v]].second]);
    k++;
    for (int i = 0; i < n; i++) uf[i] = -1;
    for (int i = n * (n - 1) / 2 - 1; i >= k; i--) _merge(lt[i].first, lt[i].second);
    for (int i = 1; i < n; i++) if (_find(i) != _find(0)) return k--, 1;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 0 ms 372 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 376 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 57 ms 748 KB Output is correct
35 Correct 56 ms 876 KB Output is correct
36 Correct 57 ms 748 KB Output is correct
37 Correct 59 ms 876 KB Output is correct
38 Correct 59 ms 748 KB Output is correct
39 Correct 58 ms 768 KB Output is correct
40 Correct 58 ms 748 KB Output is correct
41 Correct 56 ms 876 KB Output is correct
42 Correct 57 ms 876 KB Output is correct
43 Correct 41 ms 748 KB Output is correct
44 Correct 42 ms 876 KB Output is correct
45 Correct 59 ms 748 KB Output is correct
46 Correct 56 ms 748 KB Output is correct
47 Correct 55 ms 748 KB Output is correct
48 Correct 57 ms 748 KB Output is correct
49 Correct 57 ms 748 KB Output is correct
50 Correct 56 ms 748 KB Output is correct
51 Correct 61 ms 748 KB Output is correct
52 Correct 56 ms 748 KB Output is correct
53 Correct 56 ms 876 KB Output is correct
54 Correct 57 ms 772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 3 ms 492 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 56 ms 748 KB Output is correct
35 Correct 58 ms 748 KB Output is correct
36 Correct 58 ms 748 KB Output is correct
37 Correct 59 ms 748 KB Output is correct
38 Correct 59 ms 748 KB Output is correct
39 Correct 57 ms 772 KB Output is correct
40 Correct 68 ms 876 KB Output is correct
41 Correct 56 ms 768 KB Output is correct
42 Correct 56 ms 748 KB Output is correct
43 Correct 41 ms 748 KB Output is correct
44 Correct 43 ms 876 KB Output is correct
45 Correct 57 ms 748 KB Output is correct
46 Correct 58 ms 776 KB Output is correct
47 Correct 56 ms 748 KB Output is correct
48 Correct 56 ms 748 KB Output is correct
49 Correct 57 ms 748 KB Output is correct
50 Correct 56 ms 748 KB Output is correct
51 Correct 57 ms 876 KB Output is correct
52 Correct 56 ms 748 KB Output is correct
53 Correct 57 ms 876 KB Output is correct
54 Correct 59 ms 748 KB Output is correct
55 Execution timed out 1083 ms 4960 KB Time limit exceeded
56 Halted 0 ms 0 KB -