Submission #58562

# Submission time Handle Problem Language Result Execution time Memory
58562 2018-07-18T08:02:11 Z Mamnoon_Siam ICC (CEOI16_icc) C++17
0 / 100
331 ms 944 KB
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 105;

int n;
int ok[maxn][maxn];

int ask(int u, int v) {
	int a[1] = {u}, b[1] = {v};
	return query(1, 1, a, b);
}

int chex(int u) {
	int a[1] = {u}, b[maxn];
	int sz_a = 1, sz_b = 0;
	for(int i = 1; i <= n; i++) {
		if(i == u) continue;
		if(!ok[u][i]) {
			b[sz_b++] = i;
		}
	}
	if(!sz_b) return 0;
	return query(sz_a, sz_b, a, b);
}

int find_another(int u) {
	for(int i = 1; i <= n; i++) {
		if(i == u) continue;
		if(!ok[u][i]) {
			if(ask(u, i)) {
				return i;
			}
		}
	} assert(false);
}

void run(int N) {
	n = N;
	while(true) {
		int u = -1;
		for(int i = 1; i <= n; i++) {
			if(chex(i)) {
				u = i;
				break;
			}
		}
		assert(u != -1);
		int v = find_another(u);
		if(u > v) swap(u, v);
		setRoad(u, v);
		ok[u][v] = 1;
		ok[v][u] = 1;
		// for(int u = 1; u <= n; u++) {
		// 	for(int v = u + 1; v <= n; v++) {
		// 		if(!ok[u][v]) {
		// 			if(ask(u, v)) {
		// 				setRoad(u, v);
		// 				ok[u][v] = 1;
		// 				ok[v][u] = 1;
		// 				goto hell;
		// 			}
		// 		}
		// 	}
		// }
		// assert(false);
		// hell : ;
	}
}
# Verdict Execution time Memory Grader output
1 Correct 22 ms 632 KB Ok! 301 queries used.
2 Incorrect 17 ms 632 KB Wrong road!
# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 632 KB Wrong road!
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 232 ms 724 KB Wrong road!
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 222 ms 744 KB Wrong road!
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 331 ms 944 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 311 ms 944 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -