oj.uz

Submission #1051001

# Submission time Handle Problem Language Result Execution time Memory
1051001 2024-08-09T17:56:10 Z rainboy How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) C++17
15 / 100
 418 ms 263068 KB 
#include "avoid.h"
#include <vector>

using namespace std;

const int N = 1000, LN = 10, L = 26;

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

int count(int b) {
	return b == 0 ? 0 : count(b & b - 1) + 1;
}

pi scout(int q, int b) {
	if (q == 10) {
		for (int l = 0; l < LN; 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 < LN; 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 i_ = 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 != i_)
					ii.push_back(i + 1);
			if (ii.size() == 0) {
				lower = m;
				continue;
			}
			send(ii);
			if (wait()[0])
				upper = m;
			else
				lower = m;
		}
		int j_ = lower;
		if (j_ == N)
			j_ = i_;
		return { i_ + 1, j_ + 1 };
	} else {
		vi bb(N), ij(1 << L, -1);
		for (int j = 0, b = 0; j < N; j++) {
			bool good = false;
			while (b < 1 << L) {
				bb[j] = b++;
				if (count(bb[j]) != L / 3)
					continue;
				good = true;
				for (int i = 0; i <= j; i++)
					if (ij[bb[j] | bb[i]] != -1) {
						good = 0;
						break;
					}
				if (good) {
					for (int i = 0; i <= j; i++)
						ij[bb[j] | bb[i]] = i * N + j;
					break;
				}
			}
			if (!good)
				return { -1, -1 };
		}
		for (int l = 0; l < L; l++) {
			vi ii;
			for (int i = 0; i < N; i++)
				if ((bb[i] >> l & 1) != 0)
					ii.push_back(i + 1);
			send(ii);
		}
		vi cc = wait();
		int b = 0;
		for (int l = 0; l < LN; l++)
			if (cc[l])
				b |= 1 << l;
		int i = ij[b] / N, j = ij[b] % N;
		return { i + 1, j + 1 };
	}
}

Compilation message

avoid.cpp: In function 'int count(int)':
avoid.cpp:12:34: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   12 |  return b == 0 ? 0 : count(b & b - 1) + 1;
      |                                ~~^~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 397 ms 262992 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
2 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
3 Correct 1 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
4 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
5 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
6 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
7 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
8 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
9 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
10 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
2 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
3 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
4 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
5 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
6 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
7 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
8 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
9 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
10 Correct 1 ms 596 KB Correct: 20 robot(s) used, 20 hour(s) passed
11 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
12 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
13 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
14 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
15 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
16 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
17 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
18 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
19 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
20 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
21 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
22 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
23 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
24 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
25 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
26 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
27 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
28 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
29 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
30 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
31 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
32 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
33 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
34 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
35 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
36 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
37 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
38 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
39 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
40 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
41 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
42 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
43 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
44 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
45 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
46 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
47 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
48 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
49 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
50 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
51 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
52 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
53 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
54 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
55 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 418 ms 262896 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 383 ms 263068 KB Not correct
2 Halted 0 ms 0 KB -