oj.uz

Submission #468795

# Submission time Handle Problem Language Result Execution time Memory
468795 2021-08-29T16:35:38 Z Carmel_Ab1 ICC (CEOI16_icc) C++17
0 / 100
 447 ms 472 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(1){
                int I[1]={i},J[1]={j};
                if(query(1,1,I,J))
                    setRoad(i,j);
            }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 460 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 460 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 447 ms 472 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 409 ms 468 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 351 ms 460 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 327 ms 464 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -