oj.uz

Submission #247043

# Submission time Handle Problem Language Result Execution time Memory
247043 2020-07-10T19:55:23 Z ernestvw Arranging Shoes (IOI19_shoes) C++17
100 / 100
 395 ms 288632 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define sz(x) ((int)x.size())

ll tree[1000*1000];
ll lazy[1000*1000];

void update(int l, int r, int L, int R, int i, ll val) {
	if(r < l || l > R || r < L) return;
	if(L <= l && r <= R) {
		tree[i] += lazy[i] + val;
		lazy[2*i+1] += lazy[i] + val;
		lazy[2*i+2] += lazy[i] + val;
		lazy[i] = 0;
		return;
	}
	lazy[2*i+1] += lazy[i];
	lazy[2*i+2] += lazy[i];
	lazy[i] = 0;
	update(l, (l+r)/2, L, R, 2*i+1, val);
	update((l+r)/2+1, r, L, R, 2*i+2, val);
	tree[i] = tree[2*i+1] + tree[2*i+2];
}

ll sum(int l, int r, int L, int R, int i) {
	if(r < l || l > R || r < L) return 0;
	if(L <= l && r <= R) {
		tree[i] += lazy[i];
		lazy[2*i+1] += lazy[i];
		lazy[2*i+2] += lazy[i];
		lazy[i] = 0;
		return tree[i];
	}
	lazy[2*i+1] += lazy[i];
	lazy[2*i+2] += lazy[i];
	tree[i] += lazy[i];
	lazy[i] = 0;
	return sum(l, (l+r)/2, L, R, 2*i+1) + sum((l+r)/2+1, r, L, R, 2*i+2);
}

ll count_swaps(vector<int> S) {
	int n = (int)S.size();
	ll ans = 0;

	vector<deque<int>> L(n+1), R(n+1);
//	vector<ll> avant(n+1,0);
//	for(int i = 0; i < n; ++i)
//		avant[i] = n - i - 1;
	
	memset(tree, 0, sizeof(tree));
	for(int i = 0; i < n; ++i)
		update(0, n-1, i, i, 0, n-i-1);

	for(int i = 0; i < n; ++i) {
//		cout << "----" << endl;
//		for(int i = 0; i < n; ++i) cout << avant[i] << " ";
//		cout << endl;
//		for(int i = 0; i < n; ++i) cout << sum(0, n-1, i, i, 0) << " ";
//		cout << endl;
		
		int x = abs(S[i]);
		if(S[i] > 0) {
			if(sz(L[x]) > 0) {
				int j = L[x].front();
//				ans += avant[j] - avant[i] - 1LL;
//				for(int k = j + 1; k <= i; ++k)
//					avant[k]--;
				ans += sum(0, n-1, j, j, 0) - sum(0, n-1, i, i, 0) - 1LL;
				update(0, n-1, j+1, i, 0, -1);
				L[x].pop_front();
			}
			else R[x].push_back(i);
		}
		else {
			if(sz(R[x]) > 0) {
				int j = R[x].front();
//				ans += avant[j] - avant[i];
//				for(int k = j; k <= i; ++k)
//					avant[k]--;
				ans += sum(0, n-1, j, j, 0) - sum(0, n-1, i, i, 0);
				update(0, n-1, j, i, 0, -1);
				R[x].pop_front();
			}
			else L[x].push_back(i);
		}
	}

	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 9 ms 8192 KB Output is correct
8 Correct 9 ms 8192 KB Output is correct
9 Correct 9 ms 8192 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct
11 Correct 8 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 8 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 9 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Correct 8 ms 8192 KB Output is correct
23 Correct 9 ms 8192 KB Output is correct
24 Correct 9 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 9 ms 8192 KB Output is correct
28 Correct 9 ms 8192 KB Output is correct
29 Correct 9 ms 8192 KB Output is correct
30 Correct 11 ms 8192 KB Output is correct
31 Correct 8 ms 8192 KB Output is correct
32 Correct 9 ms 8192 KB Output is correct
33 Correct 8 ms 8192 KB Output is correct
34 Correct 8 ms 8192 KB Output is correct
35 Correct 8 ms 8192 KB Output is correct
36 Correct 9 ms 8320 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 9 ms 8192 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 9 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 8 ms 8192 KB Output is correct
10 Correct 9 ms 8192 KB Output is correct
11 Correct 8 ms 8192 KB Output is correct
12 Correct 9 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 8 ms 8320 KB Output is correct
16 Correct 9 ms 8448 KB Output is correct
17 Correct 9 ms 8960 KB Output is correct
18 Correct 11 ms 10880 KB Output is correct
19 Correct 11 ms 10880 KB Output is correct
20 Correct 37 ms 36224 KB Output is correct
21 Correct 40 ms 36224 KB Output is correct
22 Correct 308 ms 286840 KB Output is correct
23 Correct 309 ms 286872 KB Output is correct
24 Correct 298 ms 287096 KB Output is correct
25 Correct 334 ms 287428 KB Output is correct
26 Correct 322 ms 287224 KB Output is correct
27 Correct 302 ms 287096 KB Output is correct
28 Correct 320 ms 287484 KB Output is correct
29 Correct 333 ms 287736 KB Output is correct
30 Correct 319 ms 287476 KB Output is correct
31 Correct 352 ms 287096 KB Output is correct
32 Correct 319 ms 287564 KB Output is correct
33 Correct 314 ms 287480 KB Output is correct
34 Correct 329 ms 287456 KB Output is correct
35 Correct 9 ms 8192 KB Output is correct
36 Correct 9 ms 8192 KB Output is correct
37 Correct 343 ms 287604 KB Output is correct
38 Correct 313 ms 287528 KB Output is correct
39 Correct 314 ms 287484 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 361 ms 287096 KB Output is correct
6 Correct 351 ms 287224 KB Output is correct
7 Correct 349 ms 287096 KB Output is correct
8 Correct 331 ms 287612 KB Output is correct
9 Correct 356 ms 287096 KB Output is correct
10 Correct 380 ms 287096 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 9 ms 8192 KB Output is correct
8 Correct 9 ms 8192 KB Output is correct
9 Correct 9 ms 8192 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct
11 Correct 8 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 8 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 9 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Correct 8 ms 8192 KB Output is correct
23 Correct 9 ms 8192 KB Output is correct
24 Correct 9 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 9 ms 8192 KB Output is correct
28 Correct 9 ms 8192 KB Output is correct
29 Correct 9 ms 8192 KB Output is correct
30 Correct 11 ms 8192 KB Output is correct
31 Correct 8 ms 8192 KB Output is correct
32 Correct 9 ms 8192 KB Output is correct
33 Correct 8 ms 8192 KB Output is correct
34 Correct 8 ms 8192 KB Output is correct
35 Correct 8 ms 8192 KB Output is correct
36 Correct 9 ms 8320 KB Output is correct
37 Correct 8 ms 8192 KB Output is correct
38 Correct 9 ms 8320 KB Output is correct
39 Correct 9 ms 8448 KB Output is correct
40 Correct 9 ms 8960 KB Output is correct
41 Correct 11 ms 10880 KB Output is correct
42 Correct 11 ms 10880 KB Output is correct
43 Correct 11 ms 11008 KB Output is correct
44 Correct 11 ms 11008 KB Output is correct
45 Correct 11 ms 11008 KB Output is correct
46 Correct 11 ms 11008 KB Output is correct
47 Correct 11 ms 11008 KB Output is correct
48 Correct 12 ms 10880 KB Output is correct
49 Correct 12 ms 10880 KB Output is correct
50 Correct 11 ms 10880 KB Output is correct
51 Correct 12 ms 11008 KB Output is correct
52 Correct 12 ms 11008 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 9 ms 8192 KB Output is correct
8 Correct 9 ms 8192 KB Output is correct
9 Correct 9 ms 8192 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct
11 Correct 8 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 8 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 9 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Correct 8 ms 8192 KB Output is correct
23 Correct 9 ms 8192 KB Output is correct
24 Correct 9 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 9 ms 8192 KB Output is correct
28 Correct 9 ms 8192 KB Output is correct
29 Correct 9 ms 8192 KB Output is correct
30 Correct 11 ms 8192 KB Output is correct
31 Correct 8 ms 8192 KB Output is correct
32 Correct 9 ms 8192 KB Output is correct
33 Correct 8 ms 8192 KB Output is correct
34 Correct 8 ms 8192 KB Output is correct
35 Correct 8 ms 8192 KB Output is correct
36 Correct 9 ms 8320 KB Output is correct
37 Correct 8 ms 8192 KB Output is correct
38 Correct 9 ms 8192 KB Output is correct
39 Correct 9 ms 8192 KB Output is correct
40 Correct 8 ms 8192 KB Output is correct
41 Correct 9 ms 8192 KB Output is correct
42 Correct 10 ms 8192 KB Output is correct
43 Correct 8 ms 8192 KB Output is correct
44 Correct 9 ms 8192 KB Output is correct
45 Correct 8 ms 8192 KB Output is correct
46 Correct 9 ms 8192 KB Output is correct
47 Correct 9 ms 8192 KB Output is correct
48 Correct 9 ms 8192 KB Output is correct
49 Correct 8 ms 8320 KB Output is correct
50 Correct 9 ms 8448 KB Output is correct
51 Correct 9 ms 8960 KB Output is correct
52 Correct 11 ms 10880 KB Output is correct
53 Correct 11 ms 10880 KB Output is correct
54 Correct 37 ms 36224 KB Output is correct
55 Correct 40 ms 36224 KB Output is correct
56 Correct 308 ms 286840 KB Output is correct
57 Correct 309 ms 286872 KB Output is correct
58 Correct 298 ms 287096 KB Output is correct
59 Correct 334 ms 287428 KB Output is correct
60 Correct 322 ms 287224 KB Output is correct
61 Correct 302 ms 287096 KB Output is correct
62 Correct 320 ms 287484 KB Output is correct
63 Correct 333 ms 287736 KB Output is correct
64 Correct 319 ms 287476 KB Output is correct
65 Correct 352 ms 287096 KB Output is correct
66 Correct 319 ms 287564 KB Output is correct
67 Correct 314 ms 287480 KB Output is correct
68 Correct 329 ms 287456 KB Output is correct
69 Correct 9 ms 8192 KB Output is correct
70 Correct 9 ms 8192 KB Output is correct
71 Correct 343 ms 287604 KB Output is correct
72 Correct 313 ms 287528 KB Output is correct
73 Correct 314 ms 287484 KB Output is correct
74 Correct 9 ms 8192 KB Output is correct
75 Correct 9 ms 8192 KB Output is correct
76 Correct 9 ms 8192 KB Output is correct
77 Correct 9 ms 8192 KB Output is correct
78 Correct 361 ms 287096 KB Output is correct
79 Correct 351 ms 287224 KB Output is correct
80 Correct 349 ms 287096 KB Output is correct
81 Correct 331 ms 287612 KB Output is correct
82 Correct 356 ms 287096 KB Output is correct
83 Correct 380 ms 287096 KB Output is correct
84 Correct 8 ms 8192 KB Output is correct
85 Correct 9 ms 8320 KB Output is correct
86 Correct 9 ms 8448 KB Output is correct
87 Correct 9 ms 8960 KB Output is correct
88 Correct 11 ms 10880 KB Output is correct
89 Correct 11 ms 10880 KB Output is correct
90 Correct 11 ms 11008 KB Output is correct
91 Correct 11 ms 11008 KB Output is correct
92 Correct 11 ms 11008 KB Output is correct
93 Correct 11 ms 11008 KB Output is correct
94 Correct 11 ms 11008 KB Output is correct
95 Correct 12 ms 10880 KB Output is correct
96 Correct 12 ms 10880 KB Output is correct
97 Correct 11 ms 10880 KB Output is correct
98 Correct 12 ms 11008 KB Output is correct
99 Correct 12 ms 11008 KB Output is correct
100 Correct 12 ms 11008 KB Output is correct
101 Correct 41 ms 36344 KB Output is correct
102 Correct 40 ms 36472 KB Output is correct
103 Correct 395 ms 286940 KB Output is correct
104 Correct 354 ms 288120 KB Output is correct
105 Correct 345 ms 288120 KB Output is correct
106 Correct 360 ms 288120 KB Output is correct
107 Correct 322 ms 288120 KB Output is correct
108 Correct 320 ms 288120 KB Output is correct
109 Correct 315 ms 288504 KB Output is correct
110 Correct 316 ms 288632 KB Output is correct
111 Correct 351 ms 288248 KB Output is correct
112 Correct 389 ms 288124 KB Output is correct
113 Correct 360 ms 288120 KB Output is correct
114 Correct 353 ms 288248 KB Output is correct
115 Correct 356 ms 288252 KB Output is correct