제출 #568322

#제출 시각아이디문제언어결과실행 시간메모리
568322losmi247게임 (IOI14_game)C++14
15 / 100
1 ms308 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1502; int n; int cnt = 0,uzeo = 0,kolko[N]; void initialize(int br){ n = br; cnt = 0; for(int i = 0; i <= n; i++) kolko[i] = 0; } int hasEdge(int u,int v){ u++; v++; cnt++; kolko[u]++; kolko[v]++; if(kolko[u] == n-1 || kolko[v] == n-1 || (n*(n-1)/2)-cnt+1 == n-1-uzeo){ uzeo++; return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...