Submission #1036955

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036955		vanea	Game (IOI14_game)	C++14	0 / 100	1 ms	348 KiB

game

#include <bits/stdc++.h>
#include "game.h"
using namespace std;
using ll = long long;

const int mxN = 2e3+10;

int cnt[mxN], n, past = 0;

int hasEdge(int u, int v) {
    ++cnt[u]; ++cnt[v];
    if(cnt[u] == n-1 || cnt[v] == n-1) --past;
    if(cnt[u] == n-1 || cnt[v] == n-1) return 1;
    if((cnt[u] == n-2 || cnt[v] == n-2) && past) {
        --past;
        if(cnt[u] == n-2) cnt[u] = n;
        else if(cnt[v] == n-2) cnt[v] = n;
        return 1;
    }
    if(cnt[u] == n-2) past++;
    if(cnt[v] == n-2) past++;
    return 0;
}

void initialize(int N) {
    n = N;
}

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