제출 #468796

#제출 시각아이디문제언어결과실행 시간메모리
468796Carmel_Ab1ICC (CEOI16_icc)C++17
0 / 100
11 ms488 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; typedef vector<int>vi; #define pb push_back vi par; int get(int x){return par[x]=(x==par[x]?x:get(par[x]));} void unite(int u,int v){ u=get(u),v=get(v); if(u==v)return; par[u]=v; } void run(int n){ par.resize(n+1); for(int i=0; i<=n; i++) par[i]=i; for(int k=0; k<n-1; k++){ int u=-1,v=-1; for(int i=1;u==-1 && v==-1 && i<=n; i++){ int a[1]={i}; int b[n-1]; for(int j=1,ix=0; j<=n; j++) if(i!=j) b[ix++]=j; if(query(1,n-1,a,b)){ if(u==-1) u=i; else v=i; } } setRoad(u,v); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...