oj.uz

Submission #126326

# Submission time Handle Problem Language Result Execution time Memory
126326 2019-07-07T12:00:22 Z groeneprof Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 117212 KB 
#include <bits/stdc++.h>
#define P(x) do {if(debug) cout << x << endl;} while(false)
#define H(x) P(#x << ": " << x)
#define FR(i, a, b) for(int i = (a); i < (b); ++i)
#define F(i, n) FR(i, 0, n)
using namespace std;
const bool debug = 0 ;
const int inf = 1e9;
const int N = 1000005;
//int ind[N];
char parent[N];
int depth[N];
int memo[N][23];
bool check[N][23];
int cur;

/*int root(int a){
	if(a==ind[a]){
		return a;
	}
	return ind[a] = root(ind[a]);
}*/

void print(){
	if(debug){
		//cout<<"ind: ";
		//F(i, cur+1) cout<<ind[i]<<" ";
		cout<<"\nparent: ";
		F(i, cur+1) cout<<parent[i]<<" ";
		cout<<"\ndepth: ";
		F(i, cur+1) cout<<depth[i]<<" ";
		cout<<"\nmemo: ";
		F(i, cur+1) cout<<memo[i][0]<<" ";

	}
}

int f(int i, int h){
	if(check[i][h]){
		return memo[i][h];
	}
	check[i][h] = true;
	return memo[i][h] = f(f(i,h-1) , h-1);
}

void Init() {
	//ind[0] = 0;
	parent[0] = '\\';
	depth[0] = 0;
	P("I");
	//memo.resize(N, vector<int> (23, -1));
	memo[0][0] = 0;
	check[0][0] = true;
	P("II");
	cur = 0;
}

void TypeLetter(char L) {
	H(L);
	int n = cur+1;
	//ind[n] = n;
	parent[n]=L;
	memo[n][0] = cur;
	check[n][0] = true;
	depth[n] = depth[cur]+1;
	//cout<<endl;
	cur = n;
}

void UndoCommands(int U) {
	H(U);
	parent[cur+1] = parent[cur-U];
	depth[cur+1] = depth[cur-U];
	memo[cur+1][0] = memo[cur-U][0];
	check[cur+1][0] = true;
	cur++;
}

char GetLetter(int P) {
	H(P);
	print();
	int res = cur;
	for(int h = 22; h>=0; h--){
		if(depth[f(res, h)]>P) res = f(res, h);
	}
	return parent[res];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 380 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 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.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 376 KB Output is correct

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 84728 KB Output is correct
2 Correct 257 ms 103472 KB Output is correct
3 Correct 252 ms 102756 KB Output is correct
4 Correct 314 ms 107640 KB Output is correct
5 Correct 383 ms 95096 KB Output is correct
6 Correct 282 ms 112248 KB Output is correct
7 Correct 463 ms 95988 KB Output is correct
8 Correct 355 ms 108280 KB Output is correct
9 Correct 305 ms 104056 KB Output is correct
10 Correct 226 ms 117212 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 687 ms 77812 KB Output is correct
2 Correct 849 ms 71928 KB Output is correct
3 Correct 408 ms 90360 KB Output is correct
4 Correct 506 ms 80312 KB Output is correct
5 Correct 699 ms 103672 KB Output is correct
6 Correct 533 ms 107060 KB Output is correct
7 Correct 663 ms 106904 KB Output is correct
8 Execution timed out 1060 ms 91708 KB Time limit exceeded
9 Halted 0 ms 0 KB -