oj.uz

Submission #366765

# Submission time Handle Problem Language Result Execution time Memory
366765 2021-02-15T09:26:31 Z KoD Game (IOI14_game) C++17
42 / 100
 108 ms 620 KB 
#include <bits/stdc++.h>

int size;
bool remain[80][80];

void initialize(int n) {
    assert(n <= 80);
    size = n;
    for (int i = 0; i < size; ++i) {
        for (int j = 0; j < size; ++j) {
            remain[i][j] = (i != j);
        }
    }    
}

struct DSU {
    std::vector<int> par;
    DSU(const int n): par(n, -1) { }
    int find(const int u) {
        return par[u] < 0 ? u : par[u] = find(par[u]);
    }
    bool merge(int u, int v) {
        u = find(u);
        v = find(v);
        if (u == v) {
            return false;
        }
        if (par[u] > par[v]) {
            std::swap(u, v);
        }
        par[u] += par[v];
        par[v] = u;
        return true;
    }
};

bool isConnected() {
    int cnt = 0;
    DSU dsu(size);
    for (int i = 0; i < size; ++i) {
        for (int j = 0; j < size; ++j) {
            if (remain[i][j]) {
                if (dsu.merge(i, j)) {
                    cnt += 1;
                }
            }
        }
    }
    return cnt == (size - 1);
}

int hasEdge(int u, int v) {
    remain[u][v] = remain[v][u] = false;
    if (isConnected()) {
        return 0;
    }
    else {
        remain[u][v] = true;
        return 1;
    }
}

#ifdef __APPLE__
int main() {
    int n;
    std::cin >> n;
    initialize(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            int u, v;
            std::cin >> u >> v;
            std::cout << hasEdge(u, v) << '\n';
        }
    }
}
#endif

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 384 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 4 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 3 ms 364 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 3 ms 364 KB Output is correct
34 Correct 108 ms 364 KB Output is correct
35 Correct 95 ms 364 KB Output is correct
36 Correct 97 ms 492 KB Output is correct
37 Correct 104 ms 364 KB Output is correct
38 Correct 95 ms 364 KB Output is correct
39 Correct 99 ms 500 KB Output is correct
40 Correct 96 ms 364 KB Output is correct
41 Correct 95 ms 364 KB Output is correct
42 Correct 98 ms 364 KB Output is correct
43 Correct 55 ms 364 KB Output is correct
44 Correct 54 ms 364 KB Output is correct
45 Correct 86 ms 364 KB Output is correct
46 Correct 86 ms 364 KB Output is correct
47 Correct 85 ms 364 KB Output is correct
48 Correct 84 ms 492 KB Output is correct
49 Correct 97 ms 528 KB Output is correct
50 Correct 81 ms 364 KB Output is correct
51 Correct 89 ms 492 KB Output is correct
52 Correct 83 ms 364 KB Output is correct
53 Correct 82 ms 364 KB Output is correct
54 Correct 82 ms 364 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 3 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 4 ms 364 KB Output is correct
29 Correct 3 ms 364 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 3 ms 364 KB Output is correct
34 Correct 97 ms 620 KB Output is correct
35 Correct 97 ms 364 KB Output is correct
36 Correct 95 ms 364 KB Output is correct
37 Correct 95 ms 364 KB Output is correct
38 Correct 95 ms 364 KB Output is correct
39 Correct 98 ms 492 KB Output is correct
40 Correct 95 ms 364 KB Output is correct
41 Correct 95 ms 492 KB Output is correct
42 Correct 95 ms 364 KB Output is correct
43 Correct 56 ms 492 KB Output is correct
44 Correct 54 ms 364 KB Output is correct
45 Correct 84 ms 364 KB Output is correct
46 Correct 86 ms 364 KB Output is correct
47 Correct 84 ms 364 KB Output is correct
48 Correct 82 ms 364 KB Output is correct
49 Correct 97 ms 364 KB Output is correct
50 Correct 79 ms 364 KB Output is correct
51 Correct 80 ms 364 KB Output is correct
52 Correct 80 ms 492 KB Output is correct
53 Correct 81 ms 364 KB Output is correct
54 Correct 82 ms 492 KB Output is correct
55 Runtime error 1 ms 492 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -