oj.uz

Submission #115601

# Submission time Handle Problem Language Result Execution time Memory
115601 2019-06-08T09:21:57 Z faustaadp Crayfish scrivener (IOI12_scrivener) C++11
60 / 100
 1000 ms 81784 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[1000001];
int te,X;
int p[19][1000001],ii;
void Init() 
{
	//for(ii=1;ii<=1000002;ii++)
	//	LO[ii]=ceil(log(ii)/log(2));
}
void TypeLetter(char L) 
{
	if(te==0)
	{
		A[te]=mp(L,0);
		p[0][te]=0;
	}
	else
	{
		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]];
	te++;
//	cek();
}

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 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 4 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 3 ms 640 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 868 KB Output is correct
5 Correct 3 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 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 3 ms 972 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 59440 KB Output is correct
2 Correct 452 ms 72416 KB Output is correct
3 Correct 400 ms 72020 KB Output is correct
4 Correct 410 ms 75260 KB Output is correct
5 Correct 426 ms 66680 KB Output is correct
6 Correct 308 ms 78456 KB Output is correct
7 Correct 953 ms 67296 KB Output is correct
8 Correct 810 ms 75632 KB Output is correct
9 Correct 424 ms 72952 KB Output is correct
10 Correct 249 ms 81784 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 626 ms 54472 KB Output is correct
2 Correct 865 ms 47168 KB Output is correct
3 Correct 405 ms 59896 KB Output is correct
4 Correct 407 ms 52088 KB Output is correct
5 Correct 366 ms 69684 KB Output is correct
6 Correct 384 ms 72060 KB Output is correct
7 Correct 453 ms 71912 KB Output is correct
8 Execution timed out 1070 ms 59000 KB Time limit exceeded
9 Halted 0 ms 0 KB -