oj.uz

답안 #115575

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115575 2019-06-08T08:50:10 Z faustaadp 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
34 / 100
 939 ms 85880 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];
int LO[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() 
{
	ll ii;
	for(ii=1;ii<=1000000;ii++)
		LO[ii]=ceil(log(ii)/log(2));
//	for(ii=0;ii<10;ii++)
//		cout<<ii<<" "<<LO[ii]<<"\n";
}
void TypeLetter(char L) 
{
	ll bes=0,ii;
	if(te>0)
		bes=A[te-1].se+1;
	A[te]=mp(L,bes);
	if(te==0)
		p[0][te]=0;
	else
		p[0][te]=te-1;
	for(ii=1;ii<LO[te];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<LO[te+1];ii++)
		p[ii][te]=p[ii-1][p[ii-1][te]];
	te++;
//	cek();
}

char GetLetter(int P) 
{
	ll ii,X=te-1;
	for(ii=LO[te+1];ii>=0;ii--)
		if(A[p[ii][X]].se>=P)
			X=p[ii][X];
	return char(A[X].fi);
//	return hai[P];
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 4224 KB Output is correct
2 Correct 31 ms 4256 KB Output is correct
3 Correct 31 ms 4352 KB Output is correct
4 Correct 31 ms 4344 KB Output is correct
5 Correct 31 ms 4328 KB Output is correct
6 Correct 32 ms 4472 KB Output is correct
7 Correct 35 ms 4344 KB Output is correct
8 Correct 33 ms 4340 KB Output is correct
9 Correct 31 ms 4344 KB Output is correct
10 Correct 31 ms 4344 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 4344 KB Output is correct
2 Correct 32 ms 4320 KB Output is correct
3 Correct 31 ms 4344 KB Output is correct
4 Correct 31 ms 4224 KB Output is correct
5 Correct 31 ms 4352 KB Output is correct
6 Correct 29 ms 4344 KB Output is correct
7 Correct 31 ms 4344 KB Output is correct
8 Correct 31 ms 4352 KB Output is correct
9 Correct 30 ms 4344 KB Output is correct
10 Correct 31 ms 4344 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 4472 KB Output is correct
2 Correct 32 ms 4472 KB Output is correct
3 Correct 76 ms 4600 KB Output is correct
4 Correct 31 ms 4572 KB Output is correct
5 Correct 32 ms 4608 KB Output is correct
6 Correct 31 ms 4600 KB Output is correct
7 Correct 31 ms 4600 KB Output is correct
8 Correct 33 ms 4608 KB Output is correct
9 Correct 32 ms 4600 KB Output is correct
10 Correct 32 ms 4600 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 518 ms 67628 KB Output is correct
2 Correct 509 ms 82424 KB Output is correct
3 Correct 411 ms 81796 KB Output is correct
4 Incorrect 463 ms 85880 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 939 ms 62120 KB Output isn't correct
2 Halted 0 ms 0 KB -