Submission #288514

#	Time	Username	Problem	Language	Result	Execution time	Memory
288514		emil_physmath	Game (IOI14_game)	C++17	0 / 100	2 ms	512 KiB

game

#include <iostream>
#include <algorithm>
#include "game.h"
using namespace std;
const int maxN = 1501;

int n;
bool asked[maxN][maxN];
int par[maxN], sz[maxN];
int Root(int v) {
    return v == par[v] ? v : par[v] = Root(par[v]);
}
void Union(int u, int v)
{
    u = Root(u); v = Root(v);
    if (u == v) return;
    if (sz[u] > sz[v]) swap(u, v);
    sz[v] += sz[u];
    par[u] = v;
}
void initialize(int n_) {
    n = n_;
    for (int v = 1; v <= n; ++v) {
        par[v] = v, sz[v] = 1;
        for (int u = 1; u <= n; ++u)
            asked[u][v] = false;
    }
}

int cnt = -1;
int hasEdge(int u, int v) {
    ++cnt;
    cnt %= n * (n - 1) / 2;
    if (cnt == 0)
    {
        if (u > v) swap(u, v);
        if (u == 1) throw;
        else if (u == 2) while (true) cerr << "";
    }
    asked[u][v] = asked[v][u] = true;
    for (int x = 1; x <= n; ++x)
        for (int y = 1; y <= n; ++y)
        {
            if (x == y) continue;
            if (Root(x) == Root(u) && Root(y) == Root(v) && !asked[x][y]) {
                if (cnt == n * (n - 1) / 2 - 1)
                {
                    // cerr << "WA\n";
                }
                return 0;
            }
        }
    Union(u, v);
    if (cnt == n * (n - 1) / 2 - 1)
    {
        for (int v = 1; v <= n; ++v)
            if (Root(v) != Root(1)) {
                // cerr << "WA\n";
                return 1;
            }
        // cerr << "OK ";
    }
    return 1;
}

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