# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
1267409 | | WH8 | Game (IOI14_game) | C++20 | | 162 ms | 7048 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
int numleft[1505];
void initialize(int n) {
for(int i=0;i<n;i++){
numleft[i]=i;
}
}
int hasEdge(int u, int v) {
if(numleft[max(u,v)] > 1){
numleft[max(u,v)]--;
return 0;
}
else return 1;
return 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |