oj.uz

Submission #943932

# Submission time Handle Problem Language Result Execution time Memory
943932 2024-03-12T04:55:11 Z pan Crayfish scrivener (IOI12_scrivener) C++17
100 / 100
 373 ms 105972 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 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];
	}
	ptr  = label;
	//show(ptr);
}


void UndoCommands(int U)
{
	ll last = ptr-U;
	++label;
	node[label] = node[last];
	depth[label] = depth[last];
	for (ll i=0; i<=20; ++i) twok[label][i] = twok[last][i];
	ptr= label;
	//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 j=0; j<26; ++j) twok[0][j] = 0;
	depth[0]= 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 78676 KB Output is correct
2 Correct 237 ms 95056 KB Output is correct
3 Correct 209 ms 95056 KB Output is correct
4 Correct 230 ms 99328 KB Output is correct
5 Correct 234 ms 87244 KB Output is correct
6 Correct 214 ms 103380 KB Output is correct
7 Correct 251 ms 89172 KB Output is correct
8 Correct 235 ms 99152 KB Output is correct
9 Correct 248 ms 95424 KB Output is correct
10 Correct 131 ms 105972 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 72952 KB Output is correct
2 Correct 309 ms 63120 KB Output is correct
3 Correct 200 ms 79004 KB Output is correct
4 Correct 217 ms 69200 KB Output is correct
5 Correct 211 ms 91216 KB Output is correct
6 Correct 248 ms 95316 KB Output is correct
7 Correct 237 ms 95224 KB Output is correct
8 Correct 373 ms 81128 KB Output is correct
9 Correct 353 ms 77140 KB Output is correct
10 Correct 130 ms 105204 KB Output is correct