oj.uz

Submission #930907

# Submission time Handle Problem Language Result Execution time Memory
930907 2024-02-20T18:02:18 Z Art_ogo Game (IOI14_game) C++17
0 / 100
 2 ms 11000 KB 
#include <bits/stdc++.h>
#include "game.h"

using namespace std;

const int MAXN = 1600;

int p[MAXN];
int sz[MAXN];
int cnt[MAXN][MAXN];

int find_set(int a){
    if(p[a] == a)
        return a;
    return p[a] = find_set(p[a]);
}

void union_sets(int a, int b){
    a = find_set(a);
    b = find_set(b);
    if(a == b)
        return;
    if(sz[a] < sz[b])
        swap(a, b);
    for(int i = 0; i < MAXN; i++){
        cnt[i][a] += cnt[b][i];
        cnt[a][i] += cnt[b][i];
    }
    p[b] = a;
}

void initialize(int n) {
    memset(cnt, 0, sizeof(cnt));
    for(int i = 0; i <= n; i++){
        p[i] = i;
        sz[i] = 1;
    }
}

int hasEdge(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if(u == v)
        return 0;
    cnt[u][v]++;
    cnt[v][u]++;
    if(cnt[u][v] == sz[u]*sz[v])
        return 1;
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 10840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 10840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 11000 KB Output isn't correct
2 Halted 0 ms 0 KB -