제출 #928798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928798		pan	Painting Squares (IOI20_squares)	C++17	0 / 100	46 ms	1860 KiB

squares

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define auto set<pi>:: iterator 
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll minlen;
ll counter = -1;
ll length[15];
unordered_map<ll, ll> where;
unordered_set<string> visited[15];
vector<ll> seq[15];
unordered_map<ll, ll> hashing[15];
void dfs(string node, unordered_set<string>& nowvisited, vector<ll>& nowseq)
{
	string nxt[2] = {node+"0",  node+"1"};
	for (ll i=0; i<2; ++i)
	{
		if (nowvisited.find(nxt[i])==nowvisited.end())
		{
			nowvisited.insert(nxt[i]);
			dfs(nxt[i].substr(1), nowvisited, nowseq);
			nowseq.pb(i);
		}
	}
	
}
std::vector<int> paint(int n)
{
	where[n] = ++counter;
	minlen = 1;
	for (;minlen<=10; ++minlen) if ((1LL<<minlen) >=n) break;
	length[counter] = minlen;
	vector<int> ret(n+1);
	dfs(string(minlen-1, '0'), visited[counter], seq[counter]);
	for (ll i=0; i<n; ++i) {ret[i] = seq[counter][i];}
	ret[n] = minlen;
	for (ll i=0; i<=n-minlen; ++i)
	{
		ll val = 0;
		for (ll j=0; j<minlen; ++j)
		{
			val+=seq[counter][i+minlen-j-1]*(1LL<<j);
		}
		assert(hashing[counter].find(val)==hashing[counter].end());
		hashing[counter][val] = i;
		//show2(i, val);
		
	}

	return ret;

}
int find_location(int n, std::vector<int> c)
{
	ll which = where[n];
	ll minlen = length[which];
	ll i = 0;
	while (c[minlen-1-i]==-1) i++;
	if (i) return n-minlen+i;
	ll val = 0;
	for (ll i=0; i<minlen; ++i)
	{
		val+=c[minlen-1-i] * (1LL<<i);
	}
	return hashing[which][val];
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55