oj.uz

Submission #959669

# Submission time Handle Problem Language Result Execution time Memory
959669 2024-04-08T17:23:03 Z vjudge1 Game (IOI14_game) C++17
15 / 100
 2 ms 512 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1500;

int n, x, y, curr, need, cnt, p[N], sz[N];
unordered_set<int> vis, adj[N];

int findSet(int x) {
    return (p[x] == x ? x : p[x] = findSet(p[x]));
}

void unite(int x, int y) {
    x = findSet(x);
    y = findSet(y);

    if (sz[x] < sz[y]) swap(x, y);

    p[y] = x;
    sz[x] += sz[y];

    while (!adj[y].empty()) {
        int z = *adj[y].begin();
        
        adj[z].insert(x);
        adj[x].insert(z);

        adj[z].erase(y);
        adj[y].erase(adj[y].begin());
    }
}

void addEdge(int x, int y) {
    adj[x].insert(y);
    adj[y].insert(x);

    unite(x, y);
}

void removeEdge(int x, int y) {
    adj[x].erase(y);
    adj[y].erase(x);
}

void dfs(int x) {
    vis.insert(x);

    cnt += sz[x];
    if (cnt >= need) return;

    for (int y : adj[x]) {
        if (vis.find(y) != vis.end()) continue;
        dfs(y);
    }
}

void initialize(int NN) {
    n = NN;

    curr = 0;
    need = 1;
    for (int i = 0; i < n; i++) {
        p[i] = i;
        sz[i] = 1;

        for (int j = i+1; j < n; j++) {
            adj[i].insert(j);
            adj[j].insert(i);
        }
    }
}

int hasEdge(int u, int v) {
    curr++;
    if (curr >= (n-need)*need) need++;

    u = findSet(u);
    v = findSet(v);
    if (u == v) return 0;

    removeEdge(u, v);

    vis.clear();
    cnt = 0;
    dfs(u);
    if (cnt < need) {
        addEdge(u, v);
        return 1;
    }

    vis.clear();
    cnt = 0;
    dfs(v);
    if (cnt < need) {
        addEdge(u, v);
        return 1;
    }

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 356 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Incorrect 2 ms 344 KB Output isn't correct
26 Halted 0 ms 0 KB -