oj.uz

Submission #947573

# Submission time Handle Problem Language Result Execution time Memory
947573 2024-03-16T12:50:45 Z Darren0724 ICC (CEOI16_icc) C++17
0 / 100
 228 ms 852 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
int n,cnt=0;
set<pair<int,int>> s;
void answer(int a,int b){
    setRoad(a,b);
    s.insert({a,b});
    cnt++;
    if(cnt==n-1){
        exit(0);
    }
}
void run(int N){
    n=N;
    for(int _=0;_<n-1;_++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i==j)continue;
                int a[1],b[1];
                a[0]=i,b[0]=j;
                if(s.find({i,j})==s.end()&&s.find({j,i})==s.end()&&query(1,1,a,b)){
                    answer(i,j);
                }
            }
        }
    }
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 228 ms 600 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 205 ms 604 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 189 ms 852 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 167 ms 604 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -