oj.uz

Submission #936551

# Submission time Handle Problem Language Result Execution time Memory
936551 2024-03-02T07:25:22 Z penguin133 Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 251 ms 51288 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node{
	int s, e, m, val, lz;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e) >> 1;
		if(s != e)l = new node(s, m), r = new node(m+1, e);
		val = lz= 0 ;
	}
	void prop(){
		if(lz){
			val = lz;
			if(s != e)l->lz = lz, r->lz = lz;
			lz = 0;
		}
	}
	void upd(int a, int b, int c){
		prop();
		if(a == s && b == e)lz = c;
		else{
			if(b <= m)l->upd(a, b, c);
			else if(a > m)r->upd(a, b, c);
			else l->upd(a, m, c), r->upd(m+1, b, c);
			l->prop(), r->prop();
		}
	}
	int qry(int x){
		prop();
		if(s == e)return val;
		if(x <= m)return l->qry(x);
		else return r->qry(x);
	}
}*root;

void solve(){
	int n; cin >> n;
	map <int, vector <int> > mp;
	root = new node(1, n);
	for(int i = 1; i <= n; i++){
		int x; cin >> x;
		root->upd(i, i, x);
		while(!mp[x].empty() && root->qry(mp[x].back()) != x)mp[x].pop_back();
		if(!mp[x].empty()){
			root->upd(mp[x].back(), i, x);
		}
		mp[x].push_back(i);
	}
	for(int i = 1; i <= n; i++)cout << root->qry(i) << ' ';
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

Main.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main(){
      | ^~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 1012 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 720 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 107 ms 28032 KB Output is correct
18 Correct 94 ms 27904 KB Output is correct
19 Correct 100 ms 27176 KB Output is correct
20 Correct 100 ms 27072 KB Output is correct
21 Correct 96 ms 27152 KB Output is correct
22 Correct 97 ms 27168 KB Output is correct
23 Correct 96 ms 27076 KB Output is correct
24 Correct 98 ms 27076 KB Output is correct
25 Correct 96 ms 27076 KB Output is correct
26 Correct 97 ms 26988 KB Output is correct
27 Correct 96 ms 26980 KB Output is correct
28 Correct 100 ms 26980 KB Output is correct
29 Correct 88 ms 27080 KB Output is correct
30 Correct 94 ms 27848 KB Output is correct
31 Correct 94 ms 27836 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 1012 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 440 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 716 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 2 ms 720 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 107 ms 28032 KB Output is correct
48 Correct 94 ms 27904 KB Output is correct
49 Correct 100 ms 27176 KB Output is correct
50 Correct 100 ms 27072 KB Output is correct
51 Correct 96 ms 27152 KB Output is correct
52 Correct 97 ms 27168 KB Output is correct
53 Correct 96 ms 27076 KB Output is correct
54 Correct 98 ms 27076 KB Output is correct
55 Correct 96 ms 27076 KB Output is correct
56 Correct 97 ms 26988 KB Output is correct
57 Correct 96 ms 26980 KB Output is correct
58 Correct 100 ms 26980 KB Output is correct
59 Correct 88 ms 27080 KB Output is correct
60 Correct 94 ms 27848 KB Output is correct
61 Correct 94 ms 27836 KB Output is correct
62 Correct 104 ms 31148 KB Output is correct
63 Correct 234 ms 51276 KB Output is correct
64 Correct 225 ms 51284 KB Output is correct
65 Correct 108 ms 30240 KB Output is correct
66 Correct 129 ms 29736 KB Output is correct
67 Correct 106 ms 30148 KB Output is correct
68 Correct 107 ms 30144 KB Output is correct
69 Correct 124 ms 29892 KB Output is correct
70 Correct 107 ms 29936 KB Output is correct
71 Correct 108 ms 29992 KB Output is correct
72 Correct 108 ms 30032 KB Output is correct
73 Correct 221 ms 40484 KB Output is correct
74 Correct 251 ms 40276 KB Output is correct
75 Correct 224 ms 51284 KB Output is correct
76 Correct 231 ms 51280 KB Output is correct
77 Correct 219 ms 51280 KB Output is correct
78 Correct 219 ms 51288 KB Output is correct