oj.uz

Submission #604973

# Submission time Handle Problem Language Result Execution time Memory
604973 2022-07-25T11:40:21 Z Hazem ICC (CEOI16_icc) C++14
0 / 100
 351 ms 500 KB 
#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

const int N = 2e5+10;
int a[N],par[N];

int find_par(int x){

    if(x==par[x])
        return x;
    
    return par[x] = find_par(par[x]);
}

void run(int n){

    for(int i=1;i<=n;i++)
        par[i] = i;

    int T = n-1;
    while(T--){
        for(int i=1;i<=n;i++)
            for(int j=i+1;j<=n;j++)
                if(find_par(i)!=find_par(j)){
                    int arr[] = {i};
                    int arr1[] = {j};

                    int v = query(1,1,arr,arr1);
                    if(v){
                        setRoad(i,j);
                        par[j] = i;
                        break;
                    }
                }
    }    
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 500 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 186 ms 480 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 351 ms 476 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 346 ms 476 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 314 ms 480 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 298 ms 476 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -