제출 #1239894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239894		amine_aroua	스핑크스 (IOI24_sphinx)	C++20	0 / 100	0 ms	420 KiB

sphinx

#include "sphinx.h"
#include<bits/stdc++.h>
using namespace std;
int n;
std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) 
{
	n = N;	
	vector<int> C(n);
	vector<vector<int>> grp;
	grp.push_back({0});
	for(int i = 1 ; i < n ; i++)
	{
		int lo = -1 , hi = (int)grp.size();
		while(lo + 1 < hi)
		{
			int md = (lo + hi)/2;
			vector<int> v(n , n);
			for(int j = 0 ; j <= md ; j++)
			{
				for(auto x : grp[j])
					v[x] = -1;
			}
			v[i] = -1;
			// cout<<"md : "<<md<<'\n';
			// for(int j = 0 ; j < n ; j++)
			// 	cout<<v[j]<<" ";
			// cout<<'\n';
			// cout<<perform_experiment(v)<<'\n';
			int nb = perform_experiment(v) - (find(v.begin() , v.end() , n) != v.end());
			cout<<nb<<'\n';
			if(nb == md+1)
			{
				hi = md;
			}
			else
				lo = md;
		}
		// cout<<"hi : "<<hi<<'\n';
		if(hi == (int)grp.size())
		{
			C[i] = (int)grp.size();
			grp.push_back({i});
		}
		else
		{
			C[i] = hi;
			grp[hi].push_back(i);
		}
	}
	return C;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 3
• Subtask 2: 0 / 7
• Subtask 3: 0 / 33
• Subtask 4: 0 / 21
• Subtask 5: 0 / 36