oj.uz

Submission #444797

# Submission time Handle Problem Language Result Execution time Memory
444797 2021-07-15T10:39:05 Z ics0503 Chameleon's Love (JOI20_chameleon) C++17
100 / 100
 49 ms 360 KB 
#include "chameleon.h"
#include <vector>
#include<algorithm>
using namespace std;

int cck[1212];
int 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);
		return 1;
	}
	return 0;
}

int S4(int who, vector<int>Y, int n) {
	int sz = Y.size(), i, j;
	if (sz == 1) {
		return validation(n, who, Y[0]);
	}
	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); int a = Query(L); L.pop_back(); 
	if (a != L.size() + 1) if (S4(who, L, n))return 1;
	R.push_back(who); int b = Query(R); R.pop_back();
	if (b != R.size() + 1) if (S4(who, R, n))return 1;
	return 0;
}


vector<int>AX, AY;
int pk[1212];
void Solve(int n) {
	int i, j;
	int qq = 0;
	while (1) {
		vector<int>X;
		qq++;
		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;
		X.clear();
		for (i = 1; i <= 2 * n; i++) {
			if (cck[i])continue; cnt++;
			if (pk[i] == 1)continue;
			X.push_back(i);
			if (Query(X) != X.size()) X.pop_back();
			else pk[i] = 2;
		}
		AX.clear(); AY.clear();
		for (i = 1; i <= 2 * n; i++) {
			if (cck[i])continue;
			if (pk[i] == 2)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 'int 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) if (S4(who, L, n))return 1;
      |      ~~^~~~~~~~~~~~~~~
chameleon.cpp:33:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  if (b != R.size() + 1) if (S4(who, R, n))return 1;
      |      ~~^~~~~~~~~~~~~~~
chameleon.cpp:23:24: warning: unused variable 'j' [-Wunused-variable]
   23 |  int sz = Y.size(), i, j;
      |                        ^
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:49:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   49 |    if (cck[i])continue; cnt++;
      |    ^~
chameleon.cpp:49:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   49 |    if (cck[i])continue; cnt++;
      |                         ^~~
chameleon.cpp:51:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    if (Query(X) != X.size()) X.pop_back();
      |        ~~~~~~~~~^~~~~~~~~~~
chameleon.cpp:57:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   57 |    if (cck[i])continue; cnt++;
      |    ^~
chameleon.cpp:57:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   57 |    if (cck[i])continue; cnt++;
      |                         ^~~
chameleon.cpp:60:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |    if (Query(X) != X.size()) X.pop_back();
      |        ~~~~~~~~~^~~~~~~~~~~
chameleon.cpp:69:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for (i = 0; i < AX.size(); i++) {
      |               ~~^~~~~~~~~~~
chameleon.cpp:72:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    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 24 ms 332 KB Output is correct
4 Correct 23 ms 340 KB Output is correct
5 Correct 23 ms 348 KB Output is correct
6 Correct 24 ms 328 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 25 ms 308 KB Output is correct
9 Correct 24 ms 328 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 200 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 34 ms 328 KB Output is correct
4 Correct 31 ms 328 KB Output is correct
5 Correct 30 ms 328 KB Output is correct
6 Correct 30 ms 328 KB Output is correct
7 Correct 30 ms 340 KB Output is correct
8 Correct 31 ms 328 KB Output is correct
9 Correct 32 ms 324 KB Output is correct

Subtask #5
36.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 24 ms 332 KB Output is correct
4 Correct 23 ms 340 KB Output is correct
5 Correct 23 ms 348 KB Output is correct
6 Correct 24 ms 328 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 25 ms 308 KB Output is correct
9 Correct 24 ms 328 KB Output is correct
10 Correct 1 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 1 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 34 ms 328 KB Output is correct
31 Correct 31 ms 328 KB Output is correct
32 Correct 30 ms 328 KB Output is correct
33 Correct 30 ms 328 KB Output is correct
34 Correct 30 ms 340 KB Output is correct
35 Correct 31 ms 328 KB Output is correct
36 Correct 32 ms 324 KB Output is correct
37 Correct 38 ms 344 KB Output is correct
38 Correct 27 ms 328 KB Output is correct
39 Correct 42 ms 332 KB Output is correct
40 Correct 41 ms 344 KB Output is correct
41 Correct 49 ms 336 KB Output is correct
42 Correct 23 ms 328 KB Output is correct
43 Correct 30 ms 328 KB Output is correct
44 Correct 41 ms 340 KB Output is correct
45 Correct 44 ms 360 KB Output is correct