oj.uz

Submission #959665

# Submission time Handle Problem Language Result Execution time Memory
959665 2024-04-08T16:39:43 Z vjudge1 Game (IOI14_game) C++17
42 / 100
 1000 ms 11036 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1500;

int n, p[N], sz[N];
unordered_set<int> vis, adj[N];

int findSet(int x) {
    return (p[x] == x ? x : p[x] = findSet(p[x]));
}

void unite(int x, int y) {
    x = findSet(x);
    y = findSet(y);

    if (sz[x] < sz[y]) swap(x, y);

    p[y] = x;
    sz[x] += sz[y];

    while (!adj[y].empty()) {
        int z = *adj[y].begin();
        
        adj[z].insert(x);
        adj[x].insert(z);

        adj[z].erase(y);
        adj[y].erase(adj[y].begin());
    }
}

void addEdge(int x, int y) {
    adj[x].insert(y);
    adj[y].insert(x);

    unite(x, y);
}

void removeEdge(int x, int y) {
    adj[x].erase(y);
    adj[y].erase(x);
}

int dfs(int x) {
    vis.insert(x);

    int cnt = sz[x];
    for (int y : adj[x]) {
        if (vis.find(y) != vis.end()) continue;
        cnt += dfs(y);
    }
    return cnt;
}

void initialize(int NN) {
    n = NN;

    for (int i = 0; i < n; i++) {
        p[i] = i;
        sz[i] = 1;

        for (int j = i+1; j < n; j++) {
            adj[i].insert(j);
            adj[j].insert(i);
        }
    }
}

int hasEdge(int u, int v) {
    u = findSet(u);
    v = findSet(v);
    if (u == v) return 0;

    removeEdge(u, v);

    vis.clear();
    if (dfs(u) < n) {
        addEdge(u, v);
        return 1;
    }

    vis.clear();
    if (dfs(v) < n) {
        addEdge(u, v);
        return 1;
    }

    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 5 ms 524 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 4 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 4 ms 344 KB Output is correct
33 Correct 4 ms 348 KB Output is correct
34 Correct 117 ms 820 KB Output is correct
35 Correct 106 ms 820 KB Output is correct
36 Correct 106 ms 824 KB Output is correct
37 Correct 106 ms 832 KB Output is correct
38 Correct 105 ms 604 KB Output is correct
39 Correct 109 ms 832 KB Output is correct
40 Correct 113 ms 828 KB Output is correct
41 Correct 109 ms 820 KB Output is correct
42 Correct 110 ms 1076 KB Output is correct
43 Correct 97 ms 812 KB Output is correct
44 Correct 99 ms 600 KB Output is correct
45 Correct 107 ms 816 KB Output is correct
46 Correct 102 ms 832 KB Output is correct
47 Correct 109 ms 832 KB Output is correct
48 Correct 102 ms 600 KB Output is correct
49 Correct 102 ms 820 KB Output is correct
50 Correct 108 ms 1076 KB Output is correct
51 Correct 105 ms 820 KB Output is correct
52 Correct 107 ms 828 KB Output is correct
53 Correct 106 ms 600 KB Output is correct
54 Correct 115 ms 828 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 372 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 344 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 396 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 5 ms 348 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 5 ms 588 KB Output is correct
34 Correct 107 ms 832 KB Output is correct
35 Correct 115 ms 836 KB Output is correct
36 Correct 106 ms 820 KB Output is correct
37 Correct 127 ms 816 KB Output is correct
38 Correct 110 ms 820 KB Output is correct
39 Correct 110 ms 856 KB Output is correct
40 Correct 105 ms 600 KB Output is correct
41 Correct 112 ms 812 KB Output is correct
42 Correct 111 ms 1072 KB Output is correct
43 Correct 97 ms 816 KB Output is correct
44 Correct 102 ms 816 KB Output is correct
45 Correct 102 ms 820 KB Output is correct
46 Correct 117 ms 832 KB Output is correct
47 Correct 112 ms 816 KB Output is correct
48 Correct 103 ms 812 KB Output is correct
49 Correct 109 ms 824 KB Output is correct
50 Correct 112 ms 816 KB Output is correct
51 Correct 107 ms 604 KB Output is correct
52 Correct 105 ms 604 KB Output is correct
53 Correct 104 ms 816 KB Output is correct
54 Correct 111 ms 600 KB Output is correct
55 Execution timed out 1068 ms 11036 KB Time limit exceeded
56 Halted 0 ms 0 KB -