oj.uz

Submission #959666

# Submission time Handle Problem Language Result Execution time Memory
959666 2024-04-08T16:40:27 Z vjudge1 Game (IOI14_game) C++17
15 / 100
 615 ms 1056 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];
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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 344 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 13 ms 572 KB Output is correct
26 Correct 13 ms 348 KB Output is correct
27 Correct 13 ms 348 KB Output is correct
28 Correct 13 ms 348 KB Output is correct
29 Correct 13 ms 348 KB Output is correct
30 Correct 14 ms 348 KB Output is correct
31 Correct 12 ms 348 KB Output is correct
32 Correct 13 ms 348 KB Output is correct
33 Correct 15 ms 568 KB Output is correct
34 Correct 557 ms 804 KB Output is correct
35 Correct 567 ms 808 KB Output is correct
36 Correct 581 ms 856 KB Output is correct
37 Correct 596 ms 812 KB Output is correct
38 Correct 570 ms 820 KB Output is correct
39 Correct 575 ms 1056 KB Output is correct
40 Correct 577 ms 796 KB Output is correct
41 Correct 583 ms 808 KB Output is correct
42 Correct 592 ms 1056 KB Output is correct
43 Correct 274 ms 812 KB Output is correct
44 Correct 276 ms 604 KB Output is correct
45 Correct 467 ms 604 KB Output is correct
46 Correct 501 ms 852 KB Output is correct
47 Correct 443 ms 604 KB Output is correct
48 Correct 477 ms 804 KB Output is correct
49 Incorrect 472 ms 1052 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 13 ms 800 KB Output is correct
26 Correct 13 ms 348 KB Output is correct
27 Correct 13 ms 560 KB Output is correct
28 Correct 13 ms 344 KB Output is correct
29 Correct 13 ms 572 KB Output is correct
30 Correct 13 ms 348 KB Output is correct
31 Correct 12 ms 348 KB Output is correct
32 Correct 12 ms 348 KB Output is correct
33 Correct 13 ms 344 KB Output is correct
34 Correct 569 ms 824 KB Output is correct
35 Correct 590 ms 804 KB Output is correct
36 Correct 615 ms 1056 KB Output is correct
37 Correct 574 ms 796 KB Output is correct
38 Correct 577 ms 856 KB Output is correct
39 Correct 580 ms 808 KB Output is correct
40 Correct 607 ms 804 KB Output is correct
41 Correct 572 ms 600 KB Output is correct
42 Correct 577 ms 800 KB Output is correct
43 Correct 282 ms 1052 KB Output is correct
44 Correct 277 ms 816 KB Output is correct
45 Correct 489 ms 804 KB Output is correct
46 Correct 485 ms 824 KB Output is correct
47 Correct 444 ms 1052 KB Output is correct
48 Correct 478 ms 600 KB Output is correct
49 Incorrect 497 ms 820 KB Output isn't correct
50 Halted 0 ms 0 KB -