oj.uz

Submission #633413

# Submission time Handle Problem Language Result Execution time Memory
633413 2022-08-22T11:32:49 Z ghostwriter Game (IOI14_game) C++14
100 / 100
 381 ms 25260 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Practising for VOI23 gold medal
*/
const int N = 1501;
int n, p[N], d[N][N];
int getp(int i) { return i == p[i]? i : p[i] = getp(p[i]); }
void initialize(int n) {
    ::n = n;
    FOR(i, 0, n - 1) {
        p[i] = i;
        FOR(j, 0, n - 1) d[i][j] = 1;
    }
}
int hasEdge(int u, int v) {
    u = getp(u);
    v = getp(v);
    if (d[u][v] > 1) {
        --d[u][v];
        --d[v][u];
        return 0;
    }
    p[v] = u;
    FOR(i, 0, n - 1) {
        d[u][i] += d[v][i];
        d[i][u] += d[v][i];
    }
    return 1;
}

Compilation message

game.cpp: In function 'void initialize(int)':
game.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
game.cpp:43:5: note: in expansion of macro 'FOR'
   43 |     FOR(i, 0, n - 1) {
      |     ^~~
game.cpp:26:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
game.cpp:45:9: note: in expansion of macro 'FOR'
   45 |         FOR(j, 0, n - 1) d[i][j] = 1;
      |         ^~~
game.cpp: In function 'int hasEdge(int, int)':
game.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
game.cpp:57:5: note: in expansion of macro 'FOR'
   57 |     FOR(i, 0, n - 1) {
      |     ^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 0 ms 316 KB Output is correct
24 Correct 0 ms 316 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 320 KB Output is correct
20 Correct 0 ms 316 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 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 340 KB Output is correct
30 Correct 1 ms 448 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 588 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 2 ms 596 KB Output is correct
39 Correct 2 ms 588 KB Output is correct
40 Correct 1 ms 588 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 588 KB Output is correct
43 Correct 1 ms 584 KB Output is correct
44 Correct 1 ms 692 KB Output is correct
45 Correct 2 ms 700 KB Output is correct
46 Correct 1 ms 692 KB Output is correct
47 Correct 1 ms 692 KB Output is correct
48 Correct 1 ms 692 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 696 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 1 ms 592 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 608 KB Output is correct

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 444 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 448 KB Output is correct
30 Correct 1 ms 448 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 448 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 588 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 588 KB Output is correct
42 Correct 1 ms 588 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 1 ms 608 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 588 KB Output is correct
50 Correct 2 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 584 KB Output is correct
54 Correct 1 ms 592 KB Output is correct
55 Correct 36 ms 5068 KB Output is correct
56 Correct 34 ms 5000 KB Output is correct
57 Correct 42 ms 5068 KB Output is correct
58 Correct 32 ms 5028 KB Output is correct
59 Correct 39 ms 5056 KB Output is correct
60 Correct 33 ms 5064 KB Output is correct
61 Correct 32 ms 5092 KB Output is correct
62 Correct 36 ms 4988 KB Output is correct
63 Correct 35 ms 5056 KB Output is correct
64 Correct 35 ms 5076 KB Output is correct
65 Correct 35 ms 4992 KB Output is correct
66 Correct 43 ms 5032 KB Output is correct
67 Correct 34 ms 4968 KB Output is correct
68 Correct 34 ms 5000 KB Output is correct
69 Correct 34 ms 5080 KB Output is correct
70 Correct 34 ms 5056 KB Output is correct
71 Correct 34 ms 5080 KB Output is correct
72 Correct 43 ms 4980 KB Output is correct
73 Correct 33 ms 4980 KB Output is correct
74 Correct 34 ms 5032 KB Output is correct
75 Correct 32 ms 4988 KB Output is correct
76 Correct 74 ms 8908 KB Output is correct
77 Correct 79 ms 8904 KB Output is correct
78 Correct 76 ms 8908 KB Output is correct
79 Correct 80 ms 8900 KB Output is correct
80 Correct 79 ms 8896 KB Output is correct
81 Correct 80 ms 8852 KB Output is correct
82 Correct 73 ms 8932 KB Output is correct
83 Correct 78 ms 8908 KB Output is correct
84 Correct 78 ms 8824 KB Output is correct
85 Correct 134 ms 13408 KB Output is correct
86 Correct 141 ms 13388 KB Output is correct
87 Correct 181 ms 13336 KB Output is correct
88 Correct 132 ms 13484 KB Output is correct
89 Correct 138 ms 13448 KB Output is correct
90 Correct 130 ms 13380 KB Output is correct
91 Correct 147 ms 13372 KB Output is correct
92 Correct 146 ms 13312 KB Output is correct
93 Correct 160 ms 13392 KB Output is correct
94 Correct 316 ms 25112 KB Output is correct
95 Correct 354 ms 25076 KB Output is correct
96 Correct 327 ms 25096 KB Output is correct
97 Correct 321 ms 25136 KB Output is correct
98 Correct 315 ms 25260 KB Output is correct
99 Correct 381 ms 25260 KB Output is correct
100 Correct 350 ms 25076 KB Output is correct