제출 #418000

#제출 시각아이디문제언어결과실행 시간메모리
418000T0p_게임 (IOI14_game)C++14
15 / 100
1 ms248 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; int n, edge, edge_not; int pa[1505], deg_not[1505]; int fp(int u) { return (u == pa[u]) ? u : pa[u] = fp(pa[u]); } void initialize(int N) { n = N; for(int i=0 ; i<n ; i++) pa[i] = i; edge = n-1; edge_not = (n*(n-1))/2 - edge; } int hasEdge(int u, int v) { if(edge_not > 0 && deg_not[u]+1 != n-1 && deg_not[v]+1 != n-1) { edge_not--; deg_not[u]++; deg_not[v]++; return 0; } else if(edge > 0) { edge--; return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...