Submission #62561

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
62561	2018-07-29T06:05:43 Z	zetapi	Crayfish scrivener (IOI12_scrivener)	C++14	34 / 100	1000 ms	69584 KB

scrivener

#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][25];

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<25;A++)
		Parent[ind][A]=Parent[Parent[ind][A-1]][A-1];
	arr[tot]=ind;
	return ;
}

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

char GetLetter(int P) 
{
	int res=arr[tot];
	for(int A=24;A>=0;A--)
	{
		if(height[Parent[res][A]]>P)
			res=Parent[res][A];
	}
	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;
}*/

Compilation message

scrivener.cpp: In function 'void UndoCommands(int)':
scrivener.cpp:35:6: warning: operation on 'tot' may be undefined [-Wsequence-point]
  arr[++tot]=arr[tot-U];
      ^~~~~

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

Subtask #2

7.0 / 7.0

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

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	875 ms	63172 KB	Output is correct
2	Correct	916 ms	69584 KB	Output is correct
3	Correct	603 ms	69584 KB	Output is correct
4	Correct	513 ms	69584 KB	Output is correct
5	Execution timed out	1030 ms	69584 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

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