oj.uz

Submission #382365

# Submission time Handle Problem Language Result Execution time Memory
382365 2021-03-27T07:32:29 Z alishahali1382 Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 869 ms 86636 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

const int MAXN=1000010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int par[MAXN][LOG], sz[MAXN], nex[MAXN];
char last[MAXN];

void Init(){
	
}
void TypeLetter(char ch){
	n++;
	last[n]=ch;
	nex[n]=n;
	par[n][0]=nex[n-1];
	sz[n]=sz[nex[n-1]]+1;
//	if (!last[par[n][0]]) par[n][0]=par[par[n][0]][0];
	for (int i=1; i<LOG; i++) par[n][i]=par[par[n][i-1]][i-1];
}
void UndoCommands(int ted){
	n++;
	nex[n]=nex[n-1-ted];
	par[n][0]=nex[n];
//	if (!last[par[n][0]]) par[n][0]=par[par[n][0]][0];
	sz[n]=sz[par[n][0]]+1;
	for (int i=1; i<LOG; i++) par[n][i]=par[par[n][i-1]][i-1];
}
char GetLetter(int pos){
	int v=n, ted=sz[v]-pos-1;
	for (int i=LOG-1; ~i; i--) if (ted&(1<<i)) v=par[v][i];
	return last[v];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 62828 KB Output is correct
2 Correct 487 ms 76524 KB Output is correct
3 Correct 423 ms 76012 KB Output is correct
4 Correct 494 ms 79596 KB Output is correct
5 Correct 443 ms 70564 KB Output is correct
6 Correct 363 ms 82924 KB Output is correct
7 Correct 863 ms 71116 KB Output is correct
8 Correct 811 ms 79980 KB Output is correct
9 Correct 469 ms 76920 KB Output is correct
10 Correct 341 ms 86636 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 57512 KB Output is correct
2 Correct 563 ms 49900 KB Output is correct
3 Correct 429 ms 63288 KB Output is correct
4 Correct 452 ms 54892 KB Output is correct
5 Correct 407 ms 73708 KB Output is correct
6 Correct 439 ms 76140 KB Output is correct
7 Correct 442 ms 76140 KB Output is correct
8 Correct 869 ms 63852 KB Output is correct
9 Correct 801 ms 61548 KB Output is correct
10 Correct 337 ms 85636 KB Output is correct