Submission #152302

#	Time	Username	Problem	Language	Result	Execution time	Memory
152302		abacaba	Game (IOI14_game)	C++14	0 / 100	3 ms	504 KiB

game

#include <iostream>
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <math.h>
#include <random>
#include <string>
#include <cstring>
#include <set>
#include <vector>
#include <map>
using namespace std;

#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
 
const int inf = 2e9;
const int N = 5e3 + 15;
int n, deg[N];

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

int hasEdge(int u, int v) {
    ++deg[u], ++deg[v];
    if(deg[u] == n - 1 || deg[v] == n - 1)
        return 1;
    return 0;
}

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