Submission #232959

# Submission time Handle Problem Language Result Execution time Memory
232959 2020-05-18T18:57:15 Z cfalas ICC (CEOI16_icc) C++14
0 / 100
5 ms 384 KB
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID (l+r)/2
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef vector<int> vi;

#include "icc.h"

void run(int n){
	for(int i=0;i<n;i++){
		vi t;
		for(int j=0;j<n;j++){
			int a[1] = {j+1};
			int b[n-1];
			int cnt=0;
			for(int k=0;k<n-1;k++) if(k!=j) b[cnt++]=k+1;
			if(query(1, n-1, a, b)){
				t.push_back(j+1);
			}
		}
		setRoad(t[0], t[1]);
	}
}

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