제출 #373378

#제출 시각아이디문제언어결과실행 시간메모리
373378urd05게임 (IOI14_game)C++14
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> using namespace std; bool used[80][80]; int n; int p[80]; int find(int a) { if (p[a]<0) { return a; } return p[a]=find(p[a]); } void merge(int a,int b) { a=find(a); b=find(b); if (a==b){ return; } p[a]+=p[b]; } void initialize(int nn) { n=nn; } int hasEdge(int u,int v) { used[u][v]=true; used[v][u]=true; memset(p,-1,sizeof(p)); for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { if (!used[i][j]) { merge(i,j); } } } if (p[find(0)]==-n) { return false; } else { used[u][v]=false; used[v][u]=false; return true; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...