답안 #375653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375653 2021-03-09T16:13:21 Z Alex_tz307 게임 (IOI14_game) C++17
100 / 100
566 ms 16108 KB
#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1505;
int N, p[NMAX], sz[NMAX], cnt[NMAX][NMAX];

int get(int x) {
    if(x == p[x])
        return x;
    return p[x] = get(p[x]);
}

void unite(int u, int v) {
    if(u == v)
        return;
    if(sz[u] < sz[v])
        swap(u, v);
    for(int k = 1; k <= N; ++k)
        cnt[u][k] += cnt[v][k], cnt[k][u] += cnt[v][k];
    cnt[u][v] = cnt[v][u] = 0;
    p[v] = u;
}

void initialize(int n) {
    N = n;
    for(int i = 1; i <= N; ++i) {
        p[i] = i;
        sz[i] = 1;
        for(int j = 1; j <= N; ++j)
            if(i != j)
                cnt[i][j] = 1;
    }
}

int hasEdge(int u, int v) {
    ++u, ++v;
    u = get(u);
    v = get(v);
    if(cnt[u][v] > 1) { /// daca am cnt > 1, pot sa nu le unesc si practic judge-ul nu afla nimic.
        /// Pentru a fi graful conex, trebuie sa unesc u si v, dar eu inca mai am niste variante de muchii cu care le pot uni.
        /// Astfel, judge-ul prin intrebarea asta nu afla nimic sigur, graful putand fi ori conex ori sa nu fie conex(asta stie doar cand ajunge la ultima muchie ce poate uni u si v si afla daca exista sau nu).
        /// E clar de aici ca jocul ce il simulam pentru a avea o strategie sigura de castig
        /// are la baza un graf conex(daca nu ar fi conex, judge-ul ar putea afla mai repede ca nu poate uni 2 
      	/// componente de pe parcurs si ar sti la un pas i < r ca graful nu e conex, deci am pierde).
        /// Prin prisma faptului ca 2 componente de pe parcurs sunt unite doar 
        /// in momentul in care mai exista o unica muchie ce le poate uni,
        /// inductiv, realizam ca judge-ul va afla ca graful este conex doar la intrebarea r,
        /// cand va uni ultimele 2 componente ramase cu singura muchie ramasa ce le poate uni, deci va pierde mereu.
        --cnt[u][v], --cnt[v][u];
        return 0;
    }
    /// Aici pe langa muchiile ce unesc 2 componente mai trasez si alea
    /// ce au capetele in 2 noduri din aceeasi componenta, dar asta nu este obligatoriu
    /// ele fiind irelevante pentru continuitatea jocului in acest punct.
    unite(u, v);
    return 1;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 2 ms 748 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 2 ms 748 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 2 ms 748 KB Output is correct
39 Correct 2 ms 748 KB Output is correct
40 Correct 2 ms 748 KB Output is correct
41 Correct 2 ms 748 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 3 ms 748 KB Output is correct
45 Correct 2 ms 748 KB Output is correct
46 Correct 2 ms 748 KB Output is correct
47 Correct 2 ms 748 KB Output is correct
48 Correct 2 ms 748 KB Output is correct
49 Correct 2 ms 748 KB Output is correct
50 Correct 2 ms 748 KB Output is correct
51 Correct 2 ms 748 KB Output is correct
52 Correct 2 ms 748 KB Output is correct
53 Correct 2 ms 748 KB Output is correct
54 Correct 2 ms 748 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 2 ms 748 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 3 ms 748 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 2 ms 748 KB Output is correct
39 Correct 2 ms 748 KB Output is correct
40 Correct 3 ms 748 KB Output is correct
41 Correct 2 ms 748 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 2 ms 748 KB Output is correct
45 Correct 2 ms 748 KB Output is correct
46 Correct 2 ms 748 KB Output is correct
47 Correct 2 ms 748 KB Output is correct
48 Correct 2 ms 748 KB Output is correct
49 Correct 2 ms 748 KB Output is correct
50 Correct 2 ms 748 KB Output is correct
51 Correct 2 ms 748 KB Output is correct
52 Correct 2 ms 748 KB Output is correct
53 Correct 2 ms 748 KB Output is correct
54 Correct 2 ms 748 KB Output is correct
55 Correct 50 ms 4204 KB Output is correct
56 Correct 53 ms 4204 KB Output is correct
57 Correct 50 ms 4204 KB Output is correct
58 Correct 50 ms 4204 KB Output is correct
59 Correct 54 ms 4204 KB Output is correct
60 Correct 58 ms 4204 KB Output is correct
61 Correct 63 ms 4204 KB Output is correct
62 Correct 49 ms 4204 KB Output is correct
63 Correct 51 ms 4204 KB Output is correct
64 Correct 48 ms 4204 KB Output is correct
65 Correct 49 ms 4204 KB Output is correct
66 Correct 63 ms 4204 KB Output is correct
67 Correct 49 ms 4204 KB Output is correct
68 Correct 50 ms 4204 KB Output is correct
69 Correct 51 ms 4204 KB Output is correct
70 Correct 50 ms 4204 KB Output is correct
71 Correct 51 ms 4204 KB Output is correct
72 Correct 49 ms 4204 KB Output is correct
73 Correct 51 ms 4204 KB Output is correct
74 Correct 49 ms 4204 KB Output is correct
75 Correct 50 ms 4204 KB Output is correct
76 Correct 120 ms 6892 KB Output is correct
77 Correct 127 ms 6764 KB Output is correct
78 Correct 128 ms 6764 KB Output is correct
79 Correct 112 ms 6764 KB Output is correct
80 Correct 115 ms 6764 KB Output is correct
81 Correct 123 ms 6764 KB Output is correct
82 Correct 114 ms 6764 KB Output is correct
83 Correct 120 ms 6764 KB Output is correct
84 Correct 115 ms 6764 KB Output is correct
85 Correct 216 ms 9452 KB Output is correct
86 Correct 215 ms 9452 KB Output is correct
87 Correct 210 ms 9452 KB Output is correct
88 Correct 212 ms 9452 KB Output is correct
89 Correct 208 ms 9452 KB Output is correct
90 Correct 208 ms 9452 KB Output is correct
91 Correct 224 ms 9580 KB Output is correct
92 Correct 215 ms 9452 KB Output is correct
93 Correct 206 ms 9452 KB Output is correct
94 Correct 493 ms 15852 KB Output is correct
95 Correct 494 ms 15984 KB Output is correct
96 Correct 494 ms 16108 KB Output is correct
97 Correct 495 ms 15980 KB Output is correct
98 Correct 566 ms 15852 KB Output is correct
99 Correct 494 ms 15852 KB Output is correct
100 Correct 517 ms 15852 KB Output is correct