Submission #65648

#	Time	Username	Problem	Language	Result	Execution time	Memory
65648		Kubalionzzale	Game (IOI14_game)	C++14	15 / 100	4 ms	904 KiB

game

#include "game.h"

#include <iostream>

int cnt[160000] = { 0 }, cnting = 0, cnting2 = 0;
int n;
int max, maxi = (n * (n - 1)) / 2;
void initialize(int N) {
    n = N;
    max = n;
    maxi = (n * (n - 1)) / 2;
}

int hasEdge(int u, int v) {
    ++cnt[u];
    ++cnt[v];
    ++cnting;
    if (cnt[u] == max - 1 || cnt[v] == max - 1 || (maxi - cnting) < n - cnting2 - 1)
    {
        ++cnting2;
        cnt[u] = 1e6;
        cnt[v] = 1e6;
        return 1;
    }
    else
        return 0;
}

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