Submission #382355

#	Time	Username	Problem	Language	Result	Execution time	Memory
382355		alishahali1382	Crayfish scrivener (IOI12_scrivener)	C++14	34 / 100	856 ms	75756 KiB

scrivener

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=1000010, LOG=19;

int n, m, k, u, v, x, y, t, a, b, ans;
int par[LOG][MAXN], sz[MAXN];
char last[MAXN];

void Init(){
	
}
void TypeLetter(char ch){
	par[0][n+1]=n;
	sz[n+1]=sz[n]+1;
	last[n+1]=ch;
	n++;
	for (int i=1; i<LOG; i++) par[i][n]=par[i-1][par[i-1][n]];
}
void UndoCommands(int ted){
	par[0][n+1]=n-ted;
	n++;
	sz[n]=sz[par[0][n]];
	for (int i=1; i<LOG; i++) par[i][n]=par[i-1][par[i-1][n]];	
}
char GetLetter(int pos){
	int v=n;
	for (int i=LOG-1; ~i; i--) if (sz[par[i][v]]>pos) v=par[i][v];
	return last[v];
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 22 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40