# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
882315 |
2023-12-03T03:54:14 Z |
ono_de206 |
ICC (CEOI16_icc) |
C++14 |
|
231 ms |
612 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
//#define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
void run(int n) {
int A[n + 1], B[n + 1];
for(int t = 1; t < n; t++) {
bool fl = 1;
for(int i = 1; i <= n && fl; i++) {
for(int j = i + 1; j <= n && fl; j++) {
A[0] = i;
B[0] = j;
if(query(1, 1, A, B)) {
setRoad(i, j);
fl = 0;
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
604 KB |
Ok! 1015 queries used. |
2 |
Correct |
40 ms |
604 KB |
Ok! 1010 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
106 ms |
604 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
231 ms |
608 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
202 ms |
612 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
182 ms |
600 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
166 ms |
604 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |