oj.uz

Submission #761870

# Submission time Handle Problem Language Result Execution time Memory
761870 2023-06-20T10:42:50 Z IvanJ Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 214 ms 31024 KB 
#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define all(a) (a).begin(), (a).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 2e5 + 5;

struct Seg {
	int pot;
	vector<int> T, L;
	
	void init(int _n) {
		pot = 1;
		while(pot < _n) pot <<= 1;
		for(int i = 0;i < (pot << 1);i++) 
			T.pb(0), L.pb(0);
	}
	
	void prop(int x) {
		if(L[x]) {
			T[x] = L[x];
			if(x < pot) 
				L[x * 2] = L[x * 2 + 1] = L[x];
			L[x] = 0;
		}
	}
	
	void update(int x, int lo, int hi, int a, int b, int v) {
		prop(x);
		if(hi < a || b < lo) return;
		if(a <= lo && hi <= b) {
			L[x] = v;
			prop(x);
			return;	
		}
		int mid = (lo + hi) / 2;
		update(x * 2, lo, mid, a, b, v);
		update(x * 2 + 1, mid + 1, hi, a, b, v);
	}
	
	int query(int x, int lo, int hi, int X) {
		prop(x);
		if(lo == hi) return T[x];
		int mid = (lo + hi) / 2;
		if(lo <= X && X <= mid) 
			return query(x * 2, lo, mid, X);
		else 
			return query(x * 2 + 1, mid + 1, hi, X);	
	}
	
	void set(int lo, int hi, int v) {
		update(1, 0, pot - 1, lo, hi, v);	
	}
	
	int get(int x) {
		return query(1, 0, pot - 1, x);	
	}
};

int n;
int a[maxn];
map<int, vector<int>> pos;

int main() {
	scanf("%d", &n);
	for(int i = 0;i < n;i++) 
		scanf("%d", a + i);
	
	Seg S;
	S.init(n);
	
	for(int i = 0;i < n;i++) {
		while(pos[a[i]].size()) {
			int x = pos[a[i]].back();
			if(S.get(x) == a[i]) {
				S.set(x, i - 1, a[i]);
				break;
			}
			pos[a[i]].pop_back();
		}
		S.set(i, i, a[i]);
		pos[a[i]].pb(i);
	}
	
	for(int i = 0;i < n;i++) 
		printf("%d\n", S.get(i));
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
Main.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d", a + i);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 312 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 312 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 528 KB Output is correct
30 Correct 2 ms 468 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 95 ms 7660 KB Output is correct
18 Correct 95 ms 7716 KB Output is correct
19 Correct 103 ms 6776 KB Output is correct
20 Correct 99 ms 6800 KB Output is correct
21 Correct 101 ms 6800 KB Output is correct
22 Correct 98 ms 6880 KB Output is correct
23 Correct 100 ms 6820 KB Output is correct
24 Correct 101 ms 6852 KB Output is correct
25 Correct 112 ms 6800 KB Output is correct
26 Correct 102 ms 6876 KB Output is correct
27 Correct 99 ms 6788 KB Output is correct
28 Correct 100 ms 6820 KB Output is correct
29 Correct 87 ms 6760 KB Output is correct
30 Correct 103 ms 7560 KB Output is correct
31 Correct 95 ms 7676 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 312 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 312 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 528 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 0 ms 312 KB Output is correct
32 Correct 0 ms 312 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 308 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 95 ms 7660 KB Output is correct
48 Correct 95 ms 7716 KB Output is correct
49 Correct 103 ms 6776 KB Output is correct
50 Correct 99 ms 6800 KB Output is correct
51 Correct 101 ms 6800 KB Output is correct
52 Correct 98 ms 6880 KB Output is correct
53 Correct 100 ms 6820 KB Output is correct
54 Correct 101 ms 6852 KB Output is correct
55 Correct 112 ms 6800 KB Output is correct
56 Correct 102 ms 6876 KB Output is correct
57 Correct 99 ms 6788 KB Output is correct
58 Correct 100 ms 6820 KB Output is correct
59 Correct 87 ms 6760 KB Output is correct
60 Correct 103 ms 7560 KB Output is correct
61 Correct 95 ms 7676 KB Output is correct
62 Correct 111 ms 10960 KB Output is correct
63 Correct 214 ms 31020 KB Output is correct
64 Correct 188 ms 31024 KB Output is correct
65 Correct 106 ms 9640 KB Output is correct
66 Correct 105 ms 9576 KB Output is correct
67 Correct 106 ms 10092 KB Output is correct
68 Correct 106 ms 9508 KB Output is correct
69 Correct 107 ms 8356 KB Output is correct
70 Correct 107 ms 9616 KB Output is correct
71 Correct 107 ms 9708 KB Output is correct
72 Correct 108 ms 8748 KB Output is correct
73 Correct 169 ms 19756 KB Output is correct
74 Correct 207 ms 20004 KB Output is correct
75 Correct 185 ms 30580 KB Output is correct
76 Correct 196 ms 31020 KB Output is correct
77 Correct 190 ms 31020 KB Output is correct
78 Correct 203 ms 29632 KB Output is correct