Submission #297540

#TimeUsernameProblemLanguageResultExecution timeMemory
297540peti1234게임 (IOI14_game)C++17
0 / 100
1 ms384 KiB
#include <bits/stdc++.h>

using namespace std;
const int c=1502;
int db[c], cnt, n;
bool v[c], e[c][c];
bool hasEdge(int a, int b) {
    if (v[b]) swap(a, b);
    if (!v[a] || db[b]!=cnt) {
        db[a]++, db[b]++, e[a][b]=1, e[b][a]=1;
        return 0;
    }
    v[b]=1, cnt++;
    for (int i=1; i<=n; i++) db[i]+=e[b][i];
    return 1;
}
void initialize(int w) {
    n=w, v[1]=1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...