oj.uz

Submission #438775

# Submission time Handle Problem Language Result Execution time Memory
438775 2021-06-28T15:07:06 Z shahriarkhan ICC (CEOI16_icc) C++14
0 / 100
 1 ms 332 KB 
#include<bits/stdc++.h>
#include "icc.h"
using namespace std ;

void run(int N)
{
    int vis[N+1][N+1] ;
    for(int i = 0 ; i <= N ; ++i)
    {
        for(int j = 0 ; j <= N ; ++j)
        {
            vis[i][j] = 0 ;
        }
        vis[i][i] = 1 ;
    }
    while(1)
    {
        int ret[2] = {0} , cnt = 0 ;
        for(int i = 1 ; i <= N ; ++i)
        {
            int a[1] , siz_a = 1 , b[N+1] , siz_b = 0 ;
            for(int j = 1 ; j <= N ; ++j)
            {
                if(vis[i][j]) continue ;
                b[siz_b++] = j ;
            }
            if(!siz_b) continue ;
            if(query(siz_a,siz_b,a,b)) ret[cnt++] = i ;
        }
        setRoad(ret[0],ret[1]) ;
        vis[ret[0]][ret[1]] = 1 ;
        vis[ret[1]][ret[0]] = 1 ;
    }

}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -