제출 #468795

#제출 시각아이디문제언어결과실행 시간메모리
468795Carmel_Ab1ICC (CEOI16_icc)C++17
0 / 100
447 ms472 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 i=1; i<=n; i++) for(int j=i+1; j<=n; j++) if(1){ int I[1]={i},J[1]={j}; if(query(1,1,I,J)) setRoad(i,j); } }
#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...