Submission #1297098

#TimeUsernameProblemLanguageResultExecution timeMemory
1297098M_W_13Game (IOI14_game)C++20
100 / 100
163 ms13324 KiB
#include "game.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define st first
#define nd second
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
const int MAXN = 1507;
int cnt[MAXN];

void initialize(int N) {
    rep(i, N) {
        cnt[i] = 0;
    }
}

int hasEdge(int u, int v) {
    int w = max(u, v);
    cnt[w]++;
    return (cnt[w] == w);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...