Submission #1006470

#TimeUsernameProblemLanguageResultExecution timeMemory
1006470devariaotaGame (IOI14_game)C++17
100 / 100
191 ms8788 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 1505;
int n, f[N];
void initialize(int n) {

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