oj.uz

Submission #911516

# Submission time Handle Problem Language Result Execution time Memory
911516 2024-01-19T02:58:14 Z Muhammad_Aneeq Crayfish scrivener (IOI12_scrivener) C++17
60 / 100
 1000 ms 6116 KB 
#include <string>
#include <algorithm>
using namespace std;
int const N=1e6+10;
char com[N]={};
int ind[N]={};
int num=0;
string g="";
bool w=1;
void Init()
{
	com[num]=' ';
	ind[0]=0;
}
void TypeLetter(char L)
{
	num++;
	com[num]=L;	
	ind[num]=num;
	g+=L;
}
void UndoCommands(int U)
{
	w=1;
	ind[num+1]=ind[num-U];
	com[num+1]=com[num-U];
	num++;
}
char GetLetter(int P)
{
	if (w)
	{
		g="";
		int i=ind[num];
		while (i!=0)
		{
			g+=com[i];
			i=ind[i-1];
		}
		reverse(begin(g),end(g));
		w=0;
	}
	return g[P];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 5128 KB Output is correct
2 Correct 78 ms 5388 KB Output is correct
3 Correct 88 ms 5544 KB Output is correct
4 Correct 118 ms 5616 KB Output is correct
5 Correct 100 ms 5420 KB Output is correct
6 Correct 84 ms 5892 KB Output is correct
7 Correct 113 ms 5020 KB Output is correct
8 Correct 104 ms 5872 KB Output is correct
9 Correct 88 ms 5776 KB Output is correct
10 Correct 80 ms 6116 KB Output is correct

Subtask #5
0 / 40.0

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