oj.uz

Submission #62515

# Submission time Handle Problem Language Result Execution time Memory
62515 2018-07-28T20:23:51 Z zetapi Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 111024 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=3e6;

char last;

char X[MAX];

int ind,size[MAX],par[MAX],Parent[MAX][21];

void Init() 
{

}

int get(int u)
{
	if(par[u]==u or (X[u]>='a' and X[u]<='z'))
		return u;
	return par[u]=get(par[u]);
}

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

void UndoCommands(int U) 
{
	++ind;
	par[ind]=get(ind-U-1);
	size[ind]=size[par[ind]];
	Parent[ind][0]=par[ind];
	for(int A=1;A<21;A++)
		Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
	return ;
}

char GetLetter(int P) 
{
	P++;
	int cur=ind;
	for(int A=20;A>=0;A--)
	{
		if(size[Parent[cur][A]]>=P)
			cur=Parent[cur][A];
	}
	return X[cur];
}

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

	
	TypeLetter('a');
	TypeLetter('b');
	TypeLetter('d');
	UndoCommands(2);
	UndoCommands(1);
	cout<<GetLetter(2);
	//cout<<ind<<" "<<par[ind]<<"\n";
	return 0;
}*/

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 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 3 ms 532 KB Output is correct
8 Correct 3 ms 532 KB Output is correct
9 Correct 3 ms 532 KB Output is correct
10 Correct 3 ms 572 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 896 ms 65860 KB Output is correct
2 Correct 920 ms 84476 KB Output is correct
3 Correct 625 ms 88548 KB Output is correct
4 Correct 689 ms 98592 KB Output is correct
5 Correct 865 ms 98592 KB Output is correct
6 Correct 847 ms 111024 KB Output is correct
7 Execution timed out 1087 ms 111024 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

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