oj.uz

Submission #947529

# Submission time Handle Problem Language Result Execution time Memory
947529 2024-03-16T10:44:52 Z steveonalex Game (IOI14_game) C++11
100 / 100
 311 ms 25468 KB 
#include <bits/stdc++.h>
#include "game.h"

 
using namespace std;

 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        for(int i = 0; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}
    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }
};

const int N = 1505;
DSU G(N);
int cnt[N][N];

int n;
void initialize(int _n){
    n = _n;
    for(int i = 0; i<n; ++i)
    for(int j = i + 1; j<n; ++j) cnt[i][j] = cnt[j][i] = 1;
}

int hasEdge(int u, int v){
    u = G.find_set(u), v = G.find_set(v);
    if (u == v) return 0;
    cnt[u][v]--;
    cnt[v][u]--;
    if (cnt[u][v] > 0){
        return 0;
    }
    G.join_set(u, v);
    if (u != G.find_set(u)) swap(u, v);
    for(int i= 0; i<n; ++i){
        cnt[u][i] += cnt[v][i];
        cnt[i][u] += cnt[i][v];
        cnt[v][i] = cnt[i][v] = 0;
    }
    return 1;
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     initialize(10);
//     for(int i= 0; i<n; ++i)
//     for(int j= i+1; j<n; ++j) {
//         if (hasEdge(i, j)) cout << i << " " << j << endl;
//     }

//     return 0;
// }

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 344 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 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 420 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 2396 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 348 KB Output is correct
23 Correct 1 ms 348 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 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 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 608 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 2508 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 348 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 344 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 732 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 1 ms 600 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 604 KB Output is correct

Subtask #3
58.0 / 58.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 464 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 1 ms 596 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 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 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 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 456 KB Output is correct
33 Correct 0 ms 856 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 2 ms 608 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 1 ms 728 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 600 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 1 ms 732 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 832 KB Output is correct
54 Correct 2 ms 600 KB Output is correct
55 Correct 48 ms 5204 KB Output is correct
56 Correct 32 ms 6740 KB Output is correct
57 Correct 41 ms 5204 KB Output is correct
58 Correct 38 ms 5200 KB Output is correct
59 Correct 31 ms 5188 KB Output is correct
60 Correct 46 ms 5052 KB Output is correct
61 Correct 31 ms 5084 KB Output is correct
62 Correct 33 ms 5212 KB Output is correct
63 Correct 32 ms 5212 KB Output is correct
64 Correct 33 ms 5204 KB Output is correct
65 Correct 29 ms 5084 KB Output is correct
66 Correct 39 ms 5216 KB Output is correct
67 Correct 32 ms 6656 KB Output is correct
68 Correct 46 ms 6736 KB Output is correct
69 Correct 32 ms 6748 KB Output is correct
70 Correct 31 ms 5204 KB Output is correct
71 Correct 30 ms 5212 KB Output is correct
72 Correct 31 ms 5208 KB Output is correct
73 Correct 33 ms 5056 KB Output is correct
74 Correct 31 ms 6740 KB Output is correct
75 Correct 31 ms 5200 KB Output is correct
76 Correct 70 ms 9872 KB Output is correct
77 Correct 86 ms 9044 KB Output is correct
78 Correct 70 ms 8872 KB Output is correct
79 Correct 70 ms 9740 KB Output is correct
80 Correct 88 ms 8912 KB Output is correct
81 Correct 73 ms 9756 KB Output is correct
82 Correct 69 ms 9812 KB Output is correct
83 Correct 72 ms 9728 KB Output is correct
84 Correct 70 ms 9812 KB Output is correct
85 Correct 123 ms 13344 KB Output is correct
86 Correct 120 ms 13880 KB Output is correct
87 Correct 132 ms 13992 KB Output is correct
88 Correct 132 ms 13904 KB Output is correct
89 Correct 122 ms 13492 KB Output is correct
90 Correct 124 ms 13468 KB Output is correct
91 Correct 124 ms 13572 KB Output is correct
92 Correct 133 ms 13488 KB Output is correct
93 Correct 123 ms 13352 KB Output is correct
94 Correct 311 ms 25468 KB Output is correct
95 Correct 276 ms 25220 KB Output is correct
96 Correct 281 ms 25256 KB Output is correct
97 Correct 289 ms 25052 KB Output is correct
98 Correct 274 ms 25132 KB Output is correct
99 Correct 272 ms 25180 KB Output is correct
100 Correct 278 ms 25144 KB Output is correct