oj.uz

Submission #930614

# Submission time Handle Problem Language Result Execution time Memory
930614 2024-02-20T08:07:15 Z dimashhh Game (IOI14_game) C++17
15 / 100
 28 ms 99160 KB 
#include <bits/stdc++.h>

using namespace std;
const int N = 2e6 + 12, MOD = 998244353;

typedef long long ll;

#include "game.h"
int _n;
//int read_int() {
//    int x;
//    assert(scanf("%d", &x) == 1);
//    return x;
//}
set<int> g[N];
int p[N],sz[N];
void initialize(int n) {
    _n = n;
    for(int i = 0;i < n;i++){
        p[i] = i;
        sz[i] = 1;
    }
    for(int i = 0;i < n;i++){
        p[i] = i;
        for(int j = 0;j < n;j++){
            g[i].insert(j);
        }
    }
}
int col[2002][2002];
int get(int v){
    if(p[v] == v) return v;
    return p[v] = get(p[v]);
}
void merge(int a,int b){
    a = get(a);
    b = get(b);
    p[a] = b;
    sz[b] += sz[a];
}
int hasEdge(int u, int v) {
    u = get(u);
    v = get(v);
    if (u == v) return 1;
    if(u > v) swap(u,v);
    col[u][v]++;
    if(col[u][v] == sz[u] * sz[v]){
        merge(u,v);
        return 1;
    }
    return 0;
}
//int main() {
//    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;
//}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 98904 KB Output is correct
2 Correct 24 ms 98908 KB Output is correct
3 Correct 24 ms 98904 KB Output is correct
4 Correct 23 ms 98908 KB Output is correct
5 Correct 24 ms 98908 KB Output is correct
6 Correct 24 ms 98880 KB Output is correct
7 Correct 24 ms 98908 KB Output is correct
8 Correct 28 ms 98904 KB Output is correct
9 Correct 24 ms 98924 KB Output is correct
10 Correct 24 ms 98908 KB Output is correct
11 Correct 23 ms 98940 KB Output is correct
12 Correct 23 ms 98892 KB Output is correct
13 Correct 25 ms 98792 KB Output is correct
14 Correct 23 ms 98908 KB Output is correct
15 Correct 24 ms 98904 KB Output is correct
16 Correct 24 ms 98904 KB Output is correct
17 Correct 23 ms 98908 KB Output is correct
18 Correct 25 ms 98904 KB Output is correct
19 Correct 24 ms 98908 KB Output is correct
20 Correct 25 ms 98908 KB Output is correct
21 Correct 23 ms 98908 KB Output is correct
22 Correct 24 ms 98908 KB Output is correct
23 Correct 22 ms 98840 KB Output is correct
24 Correct 23 ms 98908 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 99160 KB Output is correct
2 Correct 24 ms 98904 KB Output is correct
3 Correct 23 ms 98908 KB Output is correct
4 Correct 24 ms 99144 KB Output is correct
5 Correct 24 ms 98908 KB Output is correct
6 Correct 23 ms 98872 KB Output is correct
7 Correct 23 ms 98904 KB Output is correct
8 Correct 24 ms 98896 KB Output is correct
9 Correct 23 ms 98864 KB Output is correct
10 Correct 23 ms 98908 KB Output is correct
11 Correct 24 ms 98896 KB Output is correct
12 Correct 23 ms 98908 KB Output is correct
13 Correct 23 ms 99160 KB Output is correct
14 Correct 23 ms 98908 KB Output is correct
15 Correct 23 ms 98904 KB Output is correct
16 Correct 22 ms 98908 KB Output is correct
17 Correct 22 ms 98908 KB Output is correct
18 Correct 23 ms 98892 KB Output is correct
19 Correct 24 ms 98900 KB Output is correct
20 Correct 24 ms 98908 KB Output is correct
21 Correct 24 ms 98820 KB Output is correct
22 Correct 23 ms 98908 KB Output is correct
23 Correct 23 ms 98908 KB Output is correct
24 Correct 23 ms 98908 KB Output is correct
25 Incorrect 23 ms 99104 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 98908 KB Output is correct
2 Correct 24 ms 98908 KB Output is correct
3 Correct 24 ms 98908 KB Output is correct
4 Correct 23 ms 98952 KB Output is correct
5 Correct 22 ms 98908 KB Output is correct
6 Correct 23 ms 98908 KB Output is correct
7 Correct 23 ms 98908 KB Output is correct
8 Correct 24 ms 98908 KB Output is correct
9 Correct 23 ms 98908 KB Output is correct
10 Correct 23 ms 98776 KB Output is correct
11 Correct 24 ms 98924 KB Output is correct
12 Correct 23 ms 98908 KB Output is correct
13 Correct 22 ms 98884 KB Output is correct
14 Correct 25 ms 98904 KB Output is correct
15 Correct 26 ms 98908 KB Output is correct
16 Correct 22 ms 98908 KB Output is correct
17 Correct 24 ms 98908 KB Output is correct
18 Correct 24 ms 98904 KB Output is correct
19 Correct 24 ms 98908 KB Output is correct
20 Correct 23 ms 98864 KB Output is correct
21 Correct 24 ms 98924 KB Output is correct
22 Correct 23 ms 98908 KB Output is correct
23 Correct 24 ms 98908 KB Output is correct
24 Correct 24 ms 98848 KB Output is correct
25 Incorrect 23 ms 98908 KB Output isn't correct
26 Halted 0 ms 0 KB -