Submission #115572

# Submission time Handle Problem Language Result Execution time Memory
115572 2019-06-08T08:43:46 Z faustaadp Crayfish scrivener (IOI12_scrivener) C++17
0 / 100
915 ms 92208 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;
int p[20][1000001];
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,ii;
	if(te>0)
		bes=A[te-1].se+1;
	A[te]=mp(L,bes);
	hai[bes]=L;
	p[0][te]=te-1;
	for(ii=1;ii<20;ii++)
		p[ii][te]=p[ii-1][p[ii-1][te]];
	te++;
//	cek();
}

void UndoCommands(int U) 
{
	ll ii;
	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) 
{
	ll ii,X=te-1;
	for(ii=19;ii>=0;ii--)
		if(A[p[ii][X]].se>=P)
			X=p[ii][X];
	return char(A[X].fi);
//	return hai[P];
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Incorrect 2 ms 512 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 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 Incorrect 3 ms 896 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 455 ms 68676 KB Output is correct
2 Correct 476 ms 86824 KB Output is correct
3 Correct 368 ms 86800 KB Output is correct
4 Correct 462 ms 92208 KB Output is correct
5 Incorrect 641 ms 81004 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 915 ms 65556 KB Output isn't correct
2 Halted 0 ms 0 KB -