oj.uz

Submission #286615

# Submission time Handle Problem Language Result Execution time Memory
286615 2020-08-30T15:30:03 Z amiratou Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 127116 KB 
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int LOG=20,MX=(int)(1e6+1);

int up[MX][LOG],d[MX],idx;
char car[MX];
vector<int> vec[MX];
 
void Init() {
 
}
 
void TypeLetter(char L) {
	vec[idx].pb(idx+1);
	d[idx+1]=d[idx]+1;
	up[idx+1][0]=idx;
	for (int i = 1; i < LOG; ++i)
		up[idx+1][i]=up[up[idx+1][i-1]][i-1];
	car[idx+1]=L;
	idx++;
}
 
void UndoCommands(int U) {
	d[idx+1]=d[idx-U];
	up[idx+1][0]=up[idx-U][0];
	for (int i = 1; i < LOG; ++i)
		up[idx+1][i]=up[up[idx+1][i-1]][i-1];
	if(idx!=U){
		vec[up[idx-U][0]].pb(idx+1);
		car[idx+1]=car[idx-U];
	}
	idx++;
}
 
char GetLetter(int P) {
	int k=d[idx]-1-P,a=idx;
	for (int i = 0; i < LOG; ++i)
		if((k>>i)&1)a=up[a][i];
	return car[a];
 
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24064 KB Output is correct
2 Correct 19 ms 24064 KB Output is correct
3 Correct 19 ms 24320 KB Output is correct
4 Correct 19 ms 24320 KB Output is correct
5 Correct 19 ms 24192 KB Output is correct
6 Correct 19 ms 24320 KB Output is correct
7 Correct 19 ms 24320 KB Output is correct
8 Correct 19 ms 24320 KB Output is correct
9 Correct 19 ms 24320 KB Output is correct
10 Correct 19 ms 24320 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 104696 KB Output is correct
2 Correct 597 ms 119672 KB Output is correct
3 Correct 593 ms 118852 KB Output is correct
4 Correct 709 ms 118776 KB Output is correct
5 Correct 521 ms 110332 KB Output is correct
6 Correct 454 ms 127116 KB Output is correct
7 Execution timed out 1047 ms 104952 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 573 ms 96760 KB Output is correct
2 Correct 612 ms 87032 KB Output is correct
3 Correct 580 ms 101636 KB Output is correct
4 Correct 638 ms 89848 KB Output is correct
5 Correct 465 ms 112652 KB Output is correct
6 Correct 518 ms 114296 KB Output is correct
7 Correct 502 ms 114936 KB Output is correct
8 Execution timed out 1085 ms 95008 KB Time limit exceeded
9 Halted 0 ms 0 KB -