oj.uz

Submission #444751

# Submission time Handle Problem Language Result Execution time Memory
444751 2021-07-15T05:42:12 Z ics0503 Chameleon's Love (JOI20_chameleon) C++17
64 / 100
 48 ms 352 KB 
#include "chameleon.h"
#include <vector>
using namespace std;

int cck[1212];
void validation(int n, int i, int j) {
	vector<int>qr;
	for (int p = 1; p <= 2 * n; p++) {
		if (i == p || j == p)continue;
		qr.push_back(p);
	}
	int Q = Query(qr);
	if (Q != n) {
		cck[i] = cck[j] = 1;
		Answer(i, j);
	}
}

void S4(int who, vector<int>Y, int n) {
	int sz = Y.size(), i, j;
	if (sz == 1) {
		validation(n, who, Y[0]);
		return;
	}
	vector<int>L, R;
	for (i = 0; i < sz / 2; i++)L.push_back(Y[i]);
	for (i = sz / 2; i < sz; i++)R.push_back(Y[i]);
	L.push_back(who); R.push_back(who);
	int a = Query(L); int b = Query(R);
	L.pop_back(); R.pop_back();
	if (a != L.size() + 1)S4(who, L, n);
	if (b != R.size() + 1)S4(who, R, n);
}


vector<int>AX, AY;
int pk[1212];
void Solve(int n) {
	int i, j;
	while (1) {
		vector<int>X;
		for (i = 1; i <= 2 * n; i++)pk[i] = 0;
		int cnt = 0;
		for (i = 1; i <= 2 * n; i++) {
			if (cck[i])continue;
			cnt++;
			X.push_back(i);
			if (Query(X) != X.size()) {
				X.pop_back();
			}
			else {
				pk[i] = 1;
			}
		}
		if (cnt == 0)break;
		AX.clear();
		AY.clear();
		for (i = 1; i <= 2 * n; i++) {
			if (cck[i])continue;
			if (pk[i])AX.push_back(i);
			else AY.push_back(i);
		}
		for (i = 0; i < AX.size(); i++) {
			int who = AX[i];
			vector<int>Y;
			for (j = 0; j < AY.size(); j++) {
				int v = AY[j];
				if (cck[v])continue;
				Y.push_back(v);
			}
			S4(who, Y, n);
		}
	}
}

Compilation message

chameleon.cpp: In function 'void S4(int, std::vector<int>, int)':
chameleon.cpp:31:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  if (a != L.size() + 1)S4(who, L, n);
      |      ~~^~~~~~~~~~~~~~~
chameleon.cpp:32:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  if (b != R.size() + 1)S4(who, R, n);
      |      ~~^~~~~~~~~~~~~~~
chameleon.cpp:20:24: warning: unused variable 'j' [-Wunused-variable]
   20 |  int sz = Y.size(), i, j;
      |                        ^
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:48:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |    if (Query(X) != X.size()) {
      |        ~~~~~~~~~^~~~~~~~~~~
chameleon.cpp:63:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for (i = 0; i < AX.size(); i++) {
      |               ~~^~~~~~~~~~~
chameleon.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |    for (j = 0; j < AY.size(); j++) {
      |                ~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 25 ms 352 KB Output is correct
4 Correct 25 ms 328 KB Output is correct
5 Correct 25 ms 308 KB Output is correct
6 Correct 32 ms 328 KB Output is correct
7 Correct 25 ms 328 KB Output is correct
8 Correct 25 ms 328 KB Output is correct
9 Correct 25 ms 328 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 0 ms 200 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 1 ms 200 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 38 ms 340 KB Output is correct
4 Correct 39 ms 336 KB Output is correct
5 Correct 43 ms 336 KB Output is correct
6 Correct 39 ms 332 KB Output is correct
7 Correct 48 ms 328 KB Output is correct
8 Correct 39 ms 340 KB Output is correct
9 Correct 39 ms 328 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 25 ms 352 KB Output is correct
4 Correct 25 ms 328 KB Output is correct
5 Correct 25 ms 308 KB Output is correct
6 Correct 32 ms 328 KB Output is correct
7 Correct 25 ms 328 KB Output is correct
8 Correct 25 ms 328 KB Output is correct
9 Correct 25 ms 328 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 0 ms 200 KB Output is correct
14 Correct 0 ms 200 KB Output is correct
15 Correct 0 ms 200 KB Output is correct
16 Correct 0 ms 200 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 ms 200 KB Output is correct
29 Correct 0 ms 200 KB Output is correct
30 Correct 38 ms 340 KB Output is correct
31 Correct 39 ms 336 KB Output is correct
32 Correct 43 ms 336 KB Output is correct
33 Correct 39 ms 332 KB Output is correct
34 Correct 48 ms 328 KB Output is correct
35 Correct 39 ms 340 KB Output is correct
36 Correct 39 ms 328 KB Output is correct
37 Incorrect 39 ms 332 KB Wrong Answer [3]
38 Halted 0 ms 0 KB -