oj.uz

Submission #895404

# Submission time Handle Problem Language Result Execution time Memory
895404 2023-12-29T21:31:06 Z SalihSahin Game (IOI14_game) C++14
100 / 100
 374 ms 27468 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
#include "game.h"

int N;
vector<vector<int> > sz;
vector<vector<int> > edge;
vector<int> par;

int find(int a){
    if(a == par[a]) return a;
    return par[a] = find(par[a]);
}

void merge(int a, int b){
    a = find(a), b = find(b);
    if(a == b) return;

    if(sz[a].size() < sz[b].size()){
        par[a] = b;
        for(auto itr: sz[a]){
            sz[b].pb(itr);
        }
    }
    else{
        par[b] = a;
        for(auto itr: sz[b]){
            sz[a].pb(itr);
        }
    }
}

void initialize(int n){
    N = n;
    vector<int> v;
    v.assign(n, 1);
    par.resize(n);
    sz.resize(n);
    for(int i = 0; i < n; i++){
        par[i] = i;
        sz[i].pb(i);
        edge.pb(v);
    }
}

int hasEdge(int u, int v) {
    int choice = 0;
    int ou = u, ov = v;
    u = find(u), v = find(v);
    if(u == v){
        edge[ou][ov] = edge[ov][ou] = 0;
        return 0;
    }

    for(auto i: sz[u]){
        for(auto j: sz[v]){
            if(edge[i][j]){
                choice++;
                if(choice > 1) break;
            }
        }
        if(choice > 1) break;
    }

    if(choice == 1){
        merge(u, v);
        return 1;
    }
    else{
        edge[ou][ov] = edge[ov][ou] = 0;
        return 0;
    }
}

/*
int read_int() {
    int x;
    assert(scanf("%d", &x) == 1);
    return x;
}

int main() {
    int n, u, v;
    n = read_int();
    initialize(n);
    for (int i = 0; i < n * (n - 1) / 2; i++) {
        u = read_int();
        v = read_int();
        printf("%d\n", hasEdge(u, v));
    }
    return 0;
}
*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 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 344 KB Output is correct
23 Correct 0 ms 344 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 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 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 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 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 0 ms 544 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 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 348 KB Output is correct
12 Correct 0 ms 344 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 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 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 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 356 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 360 KB Output is correct
50 Correct 1 ms 356 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 33 ms 3924 KB Output is correct
56 Correct 34 ms 3932 KB Output is correct
57 Correct 45 ms 3920 KB Output is correct
58 Correct 34 ms 3920 KB Output is correct
59 Correct 34 ms 3924 KB Output is correct
60 Correct 34 ms 3988 KB Output is correct
61 Correct 45 ms 3964 KB Output is correct
62 Correct 34 ms 3772 KB Output is correct
63 Correct 34 ms 3920 KB Output is correct
64 Correct 51 ms 4248 KB Output is correct
65 Correct 58 ms 3924 KB Output is correct
66 Correct 32 ms 3932 KB Output is correct
67 Correct 32 ms 4204 KB Output is correct
68 Correct 33 ms 4016 KB Output is correct
69 Correct 33 ms 3924 KB Output is correct
70 Correct 32 ms 3932 KB Output is correct
71 Correct 32 ms 3928 KB Output is correct
72 Correct 31 ms 4836 KB Output is correct
73 Correct 33 ms 4944 KB Output is correct
74 Correct 41 ms 4764 KB Output is correct
75 Correct 32 ms 4956 KB Output is correct
76 Correct 81 ms 7884 KB Output is correct
77 Correct 79 ms 7768 KB Output is correct
78 Correct 80 ms 7764 KB Output is correct
79 Correct 79 ms 7900 KB Output is correct
80 Correct 80 ms 7768 KB Output is correct
81 Correct 88 ms 7760 KB Output is correct
82 Correct 83 ms 7764 KB Output is correct
83 Correct 80 ms 7764 KB Output is correct
84 Correct 79 ms 7768 KB Output is correct
85 Correct 148 ms 11836 KB Output is correct
86 Correct 153 ms 11856 KB Output is correct
87 Correct 141 ms 11856 KB Output is correct
88 Correct 138 ms 11860 KB Output is correct
89 Correct 140 ms 11860 KB Output is correct
90 Correct 140 ms 11700 KB Output is correct
91 Correct 149 ms 11836 KB Output is correct
92 Correct 139 ms 11856 KB Output is correct
93 Correct 139 ms 11712 KB Output is correct
94 Correct 352 ms 27340 KB Output is correct
95 Correct 374 ms 27468 KB Output is correct
96 Correct 367 ms 27276 KB Output is correct
97 Correct 359 ms 27324 KB Output is correct
98 Correct 337 ms 27212 KB Output is correct
99 Correct 356 ms 27216 KB Output is correct
100 Correct 353 ms 27432 KB Output is correct