Submission #166145

# Submission time Handle Problem Language Result Execution time Memory
166145 2019-11-30T23:31:13 Z tri Game (IOI14_game) C++14
100 / 100
641 ms 25340 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = true;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;

int N;

int cnt[1500][1500];

int id[1500];

void initialize(int iN) {
    N = iN;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cnt[i][j] = i != j;
        }
    }

    for (int i = 0; i < N; i++) {
        id[i] = i;
    }
}

int hasEdge(int u, int v) {

    int c1 = id[u], c2 = id[v];
    cnt[c1][c2]--;
    cnt[c2][c1]--;
    if (cnt[c1][c2] > 0) {
        return false;
    }

    for (int i = 0; i < N; i++) {
        if (i != c1 && i != c2) {
            cnt[c1][i] += cnt[c2][i];
        }
    }
    for (int i = 0; i < N; i++) {
        cnt[i][c1] = cnt[c1][i];
    }

    for (int i = 0; i < N; i++) {
        cnt[c2][i] = 0;
        cnt[i][c2] = 0;
    }

    for (int i = 0; i < N; i++) {
        if (id[i] == c2) {
            id[i] = c1;
        }
    }

    return true;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 400 KB Output is correct
21 Correct 2 ms 404 KB Output is correct
22 Correct 2 ms 368 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 296 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 368 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 3 ms 764 KB Output is correct
35 Correct 3 ms 760 KB Output is correct
36 Correct 3 ms 760 KB Output is correct
37 Correct 3 ms 764 KB Output is correct
38 Correct 4 ms 788 KB Output is correct
39 Correct 3 ms 732 KB Output is correct
40 Correct 3 ms 760 KB Output is correct
41 Correct 3 ms 760 KB Output is correct
42 Correct 3 ms 760 KB Output is correct
43 Correct 3 ms 760 KB Output is correct
44 Correct 3 ms 760 KB Output is correct
45 Correct 3 ms 760 KB Output is correct
46 Correct 4 ms 760 KB Output is correct
47 Correct 3 ms 760 KB Output is correct
48 Correct 3 ms 760 KB Output is correct
49 Correct 3 ms 764 KB Output is correct
50 Correct 3 ms 760 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 3 ms 764 KB Output is correct
53 Correct 3 ms 760 KB Output is correct
54 Correct 3 ms 760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 276 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 15 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 508 KB Output is correct
27 Correct 2 ms 424 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 3 ms 760 KB Output is correct
35 Correct 3 ms 760 KB Output is correct
36 Correct 4 ms 760 KB Output is correct
37 Correct 3 ms 760 KB Output is correct
38 Correct 3 ms 760 KB Output is correct
39 Correct 3 ms 760 KB Output is correct
40 Correct 3 ms 760 KB Output is correct
41 Correct 3 ms 760 KB Output is correct
42 Correct 3 ms 760 KB Output is correct
43 Correct 3 ms 760 KB Output is correct
44 Correct 3 ms 760 KB Output is correct
45 Correct 3 ms 760 KB Output is correct
46 Correct 3 ms 760 KB Output is correct
47 Correct 3 ms 760 KB Output is correct
48 Correct 3 ms 760 KB Output is correct
49 Correct 3 ms 760 KB Output is correct
50 Correct 3 ms 760 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 3 ms 760 KB Output is correct
53 Correct 3 ms 760 KB Output is correct
54 Correct 3 ms 760 KB Output is correct
55 Correct 55 ms 5112 KB Output is correct
56 Correct 60 ms 5112 KB Output is correct
57 Correct 55 ms 5112 KB Output is correct
58 Correct 55 ms 5232 KB Output is correct
59 Correct 54 ms 5112 KB Output is correct
60 Correct 54 ms 5112 KB Output is correct
61 Correct 55 ms 5100 KB Output is correct
62 Correct 55 ms 5116 KB Output is correct
63 Correct 56 ms 5160 KB Output is correct
64 Correct 47 ms 5116 KB Output is correct
65 Correct 44 ms 5072 KB Output is correct
66 Correct 55 ms 5240 KB Output is correct
67 Correct 56 ms 5112 KB Output is correct
68 Correct 55 ms 5112 KB Output is correct
69 Correct 56 ms 5128 KB Output is correct
70 Correct 55 ms 5112 KB Output is correct
71 Correct 53 ms 5112 KB Output is correct
72 Correct 54 ms 5112 KB Output is correct
73 Correct 53 ms 5112 KB Output is correct
74 Correct 53 ms 5116 KB Output is correct
75 Correct 54 ms 5112 KB Output is correct
76 Correct 127 ms 8952 KB Output is correct
77 Correct 131 ms 8952 KB Output is correct
78 Correct 129 ms 8956 KB Output is correct
79 Correct 129 ms 9000 KB Output is correct
80 Correct 132 ms 8952 KB Output is correct
81 Correct 127 ms 8952 KB Output is correct
82 Correct 126 ms 8952 KB Output is correct
83 Correct 209 ms 8952 KB Output is correct
84 Correct 128 ms 8952 KB Output is correct
85 Correct 233 ms 13432 KB Output is correct
86 Correct 227 ms 13524 KB Output is correct
87 Correct 225 ms 13432 KB Output is correct
88 Correct 241 ms 13560 KB Output is correct
89 Correct 239 ms 13432 KB Output is correct
90 Correct 237 ms 13464 KB Output is correct
91 Correct 256 ms 13504 KB Output is correct
92 Correct 241 ms 13400 KB Output is correct
93 Correct 239 ms 13604 KB Output is correct
94 Correct 641 ms 25208 KB Output is correct
95 Correct 590 ms 25216 KB Output is correct
96 Correct 595 ms 25336 KB Output is correct
97 Correct 623 ms 25340 KB Output is correct
98 Correct 614 ms 25212 KB Output is correct
99 Correct 630 ms 25312 KB Output is correct
100 Correct 587 ms 25208 KB Output is correct