oj.uz

Submission #380861

# Submission time Handle Problem Language Result Execution time Memory
380861 2021-03-23T10:37:41 Z IloveN Game (IOI14_game) C++14
42 / 100
 1000 ms 5356 KB 
#include<bits/stdc++.h>
#include "game.h"

using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N=2e3+10;
int n, root[N], mark[N][N];
vi S[N];

void merg(int u, int v)
{
    if (S[u].size() < S[v].size()) swap(u, v);
    for (int x : S[v]) root[x] = u, S[u].eb(x);
    S[v].clear();
}

void initialize(int x)
{
    n = x;
    for (int i = 0; i < n; ++i) root[i] = i, S[i].clear(), S[i].eb(i);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j) mark[i][j] = 0;
}

int count_edge(int u, int v)
{
    int res = 0;
    for (int x : S[u])
        for (int y : S[v])
            if (x < y) res += mark[x][y] ^ 1;
            else res += mark[y][x] ^ 1;
    return res;
}

int hasEdge(int u, int v)
{
    if (u > v) swap(u, v);
    mark[u][v] = 1;
    int ru = root[u];
    int rv = root[v];
    int cnt = count_edge(ru, rv);
    if (cnt > 0) return 0;
    merg(ru, rv);
    return 1;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory 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 492 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory 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 492 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 384 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 384 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 620 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 3 ms 748 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 3 ms 876 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 3 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 3 ms 748 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 2 ms 828 KB Output is correct
45 Correct 3 ms 748 KB Output is correct
46 Correct 2 ms 748 KB Output is correct
47 Correct 4 ms 748 KB Output is correct
48 Correct 5 ms 748 KB Output is correct
49 Correct 3 ms 748 KB Output is correct
50 Correct 7 ms 748 KB Output is correct
51 Correct 7 ms 760 KB Output is correct
52 Correct 7 ms 748 KB Output is correct
53 Correct 6 ms 748 KB Output is correct
54 Correct 8 ms 748 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory 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 384 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 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 2 ms 748 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 3 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 4 ms 748 KB Output is correct
43 Correct 3 ms 768 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 7 ms 748 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 6 ms 748 KB Output is correct
53 Correct 7 ms 748 KB Output is correct
54 Correct 6 ms 748 KB Output is correct
55 Correct 79 ms 5228 KB Output is correct
56 Correct 81 ms 5228 KB Output is correct
57 Correct 82 ms 5228 KB Output is correct
58 Correct 80 ms 5228 KB Output is correct
59 Correct 81 ms 5228 KB Output is correct
60 Correct 81 ms 5356 KB Output is correct
61 Correct 80 ms 5228 KB Output is correct
62 Correct 79 ms 5228 KB Output is correct
63 Correct 80 ms 5228 KB Output is correct
64 Correct 120 ms 5228 KB Output is correct
65 Correct 94 ms 5228 KB Output is correct
66 Correct 73 ms 5356 KB Output is correct
67 Correct 69 ms 5228 KB Output is correct
68 Correct 72 ms 5228 KB Output is correct
69 Correct 69 ms 5228 KB Output is correct
70 Correct 69 ms 5228 KB Output is correct
71 Execution timed out 1091 ms 4588 KB Time limit exceeded
72 Halted 0 ms 0 KB -