oj.uz

Submission #289777

# Submission time Handle Problem Language Result Execution time Memory
289777 2020-09-03T03:58:46 Z ivan24 Game (IOI14_game) C++14
100 / 100
 561 ms 25468 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
using ll = int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second

const ll INF = 1e9;

ll max(ll x, ll y){
    return ((x > y) ? x : y);
}
ll min(ll x, ll y){
    return ((x < y) ? x : y);
}

class UnionFind {
private:
    ll n, connected_cnt;
    vi sz,p;
public:
    UnionFind(){}
    UnionFind (ll n): n(n), sz(n,1), p(n), connected_cnt(n){
        for (ll i = 0; n > i; i++) p[i] = i;
    }
    ll root (ll x){
        if (p[x] != x) p[x] = root(p[x]);
        return p[x];
    }
    void unify (ll x, ll y){
        x = root(x), y = root(y);
        if (x == y) return;
        if (sz[x] < sz[y]) swap(x,y);
        p[y] = x; sz[x] += sz[y];
        connected_cnt--;
    }
    ll get_connected_cnt(){
        return connected_cnt;
    }
};

class Solver{
private:
    ll n;
    vvi edgeCnt;
    UnionFind uf;
    void removeEdge(ll u, ll v){
        edgeCnt[u][v]--;
        edgeCnt[v][u]--;
    }
    void mergeComponents (ll u, ll v){
        u = uf.root(u), v = uf.root(v);
        if (edgeCnt[u][v]) return;
        if (u == v) return;

        uf.unify(u,v);
        ll rt = uf.root(v);
        for (ll i = 0; n > i; i++){
            edgeCnt[i][rt] = edgeCnt[i][v]+edgeCnt[i][u];
            edgeCnt[rt][i] = edgeCnt[v][i]+edgeCnt[u][i];
        }
        ll other = u+v-rt;
        for (ll i = 0; n > i; i++){
            edgeCnt[i][other] = 0;
            edgeCnt[other][i] = 0;
        }
    }
public:
    Solver(){}
    Solver(ll n): n (n), edgeCnt(n,vi(n,1)), uf(n){}
    ll hasEdge(ll u, ll v){
        u = uf.root(u), v = uf.root(v);
        if (u == v) return 0;
        removeEdge(u,v);
        if (edgeCnt[u][v]) return 0;
        else{
            mergeComponents(u,v);
            return 1;
        }
    }
};

Solver mySolver;

void initialize(int n) {
    mySolver = Solver(n);
}

int hasEdge(int u, int v) {
    return mySolver.hasEdge(u,v);
}

Compilation message

game.cpp: In constructor 'UnionFind::UnionFind(ll)':
game.cpp:25:11: warning: 'UnionFind::p' will be initialized after [-Wreorder]
   25 |     vi sz,p;
      |           ^
game.cpp:24:11: warning:   'll UnionFind::connected_cnt' [-Wreorder]
   24 |     ll n, connected_cnt;
      |           ^~~~~~~~~~~~~
game.cpp:28:5: warning:   when initialized here [-Wreorder]
   28 |     UnionFind (ll n): n(n), sz(n,1), p(n), connected_cnt(n){
      |     ^~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 2 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 2 ms 384 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 384 KB Output is correct
55 Correct 52 ms 3064 KB Output is correct
56 Correct 52 ms 3192 KB Output is correct
57 Correct 53 ms 3192 KB Output is correct
58 Correct 54 ms 3192 KB Output is correct
59 Correct 53 ms 3192 KB Output is correct
60 Correct 51 ms 3192 KB Output is correct
61 Correct 54 ms 3192 KB Output is correct
62 Correct 52 ms 3192 KB Output is correct
63 Correct 53 ms 3192 KB Output is correct
64 Correct 50 ms 3192 KB Output is correct
65 Correct 48 ms 3192 KB Output is correct
66 Correct 53 ms 3192 KB Output is correct
67 Correct 52 ms 3192 KB Output is correct
68 Correct 53 ms 3192 KB Output is correct
69 Correct 54 ms 3192 KB Output is correct
70 Correct 52 ms 3192 KB Output is correct
71 Correct 52 ms 3192 KB Output is correct
72 Correct 56 ms 3192 KB Output is correct
73 Correct 51 ms 3192 KB Output is correct
74 Correct 51 ms 3192 KB Output is correct
75 Correct 52 ms 3192 KB Output is correct
76 Correct 124 ms 6772 KB Output is correct
77 Correct 134 ms 6776 KB Output is correct
78 Correct 126 ms 6776 KB Output is correct
79 Correct 122 ms 6776 KB Output is correct
80 Correct 122 ms 6776 KB Output is correct
81 Correct 122 ms 6892 KB Output is correct
82 Correct 124 ms 6776 KB Output is correct
83 Correct 120 ms 6776 KB Output is correct
84 Correct 119 ms 6776 KB Output is correct
85 Correct 225 ms 10616 KB Output is correct
86 Correct 228 ms 11640 KB Output is correct
87 Correct 223 ms 11640 KB Output is correct
88 Correct 224 ms 11596 KB Output is correct
89 Correct 225 ms 11640 KB Output is correct
90 Correct 222 ms 11608 KB Output is correct
91 Correct 230 ms 11704 KB Output is correct
92 Correct 229 ms 11592 KB Output is correct
93 Correct 227 ms 11544 KB Output is correct
94 Correct 557 ms 25300 KB Output is correct
95 Correct 549 ms 25208 KB Output is correct
96 Correct 558 ms 25468 KB Output is correct
97 Correct 550 ms 25356 KB Output is correct
98 Correct 554 ms 25208 KB Output is correct
99 Correct 557 ms 25336 KB Output is correct
100 Correct 561 ms 25148 KB Output is correct