Submission #62512

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

char last;

char X[MAX];

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

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;
	return ;
}

void UndoCommands(int U) 
{
	++ind;
	par[ind]=get(ind-U-1);
	size[ind]=size[par[ind]];
	return ;
}

char GetLetter(int P) 
{
	P++;
	int cur=ind;
	while(cur)
	{
		if(size[cur]==P and X[cur]>='a' and X[cur]<='z')
			return X[cur];
		cur=get(par[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;
}*/

Compilation message

scrivener.cpp: In function 'char GetLetter(int)':
scrivener.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	424 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	508 KB	Output is correct
6	Correct	2 ms	532 KB	Output is correct
7	Correct	2 ms	540 KB	Output is correct
8	Correct	2 ms	596 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	608 KB	Output is correct
2	Correct	2 ms	612 KB	Output is correct
3	Correct	2 ms	612 KB	Output is correct
4	Correct	2 ms	616 KB	Output is correct
5	Correct	3 ms	620 KB	Output is correct
6	Correct	2 ms	624 KB	Output is correct
7	Correct	2 ms	628 KB	Output is correct
8	Correct	2 ms	632 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	2 ms	680 KB	Output is correct

Subtask #3

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	684 KB	Output is correct
2	Correct	6 ms	824 KB	Output is correct
3	Correct	4 ms	824 KB	Output is correct
4	Correct	5 ms	824 KB	Output is correct
5	Correct	4 ms	828 KB	Output is correct
6	Correct	3 ms	828 KB	Output is correct
7	Correct	3 ms	860 KB	Output is correct
8	Correct	4 ms	920 KB	Output is correct
9	Correct	5 ms	920 KB	Output is correct
10	Correct	3 ms	920 KB	Output is correct

Subtask #4

0 / 26.0

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

Subtask #5

0 / 40.0

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