답안 #104264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104264	2019-04-04T14:13:25 Z	arman_ferdous	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++17	100 / 100	723 ms	86092 KB

scrivener

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
using namespace std;

const int N = 1e6+10;
char c[N];
int lev[N];
int cur, freePtr;
int p[20][N], state[N], ptr;

void Init() {
	lev[0] = -1;
	memset(p,-1,sizeof p);
	c[0] = '?';
	cur = 0; freePtr = 1;
	state[0] = cur; ptr = 0;
}

void TypeLetter(char L) {
	int idx = freePtr++;
	p[0][idx] = cur;
	c[idx] = L, lev[idx] = lev[cur] + 1;
	cur = idx;

	for(int j = 1; j < 20; ++j)
		if(p[j-1][cur] + 1)
			p[j][cur] = p[j-1][p[j-1][cur]];
	state[++ptr] = cur;
}

void UndoCommands(int U) {
	state[ptr+1] = state[max(0, ptr - U)];
	ptr++;
	cur = state[ptr];
}

char GetLetter(int P) {
	int tmp = cur, need = lev[cur] - P;
	for(int j = 19; j >= 0; --j)
		if(need >= (1<<j)) {
			need -= (1<<j);
			tmp = p[j][tmp];
		}
	return c[tmp];
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	78624 KB	Output is correct
2	Correct	68 ms	78584 KB	Output is correct
3	Correct	70 ms	78712 KB	Output is correct
4	Correct	71 ms	78584 KB	Output is correct
5	Correct	73 ms	78712 KB	Output is correct
6	Correct	69 ms	78556 KB	Output is correct
7	Correct	73 ms	78608 KB	Output is correct
8	Correct	68 ms	78612 KB	Output is correct
9	Correct	67 ms	78592 KB	Output is correct
10	Correct	69 ms	78712 KB	Output is correct

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	78556 KB	Output is correct
2	Correct	73 ms	78624 KB	Output is correct
3	Correct	71 ms	78712 KB	Output is correct
4	Correct	65 ms	78712 KB	Output is correct
5	Correct	65 ms	78584 KB	Output is correct
6	Correct	73 ms	78584 KB	Output is correct
7	Correct	74 ms	78584 KB	Output is correct
8	Correct	66 ms	78556 KB	Output is correct
9	Correct	70 ms	78584 KB	Output is correct
10	Correct	70 ms	78712 KB	Output is correct

Subtask #3

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	76 ms	78624 KB	Output is correct
2	Correct	71 ms	78584 KB	Output is correct
3	Correct	80 ms	78712 KB	Output is correct
4	Correct	68 ms	78712 KB	Output is correct
5	Correct	74 ms	78700 KB	Output is correct
6	Correct	71 ms	78712 KB	Output is correct
7	Correct	70 ms	78712 KB	Output is correct
8	Correct	72 ms	78588 KB	Output is correct
9	Correct	74 ms	78712 KB	Output is correct
10	Correct	66 ms	78584 KB	Output is correct

Subtask #4

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	418 ms	84812 KB	Output is correct
2	Correct	463 ms	85468 KB	Output is correct
3	Correct	435 ms	85464 KB	Output is correct
4	Correct	438 ms	84904 KB	Output is correct
5	Correct	456 ms	85112 KB	Output is correct
6	Correct	345 ms	86092 KB	Output is correct
7	Correct	407 ms	83976 KB	Output is correct
8	Correct	426 ms	85112 KB	Output is correct
9	Correct	488 ms	86068 KB	Output is correct
10	Correct	270 ms	85244 KB	Output is correct

Subtask #5

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	661 ms	84448 KB	Output is correct
2	Correct	723 ms	84032 KB	Output is correct
3	Correct	464 ms	84396 KB	Output is correct
4	Correct	461 ms	83696 KB	Output is correct
5	Correct	403 ms	84984 KB	Output is correct
6	Correct	340 ms	84872 KB	Output is correct
7	Correct	387 ms	84984 KB	Output is correct
8	Correct	516 ms	83440 KB	Output is correct
9	Correct	628 ms	84220 KB	Output is correct
10	Correct	320 ms	85112 KB	Output is correct