Submission #754565

# Submission time Handle Problem Language Result Execution time Memory
754565 2023-06-08T05:30:36 Z marvinthang Game (IOI14_game) C++17
100 / 100
421 ms 25140 KB
/*************************************
*    author: marvinthang             *
*    created: 08.06.2023 12:24:58    *
*************************************/

#include "game.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int MAX = 1505;

int N, lab[MAX], cnt[MAX][MAX];

void initialize(int n) {
    N = n;
    REP(i, N) lab[i] = -1;
    REP(i, N) REP(j, N) cnt[i][j] = i != j;    
}

int find(int u) {
    return lab[u] < 0 ? u : lab[u] = find(lab[u]);
}

int hasEdge(int u, int v) {
    u = find(u); v = find(v);
    if (u == v) return 0;
    --cnt[v][u];
    if (!--cnt[u][v]) {
        if (lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        REP(i, N) if (lab[i] < 0) {
            cnt[u][i] += cnt[v][i];
            cnt[i][u] += cnt[v][i];
        }
        return 1;
    }
    return 0;
}

#ifdef LOCAL
#include <stdio.h>
#include <assert.h>
#include "game.h"

int read_int() {
    int x;
    assert(scanf("%d", &x) == 1);
    return x;
}

int main() {
    file("game");
    int n, u, v;
    n = read_int();
    initialize(n);
    for (int i = 0; i < n * (n - 1) / 2; i++) {
        u = read_int();
        v = read_int();
        if (hasEdge(u, v)) puts("1");
        else puts("0");
    }
    return 0;
}
#endif
# Verdict Execution time Memory 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 312 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 304 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 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 340 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 308 KB Output is correct
22 Correct 1 ms 212 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 340 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 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 272 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 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 312 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 304 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 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 440 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 432 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 700 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 2 ms 572 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 1 ms 576 KB Output is correct
48 Correct 2 ms 684 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 2 ms 576 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 688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 340 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 300 KB Output is correct
7 Correct 0 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 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 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 340 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 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 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 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 468 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 572 KB Output is correct
36 Correct 1 ms 576 KB Output is correct
37 Correct 2 ms 724 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 596 KB Output is correct
41 Correct 2 ms 692 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 1 ms 576 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 1 ms 688 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 2 ms 580 KB Output is correct
53 Correct 2 ms 572 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 34 ms 5008 KB Output is correct
56 Correct 35 ms 5020 KB Output is correct
57 Correct 36 ms 5084 KB Output is correct
58 Correct 34 ms 5080 KB Output is correct
59 Correct 43 ms 5008 KB Output is correct
60 Correct 34 ms 5076 KB Output is correct
61 Correct 35 ms 5076 KB Output is correct
62 Correct 38 ms 5068 KB Output is correct
63 Correct 34 ms 5000 KB Output is correct
64 Correct 32 ms 5036 KB Output is correct
65 Correct 33 ms 5000 KB Output is correct
66 Correct 36 ms 4992 KB Output is correct
67 Correct 37 ms 4996 KB Output is correct
68 Correct 36 ms 5080 KB Output is correct
69 Correct 34 ms 5080 KB Output is correct
70 Correct 35 ms 4984 KB Output is correct
71 Correct 34 ms 5076 KB Output is correct
72 Correct 38 ms 5064 KB Output is correct
73 Correct 35 ms 5072 KB Output is correct
74 Correct 34 ms 5068 KB Output is correct
75 Correct 45 ms 4984 KB Output is correct
76 Correct 77 ms 8916 KB Output is correct
77 Correct 81 ms 8940 KB Output is correct
78 Correct 88 ms 8844 KB Output is correct
79 Correct 101 ms 8908 KB Output is correct
80 Correct 90 ms 8876 KB Output is correct
81 Correct 82 ms 8832 KB Output is correct
82 Correct 80 ms 8852 KB Output is correct
83 Correct 96 ms 8900 KB Output is correct
84 Correct 82 ms 8868 KB Output is correct
85 Correct 151 ms 13404 KB Output is correct
86 Correct 145 ms 13376 KB Output is correct
87 Correct 141 ms 13340 KB Output is correct
88 Correct 156 ms 13376 KB Output is correct
89 Correct 194 ms 13392 KB Output is correct
90 Correct 167 ms 13432 KB Output is correct
91 Correct 151 ms 13348 KB Output is correct
92 Correct 172 ms 13408 KB Output is correct
93 Correct 185 ms 13428 KB Output is correct
94 Correct 381 ms 25032 KB Output is correct
95 Correct 385 ms 25028 KB Output is correct
96 Correct 374 ms 25084 KB Output is correct
97 Correct 363 ms 25108 KB Output is correct
98 Correct 394 ms 25064 KB Output is correct
99 Correct 421 ms 25104 KB Output is correct
100 Correct 416 ms 25140 KB Output is correct