Submission #444258

# Submission time Handle Problem Language Result Execution time Memory
444258 2021-07-13T12:52:30 Z kig9981 Chameleon's Love (JOI20_chameleon) C++17
100 / 100
81 ms 504 KB
#include "chameleon.h"
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;
 
vector<int> adj[1001], V[2], Q, E[1001];
int P[1001];
bool chk[1001];
 
void dfs(int c, int v)
{
	V[v].push_back(c);
	chk[c]=true;
	for(auto n: adj[c]) if(!chk[n]) dfs(n,v^1);
}
 
void check(int v, int l, int r, int i)
{
	if(l>r || adj[i].size()==3) return;
	int s=l, e=r;
	while(s<=e) {
		int m=(s+e)>>1;
		Q.clear(); Q.push_back(i);
		for(int k=l;k<=m;k++) Q.push_back(V[v][k]);
		if(Query(Q)==Q.size()) s=m+1;
		else e=m-1;
	}
	if(s>r) return;
	adj[V[v][s]].push_back(i);
	adj[i].push_back(V[v][s]);
	check(v,s+1,r,i);
}
 
void Solve(int N)
{
	for(int i=1;i<=2*N;i++) {
		V[0].clear(); V[1].clear();
		for(int j=1;j<i;j++) chk[j]=false;
		for(int j=1;j<i;j++) if(!chk[j]) dfs(j,0);
		V[0].push_back(i);
		if(Query(V[0])^V[0].size()) check(0,0,V[0].size()-2,i);
		V[1].push_back(i);
		if(Query(V[1])^V[1].size()) check(1,0,V[1].size()-2,i);
	}
	memset(chk,0,sizeof(chk));
	for(int i=1;i<=2*N;i++) {
		if(adj[i].size()==1) {
			if(!chk[i]) Answer(i,adj[i][0]);
			chk[i]=chk[adj[i][0]]=true;
			continue;
		}
		for(int j=0;j<3;j++) {
			Q.clear(); Q.push_back(i);
			for(int k=0;k<3;k++) if(k^j) Q.push_back(adj[i][k]);
			if(Query(Q)==1) {
				E[i].push_back(adj[i][j]);
				E[adj[i][j]].push_back(i);
				break;
			}
		}
		
	}
	for(int i=1;i<=2*N;i++) if(!chk[i]) {
		for(auto a: adj[i]) {
			bool valid=true;
			for(auto b: E[i]) if(a==b) valid=false;
			if(valid) {
				Answer(i,a);
				chk[i]=chk[a]=true;
				break;
			}
		}
	}
}

Compilation message

chameleon.cpp: In function 'void check(int, int, int, int)':
chameleon.cpp:33:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   if(Query(Q)==Q.size()) s=m+1;
      |      ~~~~~~~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 46 ms 376 KB Output is correct
4 Correct 45 ms 376 KB Output is correct
5 Correct 45 ms 372 KB Output is correct
6 Correct 45 ms 380 KB Output is correct
7 Correct 45 ms 364 KB Output is correct
8 Correct 48 ms 376 KB Output is correct
9 Correct 50 ms 368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 64 ms 448 KB Output is correct
4 Correct 63 ms 396 KB Output is correct
5 Correct 73 ms 388 KB Output is correct
6 Correct 67 ms 504 KB Output is correct
7 Correct 63 ms 448 KB Output is correct
8 Correct 63 ms 368 KB Output is correct
9 Correct 63 ms 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 46 ms 376 KB Output is correct
4 Correct 45 ms 376 KB Output is correct
5 Correct 45 ms 372 KB Output is correct
6 Correct 45 ms 380 KB Output is correct
7 Correct 45 ms 364 KB Output is correct
8 Correct 48 ms 376 KB Output is correct
9 Correct 50 ms 368 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 0 ms 328 KB Output is correct
29 Correct 0 ms 328 KB Output is correct
30 Correct 64 ms 448 KB Output is correct
31 Correct 63 ms 396 KB Output is correct
32 Correct 73 ms 388 KB Output is correct
33 Correct 67 ms 504 KB Output is correct
34 Correct 63 ms 448 KB Output is correct
35 Correct 63 ms 368 KB Output is correct
36 Correct 63 ms 380 KB Output is correct
37 Correct 81 ms 420 KB Output is correct
38 Correct 45 ms 376 KB Output is correct
39 Correct 79 ms 364 KB Output is correct
40 Correct 75 ms 448 KB Output is correct
41 Correct 76 ms 364 KB Output is correct
42 Correct 45 ms 328 KB Output is correct
43 Correct 73 ms 376 KB Output is correct
44 Correct 75 ms 368 KB Output is correct
45 Correct 74 ms 448 KB Output is correct