oj.uz

Submission #121256

# Submission time Handle Problem Language Result Execution time Memory
121256 2019-06-26T09:14:54 Z baluteshih Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 86780 KB 
#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[ti[t-1]]]+1,letter[t]=L;
	pa[0][t]=ti[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[ti[t-U-1]],Len[t]=Len[ti[ti[t-U-1]]];
}

char GetLetter(int P)
{
	int x=ti[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 896 KB Output is correct
6 Correct 3 ms 940 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 396 ms 62808 KB Output is correct
2 Correct 427 ms 76760 KB Output is correct
3 Correct 432 ms 76024 KB Output is correct
4 Correct 427 ms 79764 KB Output is correct
5 Correct 591 ms 70312 KB Output is correct
6 Correct 334 ms 83064 KB Output is correct
7 Correct 646 ms 71260 KB Output is correct
8 Correct 489 ms 80252 KB Output is correct
9 Correct 495 ms 77000 KB Output is correct
10 Correct 218 ms 86780 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 843 ms 57824 KB Output is correct
2 Execution timed out 1051 ms 46180 KB Time limit exceeded
3 Halted 0 ms 0 KB -