Submission #62559

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
62559	2018-07-29T06:00:47 Z	zetapi	Crayfish scrivener (IOI12_scrivener)	C++14	34 / 100	1000 ms	68840 KB

scrivener

#include <bits/stdc++.h>
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e6+9;

vector<char> X;
int ind,tot,arr[MAX],height[MAX],Parent[MAX][22];

void Init() 
{

}

void TypeLetter(char L) 
{
	X.pb(L);
	Parent[++ind][0]=arr[tot++];
	height[ind]=height[Parent[ind][0]]+1;
	for(int A=1;A<21;A++)
		Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
	arr[tot]=ind;
	return ;
}

void UndoCommands(int U) 
{
	++tot;
	arr[tot]=arr[tot-U-1];
	return ;
}

char GetLetter(int P) 
{
	P++;
	int res=arr[tot];
	for(int A=20;A>=0;A--)
	{
		if(height[Parent[res][A]]>=P)
			res=Parent[res][A];
	}
	//cout<<cur<<" "<<res<<" "<<height[res]<<"\n";
	return X[res-1];
}

/*signed main()
{
	ios_base::sync_with_stdio(false);

	
	TypeLetter('a');
	TypeLetter('b');
	TypeLetter('d');
	UndoCommands(2);
	UndoCommands(1);
	cout<<GetLetter(2);
	return 0;
}*/

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	3 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	3 ms	484 KB	Output is correct
6	Correct	2 ms	636 KB	Output is correct
7	Correct	2 ms	636 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	2 ms	636 KB	Output is correct

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	636 KB	Output is correct
2	Correct	3 ms	636 KB	Output is correct
3	Correct	3 ms	636 KB	Output is correct
4	Correct	3 ms	636 KB	Output is correct
5	Correct	3 ms	636 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	2 ms	636 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	4 ms	636 KB	Output is correct
10	Correct	3 ms	696 KB	Output is correct

Subtask #3

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	716 KB	Output is correct
2	Correct	4 ms	716 KB	Output is correct
3	Correct	4 ms	716 KB	Output is correct
4	Correct	4 ms	844 KB	Output is correct
5	Correct	6 ms	844 KB	Output is correct
6	Correct	6 ms	844 KB	Output is correct
7	Correct	4 ms	848 KB	Output is correct
8	Correct	4 ms	848 KB	Output is correct
9	Correct	5 ms	848 KB	Output is correct
10	Correct	4 ms	848 KB	Output is correct

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	884 ms	56476 KB	Output is correct
2	Correct	914 ms	62232 KB	Output is correct
3	Correct	540 ms	62232 KB	Output is correct
4	Correct	545 ms	62232 KB	Output is correct
5	Correct	924 ms	62232 KB	Output is correct
6	Correct	548 ms	67432 KB	Output is correct
7	Correct	705 ms	67432 KB	Output is correct
8	Correct	715 ms	67432 KB	Output is correct
9	Execution timed out	1063 ms	68840 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1085 ms	68840 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-