oj.uz

답안 #68477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68477 2018-08-17T08:04:14 Z nvmdava 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
34 / 100
 1000 ms 64312 KB 
#include <bits/stdc++.h>
using namespace std;
char s[1000001];
int now = 0, i = 1, dir[1000001][21], sz[1000001];
void Init() {}

int find(int i, int x){
	if(sz[i] == x){
		return i;
	}
	int l = 0, r = 20;
	while(l + 1 != r){
		int m = (l + r) / 2;
		if(sz[i] - (1 << m) < x){
			r = m;
		} else {
			l = m;
		}
	}
	return find(dir[i][l], x);
}

void TypeLetter(char L) {
	s[i] = L;
	dir[i][0] = now;
	sz[i] = sz[now] + 1;
	dir[i][0] = now;
	for(int j = 1; j < 21; j++){
		if(sz[i] <= (1 << j)) break;
		dir[i][j] = dir[now][j - 1];
	}
	now = i;
	i++;
}
 
void UndoCommands(int U) {
	now = i - U - 1;
	s[i] = s[now];
	for(int j = 0; j <= 20; j++)dir[i][j] = dir[now][j];
	sz[i] = sz[now];
	i++;
}

char GetLetter(int P) {
	return s[find(i - 1, P + 1)];
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 3 ms 548 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 3 ms 744 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 744 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
3 Correct 3 ms 744 KB Output is correct
4 Correct 3 ms 744 KB Output is correct
5 Correct 2 ms 744 KB Output is correct
6 Correct 3 ms 744 KB Output is correct
7 Correct 3 ms 744 KB Output is correct
8 Correct 2 ms 744 KB Output is correct
9 Correct 2 ms 744 KB Output is correct
10 Correct 3 ms 744 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 752 KB Output is correct
2 Correct 6 ms 836 KB Output is correct
3 Correct 4 ms 876 KB Output is correct
4 Correct 6 ms 1004 KB Output is correct
5 Correct 4 ms 1004 KB Output is correct
6 Correct 5 ms 1004 KB Output is correct
7 Correct 5 ms 1004 KB Output is correct
8 Correct 6 ms 1004 KB Output is correct
9 Correct 4 ms 1004 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 64312 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1095 ms 64312 KB Time limit exceeded
2 Halted 0 ms 0 KB -