oj.uz

Submission #1117153

# Submission time Handle Problem Language Result Execution time Memory
1117153 2024-11-22T21:13:34 Z Sofiatpc ICC (CEOI16_icc) C++14
7 / 100
 201 ms 624 KB 
#include <bits/stdc++.h>
#include <icc.h>

using namespace std;

set<pair<int,int>>st;

void run(int n){
    for(int k = 1; k < n; k++){
        int u = 0, v = 0;
        for(int i = 1; i <= n; i++){
            if(u)break;
            for(int j = i+1; j <= n; j++){
                if(st.find({i,j}) != st.end())continue;
                int a[1],b[1];
                a[0] = i; b[0] = j;
                int x = query(1,1,a,b);
                if(x){u = i; v = j; break;}
            }
        }
        st.insert({u,v});
        setRoad(u,v);
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 592 KB Ok! 1015 queries used.
2 Correct 34 ms 620 KB Ok! 1010 queries used.

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 185 ms 616 KB Number of queries more than 5000 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 201 ms 592 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 180 ms 624 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 162 ms 592 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 149 ms 592 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -