oj.uz

Submission #107587

# Submission time Handle Problem Language Result Execution time Memory
107587 2019-04-25T08:37:22 Z ekrem Crayfish scrivener (IOI12_scrivener) C++
100 / 100
 948 ms 147960 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1100005
using namespace std;

typedef long long ll;

struct node{
	int git[26], par[23], ne, der;
} x[N];

int n, m, k, yer[N], lg[N];

void Init(){
	for(int i = 20; i >= 1; i--){
		for(int j = (1<<i); j > (1<<(i - 1)); j--){
			lg[j] = i;
			// cout << j << " " << i << endl;
		}
	}
	lg[0] = 1;
	lg[1] = 1;
}

void TypeLetter(char c){
	int node = yer[m];
	c -= 'a';
	if(x[node].git[c] != 0)
		yer[++m] = x[node].git[c];
	else{
		x[node].git[c] = ++k;
		x[k].par[0] = node;
		x[k].ne = c;
		x[k].der = x[node].der + 1;
		// cout << node << " ->" << k << endl;
		yer[++m] = k;
		for(int i = 1; i < lg[x[k].der]; i++){
			if(x[k].par[i - 1] == 0)
				break;
			x[k].par[i] = x[x[k].par[i - 1]].par[i - 1];
		}
	}
}

void UndoCommands(int y){
	yer[m + 1] = yer[m - y];
	m++;
}

char GetLetter(int y){
	int node = yer[m];
	y = x[node].der - (y + 1);
	// cout << node << " " << y << " inci harfi bul, en son " << (char)(x[node].ne + 'a') << " var. " << x[node].der << " uzunlugunda" << endl;
	for(int i = lg[y]; i >= 0; i--){
		if((1<<i) <= y){
			y -= (1<<i);
			node = x[node].par[i];
		}
	}
	// cout << node << endl;
	return x[node].ne + 'a';
}

// int main() {
// 	freopen("in.txt", "r", stdin);
// 	freopen("out.txt", "w", stdout);
// 	Init();
// 	TypeLetter('a');
// 	TypeLetter('b');
// 	cout << GetLetter(1) << endl;
// 	TypeLetter('d');
// 	UndoCommands(2);
// 	UndoCommands(1);
// 	cout << GetLetter(2) << endl;
// 	TypeLetter('e');
// 	UndoCommands(1);
// 	UndoCommands(5);
// 	TypeLetter('c');
// 	cout << GetLetter(2) << endl;
// 	UndoCommands(2);
// 	cout << GetLetter(2) << endl;
// 	return 0;
// }

Compilation message

scrivener.cpp: In function 'void TypeLetter(char)':
scrivener.cpp:32:18: warning: array subscript has type 'char' [-Wchar-subscripts]
  if(x[node].git[c] != 0)
                  ^
scrivener.cpp:33:27: warning: array subscript has type 'char' [-Wchar-subscripts]
   yer[++m] = x[node].git[c];
                           ^
scrivener.cpp:35:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   x[node].git[c] = ++k;
                ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4480 KB Output is correct
2 Correct 6 ms 4480 KB Output is correct
3 Correct 5 ms 4480 KB Output is correct
4 Correct 5 ms 4480 KB Output is correct
5 Correct 6 ms 4480 KB Output is correct
6 Correct 6 ms 4480 KB Output is correct
7 Correct 7 ms 4480 KB Output is correct
8 Correct 6 ms 4480 KB Output is correct
9 Correct 4 ms 4480 KB Output is correct
10 Correct 6 ms 4480 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4480 KB Output is correct
2 Correct 6 ms 4480 KB Output is correct
3 Correct 7 ms 4480 KB Output is correct
4 Correct 7 ms 4480 KB Output is correct
5 Correct 8 ms 4480 KB Output is correct
6 Correct 6 ms 4480 KB Output is correct
7 Correct 5 ms 4480 KB Output is correct
8 Correct 6 ms 4480 KB Output is correct
9 Correct 5 ms 4480 KB Output is correct
10 Correct 6 ms 4480 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4736 KB Output is correct
2 Correct 6 ms 4736 KB Output is correct
3 Correct 7 ms 4736 KB Output is correct
4 Correct 8 ms 4988 KB Output is correct
5 Correct 7 ms 4736 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4736 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 695 ms 122132 KB Output is correct
2 Correct 762 ms 133776 KB Output is correct
3 Correct 533 ms 130168 KB Output is correct
4 Correct 416 ms 98424 KB Output is correct
5 Correct 599 ms 113228 KB Output is correct
6 Correct 659 ms 144120 KB Output is correct
7 Correct 708 ms 70572 KB Output is correct
8 Correct 658 ms 107204 KB Output is correct
9 Correct 745 ms 147960 KB Output is correct
10 Correct 219 ms 108788 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 104092 KB Output is correct
2 Correct 929 ms 91768 KB Output is correct
3 Correct 428 ms 98936 KB Output is correct
4 Correct 427 ms 71288 KB Output is correct
5 Correct 572 ms 110072 KB Output is correct
6 Correct 567 ms 102576 KB Output is correct
7 Correct 529 ms 109824 KB Output is correct
8 Correct 721 ms 52580 KB Output is correct
9 Correct 948 ms 94840 KB Output is correct
10 Correct 219 ms 111964 KB Output is correct