Submission #235900

#	Time	Username	Problem	Language	Result	Execution time	Memory
235900		Bilyana	Game (IOI14_game)	C++17	0 / 100	5 ms	384 KiB

game

#include <bits/stdc++.h>
using namespace std;

vector<bool> used;
vector<set<int>> cons;
vector<vector<int>> con;

void initialize(int n) {
    cons.resize(n);
    con.resize(n);
    used.resize(n, 0);
    for (int i=0; i<n; i++) {
        con[i].resize(n, 0);
        con[i][i] = 1;
        for (int j=0; j<n; j++) {
            if (i != j) {
                cons[i].insert(j);
            }
        }
    }
}

void removeEdge(int u, int v) {
    cons[u].erase(v);
    cons[v].erase(u);
}

bool update(int u) {
    if (cons[u].size() == 1) {
        int v = *cons[u].begin();
        con[u][v] = 1;
        con[v][u] = 1;
        removeEdge(u, v);
        update(v);
        return 1;
    }
    return 0;
}

int hasEdge(int u, int v) {
    fill(used.begin(), used.end(), 0);
    if (con[u][v] == 1) {
        return 0;
    }
    if (con[u][v] == 2) {
        return 1;
    }
    if (update(u) || update(v)) {
        return 1;
    }
    else {
        removeEdge(u, v);
    }
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58