oj.uz

Submission #73788

# Submission time Handle Problem Language Result Execution time Memory
73788 2018-08-29T03:53:59 Z TuGSGeReL Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 223908 KB 
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
char s[1000001];
ll par[1000001][20],l[1000001],i=1,now=0,j;
void Init() {}
ll find(int i,int k){
	for(j=0;j<20;j++) if((1<<j)&k) i=par[i][j];
	return i;
}
void TypeLetter(char L) {
	s[i]=L;
	par[i][0]=now;
	l[i]=l[now]+1;
	for(j=1;j<20;j++){
		if((1<<j)>=l[i])break;
		par[i][j]=par[par[i][j-1]][j-1];
	}
	now=i;
	i++;
}
void UndoCommands(int U) {
	now=i-U-1;
	s[i]=s[now];
	for(j=0;j<20;j++)par[i][j]=par[now][j];
	l[i]=l[now];
	i++;
}
char GetLetter(int P) {
	int x=find(i-1,l[i-1]-P-1);
	return s[x];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 988 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 4 ms 1440 KB Output is correct
5 Correct 4 ms 1464 KB Output is correct
6 Correct 5 ms 1640 KB Output is correct
7 Correct 5 ms 1640 KB Output is correct
8 Correct 4 ms 1716 KB Output is correct
9 Correct 5 ms 1740 KB Output is correct
10 Correct 4 ms 1896 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 758 ms 121644 KB Output is correct
2 Correct 910 ms 151944 KB Output is correct
3 Correct 605 ms 155496 KB Output is correct
4 Correct 663 ms 168636 KB Output is correct
5 Correct 813 ms 168636 KB Output is correct
6 Correct 695 ms 183956 KB Output is correct
7 Correct 801 ms 183956 KB Output is correct
8 Correct 847 ms 189404 KB Output is correct
9 Correct 852 ms 189404 KB Output is correct
10 Correct 325 ms 210464 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 887 ms 210464 KB Output is correct
2 Correct 897 ms 210464 KB Output is correct
3 Correct 578 ms 210464 KB Output is correct
4 Correct 606 ms 210464 KB Output is correct
5 Correct 670 ms 210572 KB Output is correct
6 Correct 663 ms 219768 KB Output is correct
7 Correct 737 ms 223908 KB Output is correct
8 Correct 939 ms 223908 KB Output is correct
9 Execution timed out 1012 ms 223908 KB Time limit exceeded
10 Halted 0 ms 0 KB -