oj.uz

Submission #115571

# Submission time Handle Problem Language Result Execution time Memory
115571 2019-06-08T08:38:44 Z faustaadp Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 1000 ms 17620 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;
char last;

char hai[1010101];
pair<ll,ll> A[1010101];
ll te,pre[1010101];
void cek()
{
	ll ii;
	for(ii=0;ii<te;ii++)
		cout<<ii<<" "<<char(A[ii].fi)<<" "<<A[ii].se<<"\n";
	cout<<"\n";
}
void Init() {}
void TypeLetter(char L) 
{
	ll bes=0;
	if(te>0)
		bes=A[te-1].se+1;
	A[te]=mp(L,bes);
	hai[bes]=L;
	pre[te]=te-1;
	te++;
//	cek();
}

void UndoCommands(int U) 
{
	A[te]=A[te-U-1];
	pre[te]=pre[te-U-1];
	te++;
//	cek();
}

char GetLetter(int P) 
{
	ll ii;
	for(ii=te-1;;ii=pre[ii])
		if(A[ii].se==P)
			return char(A[ii].fi);
//	return hai[P];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 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 6 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 17620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 4192 KB Time limit exceeded
2 Halted 0 ms 0 KB -