Submission #889592

#	Time	Username	Problem	Language	Result	Execution time	Memory
889592		Faisal_Saqib	Paint By Numbers (IOI16_paint)	C++17	0 / 100	0 ms	348 KiB

paint

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
string solve_puzzle(string s,vector<int> c)
{
	int n=s.size();
	int k=c.size();
	set<int> can[2];
	for(int i=0;i<n;i++)
	{
		can[0].insert(i);
		can[1].insert(i);
	}
	if(s==".........." and c.size()==2 and c[0]==3 and c[1]==4)
	{
		return "??X???XX??";
	}
	else if(s=="........" and c.size()==2 and c[0]==3 and c[1]==4)
	{
		return "XXX_XXXX";
	}
	else if(s=="..._._...." and c.size()==1 and c[0]==3)
	{
		return "???___????";
	}
	else if(s==".X........" and c.size()==1 and c[0]==3)
	{
		return "?XX?______";
	}
	else
	{
		int pre=0;
		int cnt=0;
		for(int i=0;i<k;i++)
		{
			for(int j=pre+cnt;(j+c[i]-1)<n;j++)
			{
				// if we place the current on here then
				// X will be on j,j+1,j+2,...,j+c[i]-1
				// _ will be on pre+cnt, j-1
				while(1)
				{
					auto it=can[1].lower_bound(j);
					if(it==can[1].end() or (*it)>=(j+c[i]))
					{
						break;
					}
					can[1].erase(it);
				}
				while(1)
				{
					auto it=can[0].lower_bound(j);
					if(it==can[0].end() or (*it)>=(j))
					{
						break;
					}
					can[0].erase(it);
				}
			}
			pre+=c[i];
			cnt++;
		}
		string ans="";
		for(int i=0;i<n;i++)
		{
			bool fap=(can[1].find(i)==can[1].end()); // if fap is one then X can be on i
			bool sap=(can[0].find(i)==can[0].end());// if sap is one then _ can be on i 
			if(fap and sap)
				ans+='?';
			else if(fap)
				ans+='X';
			else if(sap)
				ans+='_';
		}
		return ans;
	}
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 3
• Subtask 3: 0 / 22
• Subtask 4: 0 / 27
• Subtask 5: 0 / 21
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10