Submission #889129

#TimeUsernameProblemLanguageResultExecution timeMemory
889129shezittGame (IOI14_game)C++14
15 / 100
1 ms348 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int N = 1505; int cont[N]; int neg = 0; int queries = 0; void initialize(int n) { memset(cont, 0, sizeof cont); neg = 0; return; } int hasEdge(int u, int v) { queries++; if(queries == 6){ // es la ultima // quiero probar si aca ya podria contestar lo que me de la gana // o sea no estoy forzado a que el grafo este conectado. return 0; } if(cont[u] == 2 or cont[v] == 2){ // must be positive return 1; } if(neg == 3){ // must be positive return 1; } cont[u]++; cont[v]++; neg++; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...