Submission #237288

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
237288	2020-06-05T17:35:09 Z	T0p_	Crayfish scrivener (IOI12_scrivener)	C++14	74 / 100	543 ms	262148 KB

scrivener

#include <bits/stdc++.h>
using namespace std;
 
struct node
{
	int v, l, r;
	char c;
};
 
int all, ver;
int root[1000005];
node seg[26000000];
 
int build(int l, int r)
{
	int now = ++all;
	if(l == r) return now;
	int mid = (l+r)>>1;
	int L = build(l, mid), R = build(mid+1, r);
	seg[now] = {0, L, R};
	return now;
}
 
void Init() {
	root[0] = build(1, 1000000);
}
 
int update(int idx, int l, int r, int p, char c) {
	if(!(l <= p && p <= r)) return idx;
	int now = ++all;
	if(l == r)
	{
		seg[now].v = 1;
		seg[now].c = c;
		return now;
	}
	int mid = (l+r)>>1;
	int L = update(seg[idx].l, l, mid, p, c), R = update(seg[idx].r, mid+1, r, p, c);
	seg[now].l = L, seg[now].r = R, seg[now].v = seg[L].v+seg[R].v;
	return now;
}
 
void TypeLetter(char L) {
	ver++;
	root[ver] = update(root[ver-1], 1, 1000000, seg[root[ver-1]].v+1, L);
}
 
void UndoCommands(int U) {
	ver++;
	root[ver] = root[ver-U-1];
}
 
char query(int idx, int l, int r, int p)
{
	if(l == r) return seg[idx].c;
	int mid = (l+r)>>1;
	return (p <= mid) ? query(seg[idx].l, l, mid, p) : query(seg[idx].r, mid+1, r, p);
}
 
char GetLetter(int P) {
	return query(root[ver], 1, 1000000, P+1);
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	31616 KB	Output is correct
2	Correct	28 ms	31736 KB	Output is correct
3	Correct	28 ms	31864 KB	Output is correct
4	Correct	27 ms	31608 KB	Output is correct
5	Correct	28 ms	31648 KB	Output is correct
6	Correct	29 ms	31608 KB	Output is correct
7	Correct	27 ms	31616 KB	Output is correct
8	Correct	32 ms	31736 KB	Output is correct
9	Correct	28 ms	31744 KB	Output is correct
10	Correct	28 ms	31736 KB	Output is correct

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	31616 KB	Output is correct
2	Correct	27 ms	31608 KB	Output is correct
3	Correct	27 ms	31616 KB	Output is correct
4	Correct	27 ms	31616 KB	Output is correct
5	Correct	27 ms	31616 KB	Output is correct
6	Correct	29 ms	31608 KB	Output is correct
7	Correct	28 ms	31616 KB	Output is correct
8	Correct	27 ms	31744 KB	Output is correct
9	Correct	27 ms	31736 KB	Output is correct
10	Correct	27 ms	31744 KB	Output is correct

Subtask #3

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	32120 KB	Output is correct
2	Correct	29 ms	32128 KB	Output is correct
3	Correct	30 ms	32248 KB	Output is correct
4	Correct	29 ms	32640 KB	Output is correct
5	Correct	30 ms	32256 KB	Output is correct
6	Correct	30 ms	32896 KB	Output is correct
7	Correct	29 ms	32888 KB	Output is correct
8	Correct	29 ms	32504 KB	Output is correct
9	Correct	31 ms	32632 KB	Output is correct
10	Correct	30 ms	32128 KB	Output is correct

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	431 ms	224504 KB	Output is correct
2	Correct	449 ms	244088 KB	Output is correct
3	Correct	443 ms	239480 KB	Output is correct
4	Correct	447 ms	194680 KB	Output is correct
5	Correct	495 ms	211576 KB	Output is correct
6	Correct	452 ms	262144 KB	Output is correct
7	Correct	461 ms	137848 KB	Output is correct
8	Correct	449 ms	198092 KB	Output is correct
9	Runtime error	405 ms	262148 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
10	Halted	0 ms	0 KB	-

Subtask #5

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	489 ms	194936 KB	Output is correct
2	Correct	532 ms	174220 KB	Output is correct
3	Correct	447 ms	188920 KB	Output is correct
4	Correct	467 ms	146044 KB	Output is correct
5	Correct	432 ms	204408 KB	Output is correct
6	Correct	432 ms	193424 KB	Output is correct
7	Correct	433 ms	204792 KB	Output is correct
8	Correct	487 ms	108536 KB	Output is correct
9	Correct	543 ms	178040 KB	Output is correct
10	Correct	361 ms	199416 KB	Output is correct