oj.uz

Submission #708041

# Submission time Handle Problem Language Result Execution time Memory
708041 2023-03-10T20:59:22 Z MODDI Arranging Shoes (IOI19_shoes) C++14
100 / 100
 204 ms 29276 KB 
//#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second;
using namespace std;
int tree[4 * 200100], lazy[4 * 200100];
void update(int node, int l, int r, int L, int R, int add){
	if(lazy[node]){
		tree[node] += (r - l + 1) * lazy[node];
		if(l != r){
			lazy[node * 2] += lazy[node];
			lazy[node * 2 + 1] += lazy[node];
		}	
		lazy[node] = 0;
	}
	if(R < l || r < L)	return;
	if(L <= l && r <= R){
		tree[node] += (r - l + 1) * add;
		if(l != r){
			lazy[node * 2 + 1] += add;
			lazy[node * 2] += add;
		}
		return;
	}
	int mid = (l + r) / 2;
	update(node * 2, l, mid, L, R, add);
	update(node * 2 + 1, mid + 1, r, L, R, add);
	tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
int query(int node, int l, int r, int L, int R){
	if(lazy[node] != 0){
		tree[node] += (r - l + 1) * lazy[node];
		if(l != r){
			lazy[node * 2] += lazy[node];
			lazy[node * 2 + 1] += lazy[node];
		}
		lazy[node] = 0;
	}
	if(r < L || l > R)	return 0;
	if(L <= l && r <= R)	return tree[node];
	
	int mid = (l + r) / 2;
	int left = query(node * 2, l, mid, L, R);
	int right = query(node * 2 + 1, mid + 1, r, L, R);
	return left + right;
}
multiset<int> l_pos[100010], r_pos[100010];
long long count_swaps(std::vector<int> s) {
	ll ans = 0;
	vi arr = s;
	int n = s.size();
	for(int i = 0; i < n; i++){
		if(s[i] < 0){
			l_pos[abs(s[i])].insert(i);
		}
		else
			r_pos[s[i]].insert(i);
	}
	memset(tree, 0, sizeof tree);
	memset(lazy, 0, sizeof lazy);
	bool vis[n];
	memset(vis, false, sizeof vis);
	for(int i = 0; i < n; i++){
		if(vis[i])	continue;
		if(arr[i] < 0){
			int cur_pos = i + query(1, 0, n-1, i, i);
			int p_pos = *r_pos[abs(arr[i])].begin();
			int get = query(1, 0, n-1, p_pos, p_pos) + p_pos;
			if(cur_pos > get)
				assert(false);
			if(cur_pos >= n || get >= n)
				assert(false);
//			cout<<cur_pos<<" "<<get<<endl;
			ans += (get - cur_pos - 1);
			update(1, 0, n-1, i, p_pos-1, 1);
			vis[p_pos] = true;
			vis[i] = true;
			r_pos[abs(arr[i])].erase(p_pos);
			l_pos[abs(arr[i])].erase(i);
		}	
		else{
			int cur_pos = i + query(1, 0, n-1, i, i);
			int p_pos = *l_pos[arr[i]].begin();
			int get = query(1, 0, n-1, p_pos, p_pos) + p_pos;
			if(cur_pos > get)
				assert(false);
			if(cur_pos >= n || get >= n)
				assert(false);
			
//			cout<<cur_pos<<" "<<get<<endl;
			ans += (get - cur_pos);
//			cout<<get - cur_pos<<" "<<get<<" "<<cur_pos<<endl;
			update(1, 0, n-1, i, p_pos-1, 1);
			vis[p_pos] = true;
			vis[i] = true;
			l_pos[arr[i]].erase(p_pos);
			r_pos[arr[i]].erase(i);
		}
	}
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15932 KB Output is correct
2 Correct 8 ms 15828 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15932 KB Output is correct
2 Correct 8 ms 15828 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 15888 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15956 KB Output is correct
9 Correct 8 ms 15892 KB Output is correct
10 Correct 8 ms 15916 KB Output is correct
11 Correct 8 ms 15840 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 8 ms 15924 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 8 ms 15956 KB Output is correct
18 Correct 9 ms 15956 KB Output is correct
19 Correct 8 ms 15956 KB Output is correct
20 Correct 8 ms 15956 KB Output is correct
21 Correct 10 ms 15872 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 8 ms 15936 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 8 ms 15956 KB Output is correct
26 Correct 7 ms 15956 KB Output is correct
27 Correct 8 ms 15904 KB Output is correct
28 Correct 8 ms 15956 KB Output is correct
29 Correct 8 ms 15956 KB Output is correct
30 Correct 9 ms 15956 KB Output is correct
31 Correct 10 ms 15956 KB Output is correct
32 Correct 9 ms 15868 KB Output is correct
33 Correct 9 ms 15956 KB Output is correct
34 Correct 9 ms 15876 KB Output is correct
35 Correct 7 ms 15956 KB Output is correct
36 Correct 8 ms 15956 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15932 KB Output is correct
2 Correct 8 ms 15828 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 9 ms 15836 KB Output is correct
10 Correct 9 ms 15868 KB Output is correct
11 Correct 8 ms 15956 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 7 ms 15956 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 8 ms 15956 KB Output is correct
16 Correct 9 ms 15956 KB Output is correct
17 Correct 8 ms 15956 KB Output is correct
18 Correct 9 ms 15956 KB Output is correct
19 Correct 9 ms 15956 KB Output is correct
20 Correct 19 ms 17108 KB Output is correct
21 Correct 19 ms 17108 KB Output is correct
22 Correct 121 ms 27788 KB Output is correct
23 Correct 129 ms 27872 KB Output is correct
24 Correct 133 ms 27892 KB Output is correct
25 Correct 139 ms 27996 KB Output is correct
26 Correct 122 ms 29152 KB Output is correct
27 Correct 158 ms 28916 KB Output is correct
28 Correct 155 ms 29244 KB Output is correct
29 Correct 141 ms 29260 KB Output is correct
30 Correct 139 ms 29164 KB Output is correct
31 Correct 135 ms 29160 KB Output is correct
32 Correct 170 ms 29036 KB Output is correct
33 Correct 140 ms 29008 KB Output is correct
34 Correct 140 ms 29132 KB Output is correct
35 Correct 8 ms 15956 KB Output is correct
36 Correct 8 ms 15848 KB Output is correct
37 Correct 150 ms 29164 KB Output is correct
38 Correct 141 ms 29276 KB Output is correct
39 Correct 137 ms 29156 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 9 ms 15956 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 126 ms 27896 KB Output is correct
6 Correct 156 ms 29140 KB Output is correct
7 Correct 128 ms 29004 KB Output is correct
8 Correct 140 ms 29044 KB Output is correct
9 Correct 129 ms 29104 KB Output is correct
10 Correct 134 ms 29136 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15932 KB Output is correct
2 Correct 8 ms 15828 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 15888 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15956 KB Output is correct
9 Correct 8 ms 15892 KB Output is correct
10 Correct 8 ms 15916 KB Output is correct
11 Correct 8 ms 15840 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 8 ms 15924 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 8 ms 15956 KB Output is correct
18 Correct 9 ms 15956 KB Output is correct
19 Correct 8 ms 15956 KB Output is correct
20 Correct 8 ms 15956 KB Output is correct
21 Correct 10 ms 15872 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 8 ms 15936 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 8 ms 15956 KB Output is correct
26 Correct 7 ms 15956 KB Output is correct
27 Correct 8 ms 15904 KB Output is correct
28 Correct 8 ms 15956 KB Output is correct
29 Correct 8 ms 15956 KB Output is correct
30 Correct 9 ms 15956 KB Output is correct
31 Correct 10 ms 15956 KB Output is correct
32 Correct 9 ms 15868 KB Output is correct
33 Correct 9 ms 15956 KB Output is correct
34 Correct 9 ms 15876 KB Output is correct
35 Correct 7 ms 15956 KB Output is correct
36 Correct 8 ms 15956 KB Output is correct
37 Correct 7 ms 15956 KB Output is correct
38 Correct 7 ms 15956 KB Output is correct
39 Correct 8 ms 15856 KB Output is correct
40 Correct 8 ms 15956 KB Output is correct
41 Correct 9 ms 15956 KB Output is correct
42 Correct 8 ms 15956 KB Output is correct
43 Correct 10 ms 15956 KB Output is correct
44 Correct 9 ms 15956 KB Output is correct
45 Correct 8 ms 15956 KB Output is correct
46 Correct 8 ms 15956 KB Output is correct
47 Correct 8 ms 15956 KB Output is correct
48 Correct 10 ms 15956 KB Output is correct
49 Correct 9 ms 15956 KB Output is correct
50 Correct 9 ms 15956 KB Output is correct
51 Correct 9 ms 16004 KB Output is correct
52 Correct 9 ms 15956 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15932 KB Output is correct
2 Correct 8 ms 15828 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 15888 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15956 KB Output is correct
9 Correct 8 ms 15892 KB Output is correct
10 Correct 8 ms 15916 KB Output is correct
11 Correct 8 ms 15840 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 8 ms 15924 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 8 ms 15956 KB Output is correct
18 Correct 9 ms 15956 KB Output is correct
19 Correct 8 ms 15956 KB Output is correct
20 Correct 8 ms 15956 KB Output is correct
21 Correct 10 ms 15872 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 8 ms 15936 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 8 ms 15956 KB Output is correct
26 Correct 7 ms 15956 KB Output is correct
27 Correct 8 ms 15904 KB Output is correct
28 Correct 8 ms 15956 KB Output is correct
29 Correct 8 ms 15956 KB Output is correct
30 Correct 9 ms 15956 KB Output is correct
31 Correct 10 ms 15956 KB Output is correct
32 Correct 9 ms 15868 KB Output is correct
33 Correct 9 ms 15956 KB Output is correct
34 Correct 9 ms 15876 KB Output is correct
35 Correct 7 ms 15956 KB Output is correct
36 Correct 8 ms 15956 KB Output is correct
37 Correct 8 ms 15956 KB Output is correct
38 Correct 7 ms 15956 KB Output is correct
39 Correct 8 ms 15956 KB Output is correct
40 Correct 8 ms 15956 KB Output is correct
41 Correct 8 ms 15956 KB Output is correct
42 Correct 7 ms 15956 KB Output is correct
43 Correct 9 ms 15836 KB Output is correct
44 Correct 9 ms 15868 KB Output is correct
45 Correct 8 ms 15956 KB Output is correct
46 Correct 7 ms 15956 KB Output is correct
47 Correct 7 ms 15956 KB Output is correct
48 Correct 7 ms 15956 KB Output is correct
49 Correct 8 ms 15956 KB Output is correct
50 Correct 9 ms 15956 KB Output is correct
51 Correct 8 ms 15956 KB Output is correct
52 Correct 9 ms 15956 KB Output is correct
53 Correct 9 ms 15956 KB Output is correct
54 Correct 19 ms 17108 KB Output is correct
55 Correct 19 ms 17108 KB Output is correct
56 Correct 121 ms 27788 KB Output is correct
57 Correct 129 ms 27872 KB Output is correct
58 Correct 133 ms 27892 KB Output is correct
59 Correct 139 ms 27996 KB Output is correct
60 Correct 122 ms 29152 KB Output is correct
61 Correct 158 ms 28916 KB Output is correct
62 Correct 155 ms 29244 KB Output is correct
63 Correct 141 ms 29260 KB Output is correct
64 Correct 139 ms 29164 KB Output is correct
65 Correct 135 ms 29160 KB Output is correct
66 Correct 170 ms 29036 KB Output is correct
67 Correct 140 ms 29008 KB Output is correct
68 Correct 140 ms 29132 KB Output is correct
69 Correct 8 ms 15956 KB Output is correct
70 Correct 8 ms 15848 KB Output is correct
71 Correct 150 ms 29164 KB Output is correct
72 Correct 141 ms 29276 KB Output is correct
73 Correct 137 ms 29156 KB Output is correct
74 Correct 8 ms 15956 KB Output is correct
75 Correct 9 ms 15956 KB Output is correct
76 Correct 8 ms 15956 KB Output is correct
77 Correct 8 ms 15956 KB Output is correct
78 Correct 126 ms 27896 KB Output is correct
79 Correct 156 ms 29140 KB Output is correct
80 Correct 128 ms 29004 KB Output is correct
81 Correct 140 ms 29044 KB Output is correct
82 Correct 129 ms 29104 KB Output is correct
83 Correct 134 ms 29136 KB Output is correct
84 Correct 7 ms 15956 KB Output is correct
85 Correct 7 ms 15956 KB Output is correct
86 Correct 8 ms 15856 KB Output is correct
87 Correct 8 ms 15956 KB Output is correct
88 Correct 9 ms 15956 KB Output is correct
89 Correct 8 ms 15956 KB Output is correct
90 Correct 10 ms 15956 KB Output is correct
91 Correct 9 ms 15956 KB Output is correct
92 Correct 8 ms 15956 KB Output is correct
93 Correct 8 ms 15956 KB Output is correct
94 Correct 8 ms 15956 KB Output is correct
95 Correct 10 ms 15956 KB Output is correct
96 Correct 9 ms 15956 KB Output is correct
97 Correct 9 ms 15956 KB Output is correct
98 Correct 9 ms 16004 KB Output is correct
99 Correct 9 ms 15956 KB Output is correct
100 Correct 9 ms 15984 KB Output is correct
101 Correct 19 ms 17236 KB Output is correct
102 Correct 23 ms 17140 KB Output is correct
103 Correct 192 ms 29132 KB Output is correct
104 Correct 122 ms 29028 KB Output is correct
105 Correct 157 ms 29136 KB Output is correct
106 Correct 147 ms 29036 KB Output is correct
107 Correct 157 ms 29240 KB Output is correct
108 Correct 126 ms 29040 KB Output is correct
109 Correct 132 ms 29148 KB Output is correct
110 Correct 144 ms 29156 KB Output is correct
111 Correct 128 ms 29140 KB Output is correct
112 Correct 181 ms 29136 KB Output is correct
113 Correct 204 ms 29144 KB Output is correct
114 Correct 138 ms 29164 KB Output is correct
115 Correct 135 ms 29152 KB Output is correct