# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
468792 |
2021-08-29T16:28:58 Z |
Carmel_Ab1 |
ICC (CEOI16_icc) |
C++17 |
|
524 ms |
464 KB |
#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(get(i)!=get(j)){
int I[1]={i},J[1]={j};
if(query(1,1,I,J))
unite(i,j);
}
for(int i=1; i<=n; i++)
if(get(i)!=get(1))
setRoad(i,1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
7 ms |
460 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
91 ms |
464 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
524 ms |
460 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
416 ms |
460 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
384 ms |
460 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
361 ms |
460 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |