Submission #438726

#TimeUsernameProblemLanguageResultExecution timeMemory
438726shahriarkhanICC (CEOI16_icc)C++14
0 / 100
431 ms580 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...