oj.uz

Submission #754977

# Submission time Handle Problem Language Result Execution time Memory
754977 2023-06-09T07:54:53 Z ByeWorld Editor (BOI15_edi) C++14
100 / 100
 556 ms 331764 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
//#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 3e5+10;

struct node{//segtree RMQ
	int val = 0; int l, r;
	node *le, *ri;
	void bd(int l2, int r2){
		l = l2; r = r2;
		if(l==r) return;
	}
	int que(int x, int y){
		if(x<=l && r<=y) return val;
		if(r<x || y<l) return 0;
		if(le == NULL){
			le = new node(); le->bd(l, (l+r)/2);
		}
		if(ri == NULL){
			ri = new node(); ri->bd((l+r)/2+1, r);
		}
		return max(le->que(x, y), ri->que(x, y));
	}
	node *upd(int x, int p){
		if(r<x || x<l) return this;
		if(le == NULL){
			le = new node(); le->bd(l, (l+r)/2);
		}
		if(ri == NULL){
			ri = new node(); ri->bd((l+r)/2+1, r);
		}
		//mengandung x
		node *ret; ret = new node();
		*ret = *this;

		if(l==r){
			ret->val = p;
			return ret;
		}

		ret->le = ret->le->upd(x, p);
		ret->ri = ret->ri->upd(x, p);
		ret->val = max(ret->le->val, ret->ri->val);
		return ret;
	}
};

node *A[MAXN];
int n, subtask;
int t[MAXN];

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;
	A[0] = new node(); 
	A[0]->bd(0, MAXN-10);

	for(int i=1; i<=n; i++){
		A[i] = new node();

		cin >> t[i];
		if(t[i] > 0){
			*A[i] = *A[i-1];
			A[i] = A[i]->upd(0, i);
			//cout << i-1 << ' ' << A[i-1]->que(0, 0) << "que\n";
		} else {
			int idx = A[i-1]->que(0, (-t[i])-1); 
			*A[i] = *A[idx-1];
			A[i] = A[i]->upd((-t[i]), i);
		}
		cout << t[A[i]->que(0, 0)] << '\n';
		//cout << t[A[i]->que(0, 0)] << ' ' << A[i]->que(0, 0) <<'p'<< '\n';
		/*for(int j=i; j>=1; j--){
			cout << A[j]->que(0, 0) << ' ' << j << '\n';
		}*/
	}
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 10 ms 5716 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 9 ms 5460 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 5332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 8 ms 5844 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 377 ms 303080 KB Output is correct
2 Correct 361 ms 303072 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 164908 KB Output is correct
2 Correct 270 ms 187432 KB Output is correct
3 Correct 342 ms 248576 KB Output is correct
4 Correct 365 ms 303120 KB Output is correct
5 Correct 556 ms 331764 KB Output is correct
6 Correct 350 ms 301036 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 10 ms 5716 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 9 ms 5460 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 5332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 8 ms 5844 KB Output is correct
10 Correct 377 ms 303080 KB Output is correct
11 Correct 361 ms 303072 KB Output is correct
12 Correct 252 ms 164908 KB Output is correct
13 Correct 270 ms 187432 KB Output is correct
14 Correct 342 ms 248576 KB Output is correct
15 Correct 365 ms 303120 KB Output is correct
16 Correct 556 ms 331764 KB Output is correct
17 Correct 350 ms 301036 KB Output is correct
18 Correct 545 ms 331652 KB Output is correct
19 Correct 430 ms 312524 KB Output is correct
20 Correct 437 ms 310548 KB Output is correct
21 Correct 393 ms 303020 KB Output is correct
22 Correct 533 ms 331744 KB Output is correct