oj.uz

Submission #438123

# Submission time Handle Problem Language Result Execution time Memory
438123 2021-06-27T15:51:47 Z shahriarkhan ICC (CEOI16_icc) C++14
0 / 100
 453 ms 492 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)
            {
                int a[1] , b[1] ;
                a[0] = i , b[0] = j ;
                if(query(1,1,a,b))
                {
                    if(s.find({i,j})==s.end()) setRoad(i,j) ;
                    s.insert({i,j}) ;
                }
            }
        }
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 460 KB Ok! 1379 queries used.
2 Incorrect 13 ms 492 KB Wrong road!

Subtask #2
0 / 11.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 453 ms 460 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 446 ms 460 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 402 ms 460 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 357 ms 464 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -