Submission #430840

#TimeUsernameProblemLanguageResultExecution timeMemory
430840CSQ31Game (IOI14_game)C++17
100 / 100
382 ms16452 KiB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
void initialize(int n) {

}
int c[2000];
//genius one liner
//partition edges but the larger endpoint
//end result will be a tree but H is never disconnected
int hasEdge(int u, int v) {
    return ++c[max(u,v)] == max(u,v);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...