| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 928848 | pan | Painting Squares (IOI20_squares) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#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 R= -1;
unordered_map<ll, ll> tc;
ll minlen;
unordered_set<string> visited;
vector<ll> seq;
vector<ll> hashing(5005);
vector<vector<ll> > savehashing(1005);
void dfs(string node)
{
string nxt[2] = {node+"0", node+"1"};
for (ll i=0; i<2; ++i)
{
if (visited.find(nxt[i])==visited.end())
{
visited.insert(nxt[i]);
dfs(nxt[i].substr(1));
seq.pb(i);
}
}
}
void init(ll n)
{
minlen = 1;
for (;minlen<=10; ++minlen) if ((1LL<<minlen) >=n) break;
visited.clear();
hashing.assign(5005, 0);
seq.clear();
seq.resize(0);
dfs(string(minlen-1, '0'));
for (ll i=0; i<=n-minlen; ++i)
{
ll val = 0;
for (ll j=0; j<minlen; ++j)
{
val+=seq[i+minlen-j-1]*(1LL<<j);
}
hashing[val] = i;
//show2(i, val);
}
savehashing[n] = hashing;
}
std::vector<int> paint(int n)
{
init(n);
vector<int> ret(n+1);
for (ll i=0; i<n; ++i) {ret[i] = seq[i];}
ret[n] = minlen;
return ret;
}
int find_location(int n, std::vector<int> c)
{
init();
minlen = c.size();
ll i = 0;
while (minlen-1-i>=0 && c[minlen-1-i]==-1) i++;
if (i) return n-minlen+i;
vector<ll>& hashing = savehashing[n];
ll val = 0;
for (ll i=0; i<minlen; ++i)
{
val+= ll( c[minlen-1-i]) * (1LL<<i);
}
return hashing[val];
}