Submission #121299

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
121299	2019-06-26T09:56:31 Z	baluteshih	Crayfish scrivener (IOI12_scrivener)	C++14	60 / 100	1000 ms	86992 KB

scrivener

#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i,j) memset(i,j,sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
char letter[1000005];
int Len[1000005],pa[20][1000005],ti[1000005],lg=19,t;
 
void Init(){
	t=0,Len[0]=-1;
}
 
void TypeLetter(char L) 
{
	++t,ti[t]=t,Len[t]=Len[ti[t-1]]+1,letter[t]=L;
	pa[0][t]=ti[t-1];
	for(int i=1;i<=lg;++i)
		pa[i][t]=pa[i-1][pa[i-1][t]];
}
 
void UndoCommands(int U)
{
	++t,ti[t]=ti[t-U-1],Len[t]=Len[t-U-1];
}
 
char GetLetter(int P)
{
	int x=ti[t];
	for(int i=__lg(t);i>=0;--i)
		if(Len[pa[i][x]]>=P)
			x=pa[i][x];
	if(Len[pa[0][x]]>=P)
		x=pa[0][x];
	return letter[x];
}

Subtask #1

5.0 / 5.0

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

Subtask #2

7.0 / 7.0

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

Subtask #3

22.0 / 22.0

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

Subtask #4

26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	415 ms	62964 KB	Output is correct
2	Correct	412 ms	76968 KB	Output is correct
3	Correct	361 ms	76236 KB	Output is correct
4	Correct	376 ms	79932 KB	Output is correct
5	Correct	611 ms	70812 KB	Output is correct
6	Correct	361 ms	83320 KB	Output is correct
7	Correct	630 ms	71436 KB	Output is correct
8	Correct	477 ms	80368 KB	Output is correct
9	Correct	466 ms	77448 KB	Output is correct
10	Correct	218 ms	86992 KB	Output is correct

Subtask #5

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	795 ms	57720 KB	Output is correct
2	Correct	941 ms	50632 KB	Output is correct
3	Correct	514 ms	68808 KB	Output is correct
4	Correct	668 ms	61504 KB	Output is correct
5	Correct	414 ms	78328 KB	Output is correct
6	Correct	463 ms	80692 KB	Output is correct
7	Correct	461 ms	80632 KB	Output is correct
8	Execution timed out	1085 ms	69536 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-