oj.uz

Submission #62557

# Submission time Handle Problem Language Result Execution time Memory
62557 2018-07-29T05:56:32 Z zetapi Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 68652 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e6+99;

char X[MAX];

int ind,tot,arr[MAX],height[MAX],Parent[MAX][22];

void Init() 
{

}

void TypeLetter(char L) 
{
	X[++ind]=L;
	Parent[ind][0]=arr[tot++];
	height[ind]=height[Parent[ind][0]]+1;
	for(int A=1;A<21;A++)
		Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
	arr[tot]=ind;
	return ;
}

void UndoCommands(int U) 
{
	++tot;
	arr[tot]=arr[tot-U-1];
	return ;
}

char GetLetter(int P) 
{
	P++;
	int res=arr[tot];
	for(int A=20;A>=0;A--)
	{
		if(height[Parent[res][A]]>=P)
			res=Parent[res][A];
	}
	//cout<<cur<<" "<<res<<" "<<height[res]<<"\n";
	return X[res];
}

/*signed main()
{
	ios_base::sync_with_stdio(false);

	
	TypeLetter('a');
	TypeLetter('b');
	TypeLetter('d');
	UndoCommands(2);
	UndoCommands(1);
	cout<<GetLetter(2);
	return 0;
}*/

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 724 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 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 748 KB Output is correct
2 Correct 5 ms 748 KB Output is correct
3 Correct 4 ms 748 KB Output is correct
4 Correct 4 ms 876 KB Output is correct
5 Correct 4 ms 876 KB Output is correct
6 Correct 5 ms 1008 KB Output is correct
7 Correct 4 ms 1008 KB Output is correct
8 Correct 5 ms 1008 KB Output is correct
9 Correct 5 ms 1008 KB Output is correct
10 Correct 6 ms 1008 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 898 ms 56428 KB Output is correct
2 Correct 833 ms 62200 KB Output is correct
3 Correct 552 ms 62200 KB Output is correct
4 Correct 617 ms 62200 KB Output is correct
5 Correct 900 ms 62200 KB Output is correct
6 Correct 679 ms 67500 KB Output is correct
7 Correct 730 ms 67500 KB Output is correct
8 Correct 603 ms 67500 KB Output is correct
9 Correct 961 ms 68652 KB Output is correct
10 Correct 279 ms 68652 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 68652 KB Time limit exceeded
2 Halted 0 ms 0 KB -