Submission #1295056

#TimeUsernameProblemLanguageResultExecution timeMemory
1295056danigGame (IOI14_game)C++20
15 / 100
2 ms568 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; int ct[1500]; int N1; int k=0; void initialize(int N) { k =0; N1=N; for (int i = 0; i < N; i++) ct[i] = 0; } int hasEdge(int u, int v) { ct[u]++; ct[v]++; if(ct[u] == N1-2) k++; if(ct[v]== N1-2) k++; if(ct[u] == N1-1) k--; if(ct[v] ==N1-1) k--; if(k== N1) return true; if(ct[u] == N1-1 || ct[v] == N1 - 1) { return true; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...