oj.uz

Submission #539174

# Submission time Handle Problem Language Result Execution time Memory
539174 2022-03-18T14:16:00 Z astoria Game (IOI14_game) C++14
100 / 100
 522 ms 25156 KB 
#include <bits/stdc++.h>
#include "game.h"
using namespace std;

int _n;
int allSets[1500][1500]; //<index,#ofthem>
int rankOfRoot[1500];
int parent[1500];

int root(int x) {
    if (parent[x]==-1) return x;
    return parent[x] = root(parent[x]);
}

void connect(int x, int y) {
    int rootX = root(x), rootY = root(y);
    if (rootX == rootY) return; // same root
    if (rankOfRoot[rootX] > rankOfRoot[rootY]) {
        parent[rootY] = rootX;
    } else if (rankOfRoot[rootX] < rankOfRoot[rootY] ){
        parent[rootX] = rootY;
    } else {
        parent[rootY] = rootX;
        rankOfRoot[rootX]++;
    }
}

bool isConnected(int x, int y) {
    return root(x) == root(y);
}

void initialize (int n){
    _n = n;
    memset(parent,-1,sizeof(parent));
    memset(rankOfRoot,1,sizeof(rankOfRoot));
    for (int i=0; i<n; i++){
        for (int j=0; j<n; j++){
            if (i==j) allSets[i][j] = 0;
            else allSets[i][j] = 1;
        }
    }
}

int hasEdge(int u, int v){
    int x = root(u); int y = root(v);
    /*if (u==0 && v==2){
      cout << "R" << x << " " << y << endl;
      cout << allSets[0][2] << endl;
    }*/
    allSets[x][y]--;
    allSets[y][x]--;
    if (allSets[x][y] <= 0){
        //connect
        connect(x,y);
        int z = root(y);
        if (z==y){
            for (int i=0; i<_n; i++){
                if (i==x) continue;
                if (i==y) continue;
                if (allSets[i][x] <= 0) continue;
                int res = allSets[i][x];
                allSets[i][x] = 0;
                allSets[x][i] = 0;
                allSets[i][y] += res;
                allSets[y][i] += res;
            }
        }
        if (z==x){
            for (int i=0; i<_n; i++){
                if (i==x) continue;
                if (i==y) continue;
                if (allSets[i][y] <= 0) continue;
                int res = allSets[i][y];
                allSets[i][y] = 0;
                allSets[y][i] = 0;
                allSets[i][x] += res;
                allSets[x][i] += res;
            }
        }
        return 1;
    }
    else{
        return 0;
    }
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 440 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 448 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 2 ms 696 KB Output is correct
35 Correct 2 ms 696 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 696 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 692 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 708 KB Output is correct
50 Correct 2 ms 596 KB Output is correct
51 Correct 2 ms 692 KB Output is correct
52 Correct 2 ms 708 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 2 ms 708 KB Output is correct

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 312 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 440 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 396 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 1 ms 704 KB Output is correct
38 Correct 2 ms 708 KB Output is correct
39 Correct 2 ms 712 KB Output is correct
40 Correct 1 ms 708 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 2 ms 704 KB Output is correct
47 Correct 2 ms 704 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 1 ms 708 KB Output is correct
50 Correct 2 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 2 ms 596 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 2 ms 596 KB Output is correct
55 Correct 40 ms 5040 KB Output is correct
56 Correct 41 ms 5076 KB Output is correct
57 Correct 38 ms 5008 KB Output is correct
58 Correct 36 ms 5076 KB Output is correct
59 Correct 59 ms 5072 KB Output is correct
60 Correct 41 ms 5076 KB Output is correct
61 Correct 41 ms 5064 KB Output is correct
62 Correct 39 ms 4964 KB Output is correct
63 Correct 39 ms 5048 KB Output is correct
64 Correct 39 ms 5068 KB Output is correct
65 Correct 36 ms 5000 KB Output is correct
66 Correct 40 ms 5064 KB Output is correct
67 Correct 40 ms 5020 KB Output is correct
68 Correct 42 ms 4988 KB Output is correct
69 Correct 37 ms 5024 KB Output is correct
70 Correct 38 ms 5080 KB Output is correct
71 Correct 50 ms 5056 KB Output is correct
72 Correct 51 ms 4968 KB Output is correct
73 Correct 36 ms 5060 KB Output is correct
74 Correct 37 ms 4984 KB Output is correct
75 Correct 38 ms 5036 KB Output is correct
76 Correct 105 ms 8992 KB Output is correct
77 Correct 85 ms 8816 KB Output is correct
78 Correct 102 ms 8896 KB Output is correct
79 Correct 90 ms 8916 KB Output is correct
80 Correct 85 ms 8932 KB Output is correct
81 Correct 97 ms 8876 KB Output is correct
82 Correct 86 ms 8856 KB Output is correct
83 Correct 84 ms 8812 KB Output is correct
84 Correct 86 ms 8948 KB Output is correct
85 Correct 182 ms 13320 KB Output is correct
86 Correct 149 ms 13420 KB Output is correct
87 Correct 190 ms 13384 KB Output is correct
88 Correct 165 ms 13388 KB Output is correct
89 Correct 170 ms 13372 KB Output is correct
90 Correct 167 ms 13396 KB Output is correct
91 Correct 171 ms 13312 KB Output is correct
92 Correct 196 ms 13492 KB Output is correct
93 Correct 153 ms 13368 KB Output is correct
94 Correct 393 ms 25156 KB Output is correct
95 Correct 388 ms 25104 KB Output is correct
96 Correct 522 ms 25068 KB Output is correct
97 Correct 517 ms 25080 KB Output is correct
98 Correct 425 ms 25096 KB Output is correct
99 Correct 433 ms 25112 KB Output is correct
100 Correct 503 ms 25020 KB Output is correct