oj.uz

Submission #117341

# Submission time Handle Problem Language Result Execution time Memory
117341 2019-06-15T14:08:38 Z rajarshi_basu Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 568 ms 199800 KB 
#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <fstream>
#include <complex>
#include <stack>
#include <set>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double> 
#define ld long double
#define pld pair<ld,ld>
#define iii pair<ii,int>

using namespace std;

const ll INF = 1e9+10;
const int MAXN = 10000*100+10;




struct Node{
	int left,right;
	short val;
};

Node BUF[20*MAXN];

int ppt = 0;
int init(int left=-1,int right=-1,int v=0){
	int x = ppt++;
	BUF[x].left = left; BUF[x].right = right;
	BUF[x].val = v;
	return x;
}


int versions[MAXN];
int len[MAXN];

inline void expand(int node){
	if(node == -1)node = init();
	//if(node->left == NULL)node->left = new Node(0);
	//if(node->right == NULL)node->right = new Node(0);
}

int update(int node,int ss,int se,int i,short val){
	if(ss > i or se < i)return node;
	//expand(node);
	if(ss == se){
		return init(BUF[node].left,BUF[node].right,val);
	}else{
		int mid = (ss+se)/2;
		auto l = BUF[node].left;
		auto r = BUF[node].right;
		if(i <= mid){
			if(BUF[node].left == -1)BUF[node].left = init();
			l = update(BUF[node].left,ss,mid,i,val);
		}
		else{
			if(BUF[node].right == -1)BUF[node].right = init();
			r = update(BUF[node].right,mid+1,se,i,val);
		}
		return init(l,r,0);
	}
}
short get(int node,int ss,int se,int i){
	if(ss > i or se < i)return -1;
	if(node == -1)return -1;
	if(ss==se)return BUF[node].val;
	int mid=(ss+se)/2;
	return max(get(BUF[node].left,ss,mid,i),get(BUF[node].right,mid+1,se,i));
}

int PTR = 0;

void Init(){
	versions[0] = init();
	len[0] = 0;
}

void TypeLetter(char a){
	PTR++;
	versions[PTR] = update(versions[PTR-1],0,MAXN,len[PTR-1],a);
	len[PTR] = len[PTR-1]+1;
}

void UndoCommands(int x){
	PTR++;
	versions[PTR] = versions[PTR-x-1];
	len[PTR] = len[PTR-x-1];
}

char GetLetter(int p){
	return (char)get(versions[PTR],0,MAXN,p);
}

/*
int main(){
	Init();
	TypeLetter('a');
	TypeLetter('b');
	cout << GetLetter(1) << endl;
	TypeLetter('d');
	UndoCommands(2);
	UndoCommands(1);
	cout << GetLetter(2) << endl;
	TypeLetter('e');
	UndoCommands(1);
	UndoCommands(5);
	TypeLetter('c');
	cout << GetLetter(2) << endl;
	UndoCommands(2);
	cout << GetLetter(2) << endl;



	return 0;
}


*/

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 4 ms 1152 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 17 ms 1280 KB Output is correct
7 Correct 4 ms 1280 KB Output is correct
8 Correct 4 ms 1024 KB Output is correct
9 Correct 4 ms 1152 KB Output is correct
10 Correct 4 ms 768 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 376 ms 163716 KB Output is correct
2 Correct 384 ms 179924 KB Output is correct
3 Correct 449 ms 176344 KB Output is correct
4 Correct 468 ms 140420 KB Output is correct
5 Correct 444 ms 150416 KB Output is correct
6 Correct 379 ms 192104 KB Output is correct
7 Correct 427 ms 97128 KB Output is correct
8 Correct 399 ms 146644 KB Output is correct
9 Correct 450 ms 199800 KB Output is correct
10 Correct 264 ms 137084 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 139772 KB Output is correct
2 Correct 520 ms 123620 KB Output is correct
3 Correct 439 ms 135276 KB Output is correct
4 Correct 481 ms 101368 KB Output is correct
5 Correct 361 ms 147724 KB Output is correct
6 Correct 347 ms 136568 KB Output is correct
7 Correct 369 ms 146428 KB Output is correct
8 Correct 489 ms 72696 KB Output is correct
9 Correct 568 ms 129312 KB Output is correct
10 Correct 273 ms 135792 KB Output is correct