Submission #1050972

#	Time	Username	Problem	Language	Result	Execution time	Memory
1050972		rainboy	How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)	C++17	15 / 100	1 ms	344 KiB

avoid

#include "avoid.h"
#include <vector>

using namespace std;

const int N = 1000, L = 10;

typedef vector<int> vi;
typedef pair<int, int> pi;

pi scout(int q, int b) {
	if (q == 10) {
		for (int l = 0; l < L; l++) {
			vi ii;
			for (int i = 0; i < N; i++)
				if ((i >> l & 1) != 0)
					ii.push_back(i + 1);
			send(ii);
		}
		vi cc = wait();
		int i = 0;
		for (int l = 0; l < L; l++)
			if (cc[l])
				i |= 1 << l;
		return { i + 1, i + 1 };
	} else if (q == 20) {
		int lower = 0, upper = N;
		while (upper - lower > 1) {
			int m = (lower + upper) / 2;
			vi ii;
			for (int i = lower; i < m; i++)
				ii.push_back(i + 1);
			send(ii);
			if (wait()[0])
				upper = m;
			else
				lower = m;
		}
		int u = lower;
		lower = 0, upper = N + 1;
		while (upper - lower > 1) {
			int m = (lower + upper) / 2;
			vi ii;
			for (int i = lower; i < m; i++)
				if (i != u)
					ii.push_back(i + 1);
			if (ii.size() == 0) {
				lower = m;
				continue;
			}
			send(ii);
			if (wait()[0])
				upper = m;
			else
				lower = m;
		}
		int v = lower;
		if (v == N)
			v = u;
		return { u + 1, v + 1 };
	} else {
		return { -1, -1 };
	}
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75