oj.uz

Submission #959672

# Submission time Handle Problem Language Result Execution time Memory
959672 2024-04-08T17:36:41 Z vjudge1 Game (IOI14_game) C++17
0 / 100
 1 ms 348 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1500;

int n, cnt, idx, sum, a[N];
set<int> vis, adj[N];

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

    sum++;
    //if (sum >= idx) return;

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

        dfs(y);
        //if (sum >= idx) return;
    }
}

void initialize(int NN) {
    n = NN;
    cnt = 0;
    idx = 1;

    a[1] = 0;
    for (int i = 2; i <= n; i++) {
        a[i] = a[i-1] + n-i+1;
    }

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

int hasEdge(int u, int v) {
    cnt++;
    while (idx+1 <= n && a[idx+1] <= cnt) idx++;

    adj[u].erase(v);
    adj[v].erase(u);

    vis.clear();
    sum = 0;
    dfs(u);
    if (sum < idx) {
        adj[u].insert(v);
        adj[v].insert(u);
        return 1;
    }

    vis.clear();
    sum = 0;
    dfs(v);
    if (sum < idx) {
        adj[u].insert(v);
        adj[v].insert(u);
        return 1;
    }

    return 0;
}

Subtask #1
0 / 15.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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB Output isn't correct
5 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 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -