oj.uz

Submission #950530

# Submission time Handle Problem Language Result Execution time Memory
950530 2024-03-20T11:44:03 Z qin Arranging Shoes (IOI19_shoes) C++17
100 / 100
 210 ms 33516 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vv vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18; int mod = 119<<23|1;
struct seg{
		int base;
		vv<int> t;
		void init(int n){
				base = 1;
				while(base < n) base <<= 1;
				t.resize(base<<1, 0);
				for(int i = 1; i <= n; ++i) t[i+base-1] = 1;
				for(int i = base-1; i; --i) t[i] = t[i<<1]+t[i<<1|1];
		}
		void update(int i, int val){
				for(i += base-1, t[i] = val, i >>= 1; i; i >>= 1) t[i] = t[i<<1]+t[i<<1|1];
		}
		int query_interval(int i, int s, int e, int x, int y){
				if(x <= s && e <= y) return t[i];
				int mid = (s+e)>>1, result = 0;
				if(x <= mid) result += query_interval(i<<1, s, mid, x, y);
				if(mid < y) result += query_interval(i<<1|1, mid+1, e, x, y);
				return result;
		}
		int query(int l, int r){
				if(l <= r) return query_interval(1, 1, base, max(1, l), min(base, r));
				return 0;
		}
};
ll count_swaps(vv<int> t){
		int n = ssize(t);
		set<int> s;
		vv<set<int>> v(n+3);
		for(int i = 0; i < n; ++i) t[i] = t[i] > 0 ? 2*t[i]+1 : -2*t[i], s.emplace(i), v[t[i]].emplace(i);
		
		ll result = 0;
		seg seg; seg.init(n+2);
		for(int i = 0; i < n/2; ++i){
				int posx = *s.begin(), x = t[posx];
				int posy = *v[x^1].begin();
				//~ printf("%d: %d %d: ", x, posx, posy);
				if(x & 1) result += seg.query(posx+1, posy);
				else result += seg.query(posx+2, posy);
				seg.update(posx+1, 0), seg.update(posy+1, 0);
				v[x].erase(posx), v[x^1].erase(posy);
				s.erase(posx), s.erase(posy);
				//~ printf("%lld\n", result);
		}
		return result;
}
#ifdef LOCAL
int main(){
		int T = 1;
		for(++T; --T; ){
				int n; scanf("%d", &n);
				vv<int> t(n<<1);
				for(int i = 0; i < n<<1; ++i) scanf("%d", &t[i]);
				ll result = count_swaps(t);
				printf("%lld\n", result);
		}
		return 0;
}
#endif

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 0 ms 500 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 532 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 12 ms 3676 KB Output is correct
21 Correct 11 ms 3676 KB Output is correct
22 Correct 137 ms 32080 KB Output is correct
23 Correct 118 ms 32084 KB Output is correct
24 Correct 130 ms 32076 KB Output is correct
25 Correct 140 ms 32220 KB Output is correct
26 Correct 158 ms 33460 KB Output is correct
27 Correct 125 ms 33108 KB Output is correct
28 Correct 133 ms 33260 KB Output is correct
29 Correct 132 ms 33500 KB Output is correct
30 Correct 141 ms 33500 KB Output is correct
31 Correct 133 ms 33500 KB Output is correct
32 Correct 134 ms 33516 KB Output is correct
33 Correct 132 ms 33304 KB Output is correct
34 Correct 133 ms 33484 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 151 ms 33376 KB Output is correct
38 Correct 132 ms 33500 KB Output is correct
39 Correct 147 ms 33308 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 126 ms 32024 KB Output is correct
6 Correct 149 ms 33300 KB Output is correct
7 Correct 149 ms 33364 KB Output is correct
8 Correct 153 ms 33364 KB Output is correct
9 Correct 127 ms 33312 KB Output is correct
10 Correct 151 ms 33360 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 0 ms 500 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 532 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 600 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 0 ms 500 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 532 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 12 ms 3676 KB Output is correct
55 Correct 11 ms 3676 KB Output is correct
56 Correct 137 ms 32080 KB Output is correct
57 Correct 118 ms 32084 KB Output is correct
58 Correct 130 ms 32076 KB Output is correct
59 Correct 140 ms 32220 KB Output is correct
60 Correct 158 ms 33460 KB Output is correct
61 Correct 125 ms 33108 KB Output is correct
62 Correct 133 ms 33260 KB Output is correct
63 Correct 132 ms 33500 KB Output is correct
64 Correct 141 ms 33500 KB Output is correct
65 Correct 133 ms 33500 KB Output is correct
66 Correct 134 ms 33516 KB Output is correct
67 Correct 132 ms 33304 KB Output is correct
68 Correct 133 ms 33484 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 600 KB Output is correct
71 Correct 151 ms 33376 KB Output is correct
72 Correct 132 ms 33500 KB Output is correct
73 Correct 147 ms 33308 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 126 ms 32024 KB Output is correct
79 Correct 149 ms 33300 KB Output is correct
80 Correct 149 ms 33364 KB Output is correct
81 Correct 153 ms 33364 KB Output is correct
82 Correct 127 ms 33312 KB Output is correct
83 Correct 151 ms 33360 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 1 ms 600 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 1 ms 600 KB Output is correct
95 Correct 2 ms 604 KB Output is correct
96 Correct 2 ms 604 KB Output is correct
97 Correct 1 ms 604 KB Output is correct
98 Correct 1 ms 604 KB Output is correct
99 Correct 1 ms 604 KB Output is correct
100 Correct 1 ms 600 KB Output is correct
101 Correct 12 ms 3928 KB Output is correct
102 Correct 13 ms 3676 KB Output is correct
103 Correct 187 ms 33336 KB Output is correct
104 Correct 104 ms 33480 KB Output is correct
105 Correct 189 ms 33432 KB Output is correct
106 Correct 139 ms 33296 KB Output is correct
107 Correct 193 ms 33320 KB Output is correct
108 Correct 136 ms 33336 KB Output is correct
109 Correct 132 ms 33360 KB Output is correct
110 Correct 137 ms 33364 KB Output is correct
111 Correct 135 ms 33324 KB Output is correct
112 Correct 168 ms 33448 KB Output is correct
113 Correct 210 ms 33472 KB Output is correct
114 Correct 127 ms 33432 KB Output is correct
115 Correct 131 ms 33332 KB Output is correct