Submission #712028

#	Time	Username	Problem	Language	Result	Execution time	Memory
712028		LittleCube	Chameleon's Love (JOI20_chameleon)	C++14	44 / 100	33 ms	468 KiB

chameleon

#include "chameleon.h"
#include <vector>
using namespace std;


vector<int> A, B, E[1005];
int color[1005];
vector<int> adj;

void find(int u, vector<int> v)
{
	if(v.empty())
		return;
	v.emplace_back(u);
   	if(Query(v) == v.size())
		return;
	v.pop_back();
	if(v.size() == 1)
		adj.emplace_back(v[0]);
	else
	{
		int mid = v.size() / 2;
		vector<int> l(v.begin(), v.begin() + mid), r(v.begin() + mid, v.end());
		find(u, l);
		find(u, r);
	}
}

void dfs(int u)
{
	for (auto v : E[u])
		if(!color[v])
		{
			color[v] = 3 ^ color[u];
			dfs(v);
		}
}

void Solve(int N)
{
	for (int i = 1; i <= 2 * N; i++)
	{
		for (int j = 1; j < i; j++)
			color[j] = 0;
		for (int j = 1; j < i; j++)
			if(!color[j])
			{
				color[j] = 1;
				dfs(j);
			}
		A.clear(), B.clear();
		for (int j = 1; j < i; j++)
			(color[j] == 1 ? A : B).emplace_back(j);
		adj.clear();
		find(i, A);
		find(i, B);
		for (int j : adj)
		{
			E[i].emplace_back(j);
			E[j].emplace_back(i);
		}
	}
	for (int i = 1; i <= 2 * N; i++)
		if(E[i].size() >= 3)
		{
			int a = E[i][0], b = E[i][1], c = E[i][2];
			int x = Query(vector<int>{i, a, b}),
				y = Query(vector<int>{i, b, c}),
				z = Query(vector<int>{i, c, a});
			if(x == 2 && y == 2)
				E[i].emplace_back(-b), E[b].emplace_back(-i);
			if(y == 2 && z == 2)
				E[i].emplace_back(-c), E[c].emplace_back(-i);
			if(z == 2 && x == 2)	
				E[i].emplace_back(-a), E[a].emplace_back(-i);
		}	
	for (int i = 1; i <= 2 * N; i++)
	{
		int sum = 0;
		for(auto j : E[i])
			sum += j;
		if(i < sum)
			Answer(i, sum);
	}

}

Compilation message (stderr)

chameleon.cpp: In function 'void find(int, std::vector<int>)':
chameleon.cpp:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     if(Query(v) == v.size())
      |        ~~~~~~~~~^~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36