oj.uz

Submission #101262

# Submission time Handle Problem Language Result Execution time Memory
101262 2019-03-18T05:07:35 Z dwsc ICC (CEOI16_icc) C++14
7 / 100
 352 ms 584 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
void run(int n) {
    set<ii> s;
    int a[1],b[1];
    for (int k = 0; k < n-1; k++){
        int done = 0;
    for (int i  =1; i <= n; i++){
        if (done) break;
        for (int j = i+1; j <= n; j++){
            if (s.find(ii(i,j)) != s.end()) continue;
            a[0] = i,b[0] = j;
            if (query(1,1,a,b)){
                setRoad(i,j);
                s.insert(ii(i,j));
                done = 1;
                break;
            }
        }
    }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 512 KB Ok! 1015 queries used.
2 Correct 65 ms 512 KB Ok! 1010 queries used.

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 297 ms 560 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 340 ms 584 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 352 ms 552 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 282 ms 512 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 263 ms 512 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -