Submission #133798

#	Time	Username	Problem	Language	Result	Execution time	Memory
133798		claudy	Crayfish scrivener (IOI12_scrivener)	C++14	12 / 100	445 ms	109716 KiB

scrivener

//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//# pragma GCC optimize("Ofast")
//# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;

char val[1 << 20];
int p[1 << 20][20];
vector<int>vec;
int curr,k;
int dep[1 << 20];
int nxt[1 << 20][26];

void Init()
{
	vec.pb(0);
}

void TypeLetter(char L)
{
	int x;
	if(!nxt[curr][L - 'a']) x = ++k;
	else x = nxt[curr][L - 'a'];
	nxt[curr][L - 'a'] = x;
	dep[x] = dep[curr] + 1;
	val[x] = L;
	vec.pb(x);
	p[x][0] = curr;
	for(int i = 1;i <= 20;i++)
	{
		p[x][i] = p[p[x][i - 1]][i - 1];
	}
	curr = x;
}

void UndoCommands(int U)
{
	curr = vec[sz(vec) - U - 1];
	vec.pb(curr);
}

char GetLetter(int P)
{
	int y = dep[curr] - P - 1;
	int x = curr;
	for(int i = 0;i <= 20;i++)
	{
		if(y & (1 << i))
		{
			x = p[x][i];
		}
	}
	return val[x];
}

Compilation message (stderr)

scrivener.cpp: In function 'void TypeLetter(char)':
scrivener.cpp:49:11: warning: iteration 19 invokes undefined behavior [-Waggressive-loop-optimizations]
   p[x][i] = p[p[x][i - 1]][i - 1];
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
scrivener.cpp:47:18: note: within this loop
  for(int i = 1;i <= 20;i++)
                ~~^~~~~

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