답안 #115589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115589	2019-06-08T09:13:36 Z	faustaadp	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++17	34 / 100	1000 ms	82140 KB

scrivener

#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=19;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

#	결과	실행 시간	메모리	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	3 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	3 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	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

#	결과	실행 시간	메모리	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	896 KB	Output is correct
6	Correct	3 ms	896 KB	Output is correct
7	Correct	3 ms	896 KB	Output is correct
8	Correct	4 ms	888 KB	Output is correct
9	Correct	4 ms	896 KB	Output is correct
10	Correct	3 ms	896 KB	Output is correct

Subtask #4

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	391 ms	62132 KB	Output is correct
2	Correct	459 ms	75732 KB	Output is correct
3	Correct	371 ms	75256 KB	Output is correct
4	Correct	413 ms	78828 KB	Output is correct
5	Correct	452 ms	69752 KB	Output is correct
6	Correct	314 ms	82140 KB	Output is correct
7	Execution timed out	1036 ms	70304 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	666 ms	57052 KB	Output is correct
2	Correct	794 ms	49332 KB	Output is correct
3	Correct	410 ms	62780 KB	Output is correct
4	Correct	427 ms	54480 KB	Output is correct
5	Correct	369 ms	72900 KB	Output is correct
6	Correct	412 ms	75480 KB	Output is correct
7	Correct	398 ms	75512 KB	Output is correct
8	Execution timed out	1071 ms	57708 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-