oj.uz

Submission #95898

# Submission time Handle Problem Language Result Execution time Memory
95898 2019-02-03T12:39:11 Z psmao Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 857 ms 93444 KB 
#include <bits/stdc++.h>
using namespace std;

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 1000005;

struct node{int dep, fa[21]; char c;}a[maxn];
int T;

void Init() 
{
	T = 0;
}
void TypeLetter(char L) 
{
	++ T;
	a[T].dep = a[T-1].dep + 1;
	a[T].fa[0] = T-1; fo(j,1,20) a[T].fa[j] = a[a[T].fa[j-1]].fa[j-1];
	a[T].c = L;
}
void UndoCommands(int U)
{
	++ T; a[T] = a[T-1-U];
}
char GetLetter(int P) 
{
	int c = a[T].dep - P - 1, now = T;
	fd(i,20,0) if(c&(1<<i)) now = a[now].fa[i];
	return a[now].c;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 599 ms 68656 KB Output is correct
2 Correct 612 ms 83064 KB Output is correct
3 Correct 363 ms 83340 KB Output is correct
4 Correct 355 ms 88312 KB Output is correct
5 Correct 481 ms 77440 KB Output is correct
6 Correct 465 ms 89896 KB Output is correct
7 Correct 450 ms 79280 KB Output is correct
8 Correct 569 ms 87924 KB Output is correct
9 Correct 674 ms 83876 KB Output is correct
10 Correct 226 ms 93444 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 63976 KB Output is correct
2 Correct 736 ms 56696 KB Output is correct
3 Correct 379 ms 70648 KB Output is correct
4 Correct 358 ms 63352 KB Output is correct
5 Correct 461 ms 80760 KB Output is correct
6 Correct 406 ms 83248 KB Output is correct
7 Correct 488 ms 83172 KB Output is correct
8 Correct 618 ms 71936 KB Output is correct
9 Correct 857 ms 69112 KB Output is correct
10 Correct 224 ms 92408 KB Output is correct