제출 #349249

#제출 시각아이디문제언어결과실행 시간메모리
349249David_MGame (IOI14_game)C++14
0 / 100
2 ms1532 KiB
#include<bits/stdc++.h> using namespace std; int a[1505]; queue <int> q[1505]; void initialize(int n){ for (int i=2; i<=n; i++)a[i]=1; } int hasEdge(int u, int v){ int e=0; if(a[u])swap(v, u); if(!a[u]){ a[v]--; if(!a[v]){ e=1; while(!q[v].empty()){ if(a[q[v].front()])a[q[v].front()]--; q[v].pop(); } } }else q[v].push(u),q[u].push(v); return e; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...