oj.uz

답안 #769923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769923 2023-06-30T13:47:25 Z GrindMachine 게임 (IOI14_game) C++17
100 / 100
 284 ms 28208 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi
http://blog.brucemerry.org.za/2014/07/

*/

const int MOD = 1e9 + 7;
const int N = 2e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "game.h"

int cnt[N][N];
int n;

struct DSU {
    vector<int> par, rankk, siz;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

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

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];

        rep(w,n){
            cnt[u][w] += cnt[v][w];
            cnt[w][u] += cnt[v][w];
        }
    }
};

DSU dsu;

void initialize(int n_) {
    n = n_;
    dsu = DSU(n);
    rep(i,n){
        rep(j,n){
            if(i != j){
                cnt[i][j] = 1;
            }
        }
    }
}

int hasEdge(int u, int v) {
    u = dsu.find(u);
    v = dsu.find(v);
    if(u == v) return 0;

    if(cnt[u][v] == 1){
        dsu.merge(u,v);
        return 1;
    }
    else{
        cnt[u][v]--;
        cnt[v][u]--;
        return 0;
    }

    assert(0);
    return -1;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 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 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 0 ms 212 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 212 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 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 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 312 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 436 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 448 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 440 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 1 ms 596 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 1 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 576 KB Output is correct
48 Correct 2 ms 572 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 1 ms 580 KB Output is correct
54 Correct 2 ms 596 KB Output is correct

Subtask #3
58.0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 280 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 284 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 304 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 1 ms 440 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 436 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 432 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 572 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 1 ms 576 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 572 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 37 ms 5064 KB Output is correct
56 Correct 29 ms 5036 KB Output is correct
57 Correct 28 ms 5100 KB Output is correct
58 Correct 28 ms 5028 KB Output is correct
59 Correct 29 ms 5088 KB Output is correct
60 Correct 41 ms 5060 KB Output is correct
61 Correct 31 ms 5036 KB Output is correct
62 Correct 28 ms 5048 KB Output is correct
63 Correct 29 ms 5056 KB Output is correct
64 Correct 28 ms 5028 KB Output is correct
65 Correct 27 ms 5032 KB Output is correct
66 Correct 33 ms 5204 KB Output is correct
67 Correct 29 ms 5068 KB Output is correct
68 Correct 29 ms 5028 KB Output is correct
69 Correct 39 ms 5068 KB Output is correct
70 Correct 29 ms 5140 KB Output is correct
71 Correct 29 ms 5064 KB Output is correct
72 Correct 35 ms 5124 KB Output is correct
73 Correct 28 ms 5072 KB Output is correct
74 Correct 28 ms 5068 KB Output is correct
75 Correct 28 ms 5044 KB Output is correct
76 Correct 64 ms 9804 KB Output is correct
77 Correct 65 ms 9804 KB Output is correct
78 Correct 65 ms 9804 KB Output is correct
79 Correct 64 ms 9784 KB Output is correct
80 Correct 65 ms 9784 KB Output is correct
81 Correct 64 ms 9820 KB Output is correct
82 Correct 84 ms 9784 KB Output is correct
83 Correct 66 ms 9828 KB Output is correct
84 Correct 70 ms 9948 KB Output is correct
85 Correct 173 ms 15348 KB Output is correct
86 Correct 114 ms 15436 KB Output is correct
87 Correct 142 ms 15352 KB Output is correct
88 Correct 119 ms 15436 KB Output is correct
89 Correct 114 ms 15440 KB Output is correct
90 Correct 114 ms 15444 KB Output is correct
91 Correct 114 ms 15368 KB Output is correct
92 Correct 125 ms 15392 KB Output is correct
93 Correct 113 ms 15436 KB Output is correct
94 Correct 278 ms 28140 KB Output is correct
95 Correct 284 ms 28208 KB Output is correct
96 Correct 265 ms 27992 KB Output is correct
97 Correct 278 ms 28120 KB Output is correct
98 Correct 255 ms 28096 KB Output is correct
99 Correct 259 ms 28108 KB Output is correct
100 Correct 264 ms 28096 KB Output is correct