Submission #600516

# Submission time Handle Problem Language Result Execution time Memory
600516 2022-07-21T01:08:10 Z wiwiho Game (IOI14_game) C++14
100 / 100
404 ms 25400 KB
#include "game.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

vector<int> dsu, sz;
vector<vector<int>> e;
int n;

int findDSU(int a){
    if(dsu[a] != a) dsu[a] = findDSU(dsu[a]);
    return dsu[a];
}

void unionDSU(int a, int b){
    a = findDSU(a);
    b = findDSU(b);
    if(a == b) return;
    vector<int> cnt(n);
    for(int i = 0; i < n; i++){
        cnt[i] = e[b][i];
        e[b][i] -= cnt[i];
        if(i != b) e[i][b] -= cnt[i];
    }
    for(int i = 0; i < n; i++){
        if(i == a) continue;
        e[a][i] += cnt[i];
        e[i][a] += cnt[i];
    }
    dsu[b] = a;
    sz[a] += sz[b];
}

void initialize(int _n){
    n = _n;
    dsu.resize(n);
    iota(iter(dsu), 0);
    e.resize(n, vector<int>(n));
    sz.resize(n, 1);
}

int hasEdge(int u, int v){
    u = findDSU(u);
    v = findDSU(v);
    if(u == v) return 0;
    
    e[u][v]++;
    e[v][u]++;
    if(e[u][v] != sz[u] * sz[v]) return 0;
    
    unionDSU(u, v);
    return 1;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 320 KB Output is correct
44 Correct 2 ms 320 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 2 ms 364 KB Output is correct
47 Correct 2 ms 352 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 2 ms 360 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 324 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 2 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 224 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 224 KB Output is correct
22 Correct 1 ms 224 KB Output is correct
23 Correct 0 ms 224 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 324 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 1 ms 352 KB Output is correct
41 Correct 1 ms 352 KB Output is correct
42 Correct 1 ms 324 KB Output is correct
43 Correct 1 ms 360 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 356 KB Output is correct
49 Correct 2 ms 320 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 2 ms 324 KB Output is correct
55 Correct 36 ms 3020 KB Output is correct
56 Correct 38 ms 3048 KB Output is correct
57 Correct 40 ms 3064 KB Output is correct
58 Correct 36 ms 3088 KB Output is correct
59 Correct 39 ms 3052 KB Output is correct
60 Correct 38 ms 3032 KB Output is correct
61 Correct 36 ms 3104 KB Output is correct
62 Correct 39 ms 3032 KB Output is correct
63 Correct 36 ms 3092 KB Output is correct
64 Correct 35 ms 3092 KB Output is correct
65 Correct 36 ms 2996 KB Output is correct
66 Correct 38 ms 3004 KB Output is correct
67 Correct 37 ms 3036 KB Output is correct
68 Correct 42 ms 3036 KB Output is correct
69 Correct 39 ms 3000 KB Output is correct
70 Correct 37 ms 3028 KB Output is correct
71 Correct 37 ms 2980 KB Output is correct
72 Correct 40 ms 3156 KB Output is correct
73 Correct 52 ms 3064 KB Output is correct
74 Correct 37 ms 3004 KB Output is correct
75 Correct 37 ms 3024 KB Output is correct
76 Correct 85 ms 6732 KB Output is correct
77 Correct 109 ms 6712 KB Output is correct
78 Correct 82 ms 6672 KB Output is correct
79 Correct 92 ms 6708 KB Output is correct
80 Correct 92 ms 6732 KB Output is correct
81 Correct 86 ms 6632 KB Output is correct
82 Correct 87 ms 6732 KB Output is correct
83 Correct 94 ms 6668 KB Output is correct
84 Correct 85 ms 6624 KB Output is correct
85 Correct 169 ms 11552 KB Output is correct
86 Correct 152 ms 11452 KB Output is correct
87 Correct 179 ms 11472 KB Output is correct
88 Correct 151 ms 11476 KB Output is correct
89 Correct 146 ms 11524 KB Output is correct
90 Correct 178 ms 11448 KB Output is correct
91 Correct 151 ms 11420 KB Output is correct
92 Correct 164 ms 11440 KB Output is correct
93 Correct 148 ms 11472 KB Output is correct
94 Correct 392 ms 25188 KB Output is correct
95 Correct 373 ms 25400 KB Output is correct
96 Correct 365 ms 25084 KB Output is correct
97 Correct 357 ms 25108 KB Output is correct
98 Correct 366 ms 25164 KB Output is correct
99 Correct 385 ms 25120 KB Output is correct
100 Correct 404 ms 25064 KB Output is correct