# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
438726 |
2021-06-28T14:26:42 Z |
shahriarkhan |
ICC (CEOI16_icc) |
C++14 |
|
431 ms |
580 KB |
#include<bits/stdc++.h>
#include "icc.h"
using namespace std ;
void run(int N)
{
set<pair<int,int> > s ;
while(1)
{
int siz = s.size() ;
if(siz==(N-1)) break ;
for(int i = 1 ; i <= N ; ++i)
{
for(int j = i + 1 ; j <= N ; ++j)
{
if(s.find({i,j})!=s.end()) continue ;
int a[1] , b[1] ;
a[0] = i , b[0] = j ;
if(query(1,1,a,b))
{
setRoad(i,j) ;
s.insert({i,j}) ;
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
84 ms |
460 KB |
Ok! 1301 queries used. |
2 |
Incorrect |
12 ms |
488 KB |
Wrong road! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
239 ms |
464 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
431 ms |
468 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
401 ms |
476 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
373 ms |
580 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
379 ms |
464 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |