oj.uz

Submission #115590

# Submission time Handle Problem Language Result Execution time Memory
115590 2019-06-08T09:14:23 Z faustaadp Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 1000 ms 82040 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[22][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<20;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<20;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)
		{
			if(A[p[ii][X]].se==P)
			{
				X=p[ii][X];
				break;
			}
			X=p[ii][X];
		}
	return A[X].fi;
//	return hai[P];
}

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 3 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 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 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 896 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 62216 KB Output is correct
2 Correct 453 ms 75740 KB Output is correct
3 Correct 372 ms 75180 KB Output is correct
4 Correct 424 ms 78764 KB Output is correct
5 Correct 459 ms 69656 KB Output is correct
6 Correct 327 ms 82040 KB Output is correct
7 Execution timed out 1002 ms 70400 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 57132 KB Output is correct
2 Correct 828 ms 49400 KB Output is correct
3 Correct 391 ms 62728 KB Output is correct
4 Correct 415 ms 54440 KB Output is correct
5 Correct 366 ms 72992 KB Output is correct
6 Correct 394 ms 75396 KB Output is correct
7 Correct 392 ms 75388 KB Output is correct
8 Execution timed out 1080 ms 60520 KB Time limit exceeded
9 Halted 0 ms 0 KB -