oj.uz

Submission #115606

# Submission time Handle Problem Language Result Execution time Memory
115606 2019-06-08T09:31:29 Z faustaadp Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 766 ms 84924 KB 
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
pair<char,int> A[1000002];
int te=1,X;
int p[19][1000002],ii;
void Init() 
{
	A[0].se=-1;
	//for(ii=1;ii<=1000002;ii++)
	//	LO[ii]=ceil(log(ii)/log(2));
}
void TypeLetter(char L) 
{
	A[te]=mp(L,A[te-1].se+1);
	p[0][te]=te-1;
	for(ii=1;ii<19;ii++)
		p[ii][te]=p[ii-1][p[ii-1][te]];
	te++;
}

void UndoCommands(int U) 
{
	A[te]=A[te-U-1];
	// p[0][te]=p[0][te-U-1];
	// for(ii=1;ii<19;ii++)
	// 	p[ii][te]=p[ii-1][p[ii-1][te]];
	for(ii=0;ii<19;ii++)
		p[ii][te]=p[ii][te-U-1];
	te++;
}

char GetLetter(int P) 
{
	X=te-1;
	for(ii=18;ii>=0;ii--)
		if(A[p[ii][X]].se>P)
			X=p[ii][X];
		else
		if(A[p[ii][X]].se==P)
			return A[p[ii][X]].fi;
	return A[X].fi;
}

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 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 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 4 ms 768 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 4 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 59420 KB Output is correct
2 Correct 372 ms 72312 KB Output is correct
3 Correct 399 ms 71812 KB Output is correct
4 Correct 468 ms 75256 KB Output is correct
5 Correct 448 ms 66536 KB Output is correct
6 Correct 312 ms 78396 KB Output is correct
7 Correct 567 ms 67104 KB Output is correct
8 Correct 456 ms 75772 KB Output is correct
9 Correct 418 ms 72672 KB Output is correct
10 Correct 223 ms 81784 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 603 ms 54500 KB Output is correct
2 Correct 729 ms 47196 KB Output is correct
3 Correct 427 ms 59960 KB Output is correct
4 Correct 518 ms 51956 KB Output is correct
5 Correct 356 ms 69644 KB Output is correct
6 Correct 399 ms 72056 KB Output is correct
7 Correct 389 ms 71876 KB Output is correct
8 Correct 766 ms 60692 KB Output is correct
9 Correct 725 ms 63736 KB Output is correct
10 Correct 216 ms 84924 KB Output is correct