oj.uz

Submission #943914

# Submission time Handle Problem Language Result Execution time Memory
943914 2024-03-12T04:27:47 Z pan Crayfish scrivener (IOI12_scrivener) C++17
100 / 100
 836 ms 216148 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, srb_tree_tag, tree_order_statistics_node_update>
typedef int ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;

ll label = 0;
ll ptr = 0; // dummy start point
ll par[1000005][26], twok[1000005][26];
char node[1000005];
ll depth[1000005];

void TypeLetter(char L)
{
	++label;
	node[label] = L;
	depth[label] = depth[ptr]+1;
	twok[label][0] = ptr;
	for (ll i=1; i<=20; ++i)
	{
		if (twok[label][i-1]==0) break;
		twok[label][i] = twok[twok[label][i-1]][i-1];
	}
	par[label][0] = ptr;
	ptr  = label;
	for (ll i=1; i<=20; ++i)
	{
		if (par[ptr][i-1]==0) break;
		par[ptr][i] = par[par[ptr][i-1]][i-1];
	}
	//show(ptr);
}


void UndoCommands(int U)
{
	ll last = ptr;
	//show2(U, last);
	for (ll k=20; k>=0; --k)
	{
		if ((U&((1LL<<k)))==0) continue;
		ptr = par[ptr][k];
		//show2(k, ptr);
		
	}
	++label;
	node[label] = node[ptr];
	depth[label] = depth[ptr];
	for (ll i=0; i<26; ++i) twok[label][i] = twok[ptr][i];
	ptr= label;
	par[ptr][0] = last;
	for (ll i=1; i<=20; ++i)
	{
		if (par[ptr][i-1]==0) break;
		par[ptr][i] = par[par[ptr][i-1]][i-1];
	}
	//show(ptr);
}

char GetLetter(int P)
{
	ll finding = ptr;
	ll mask = depth[ptr]-P-1;
	for (ll k=20; k>=0; --k)
	{
		if ((mask&((1LL<<k)))==0) continue;
		finding = twok[finding][k];
	}
	//show(finding);
	return node[finding];
}



void Init()
{
	for (ll i=0; i<=1000000; ++i) for (ll j=0; j<26; ++j) par[i][j] = 0;
	for (ll i=0; i<=1000000; ++i) for (ll j=0; j<26; ++j) twok[i][j] = 0;
	for (ll i=0; i<=1000000; ++i) depth[i]= 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 208612 KB Output is correct
2 Correct 26 ms 208728 KB Output is correct
3 Correct 26 ms 208668 KB Output is correct
4 Correct 25 ms 208784 KB Output is correct
5 Correct 27 ms 208768 KB Output is correct
6 Correct 25 ms 208712 KB Output is correct
7 Correct 25 ms 208772 KB Output is correct
8 Correct 27 ms 208720 KB Output is correct
9 Correct 25 ms 208728 KB Output is correct
10 Correct 25 ms 208728 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 208732 KB Output is correct
2 Correct 24 ms 208732 KB Output is correct
3 Correct 25 ms 208732 KB Output is correct
4 Correct 25 ms 208720 KB Output is correct
5 Correct 25 ms 208732 KB Output is correct
6 Correct 25 ms 208728 KB Output is correct
7 Correct 28 ms 208724 KB Output is correct
8 Correct 25 ms 208884 KB Output is correct
9 Correct 24 ms 208724 KB Output is correct
10 Correct 26 ms 208732 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 208756 KB Output is correct
2 Correct 29 ms 208852 KB Output is correct
3 Correct 27 ms 208728 KB Output is correct
4 Correct 26 ms 208724 KB Output is correct
5 Correct 26 ms 208732 KB Output is correct
6 Correct 25 ms 208732 KB Output is correct
7 Correct 26 ms 208732 KB Output is correct
8 Correct 27 ms 208732 KB Output is correct
9 Correct 25 ms 208760 KB Output is correct
10 Correct 26 ms 208732 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 212600 KB Output is correct
2 Correct 491 ms 212968 KB Output is correct
3 Correct 543 ms 213628 KB Output is correct
4 Correct 836 ms 215288 KB Output is correct
5 Correct 417 ms 214044 KB Output is correct
6 Correct 453 ms 212984 KB Output is correct
7 Correct 716 ms 215156 KB Output is correct
8 Correct 726 ms 214136 KB Output is correct
9 Correct 467 ms 213460 KB Output is correct
10 Correct 269 ms 213076 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 213812 KB Output is correct
2 Correct 498 ms 215060 KB Output is correct
3 Correct 508 ms 214476 KB Output is correct
4 Correct 542 ms 216148 KB Output is correct
5 Correct 396 ms 213748 KB Output is correct
6 Correct 398 ms 213580 KB Output is correct
7 Correct 430 ms 213656 KB Output is correct
8 Correct 730 ms 215376 KB Output is correct
9 Correct 652 ms 214868 KB Output is correct
10 Correct 252 ms 212980 KB Output is correct