Submission #1035969

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1035969	2024-07-26T22:06:33 Z	ArthuroWich	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	233 ms	28928 KB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
int arr[200005], seg[4*200005];
void build(int n, int l, int r) {
	if (l == r) {
		seg[n] = arr[l];
	} else {
		int m = (l+r)/2;
		build(2*n, l, m);
		build(2*n+1, m+1, r);
		seg[n] = seg[2*n] + seg[2*n+1];
	}
}
void update(int n, int l, int r, int i, int v) {
	if (l == r) {
		seg[n] = v;
	} else {
		int m = (l+r)/2;
		if (l <= i && i <= m) {
			update(2*n, l, m, i, v);
		} else {
			update(2*n+1, m+1, r, i, v);
		}
		seg[n] = seg[2*n] + seg[2*n+1];
	}
}
int query(int n, int l, int r, int a, int b) {
	if (b < l || r < a) {
		return 0;
	} else if (a <= l && r <= b) {
		return seg[n];
	} else {
		int m = (l+r)/2;
		return query(2*n, l, m, a, b) + query(2*n+1, m+1, r, a, b);
	}
}
long long count_swaps(vector<int> s) {
	int n = s.size(), ans = 0;
	vector<int> vis(n, 0);
	map<int, vector<int>> num;
	for (int i = 0; i < n; i++) {
		num[s[i]].push_back(i);
		arr[i] = 1;
	}
	for (auto c : num) {
		reverse(num[c.first].begin(), num[c.first].end());
	}
	build(1, 0, n-1);
	for (int i = 0; i < n; i++) {
		if (vis[i]) {
			continue;
		}
		int co = 0, ind = -1;
		int j = s[i]*-1;
		ind = num[j].back();
		num[s[i]].pop_back();
		num[j].pop_back();
		co = query(1, 0, n-1, i, ind)-2;
		vis[i] = 1;
		vis[ind] = 1;
		update(1, 0, n-1, i, 0);
		update(1, 0, n-1, ind, 0);
		ans += co;
		if (j < 0) {
			ans++;
		}
	}
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	448 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	448 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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	6 ms	3164 KB	Output is correct
21	Correct	5 ms	3164 KB	Output is correct
22	Correct	50 ms	8180 KB	Output is correct
23	Correct	40 ms	8008 KB	Output is correct
24	Correct	46 ms	8004 KB	Output is correct
25	Incorrect	50 ms	8044 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Incorrect	233 ms	28928 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 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	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 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	0 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	372 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 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	0 ms	448 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	348 KB	Output is correct
37	Correct	0 ms	344 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	2 ms	600 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	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	1 ms	348 KB	Output is correct
48	Correct	1 ms	428 KB	Output is correct
49	Correct	1 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

Subtask #6
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 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	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 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	0 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	372 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 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	0 ms	448 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	348 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	0 ms	604 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	448 KB	Output is correct
42	Correct	0 ms	344 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	448 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	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Correct	6 ms	3164 KB	Output is correct
55	Correct	5 ms	3164 KB	Output is correct
56	Correct	50 ms	8180 KB	Output is correct
57	Correct	40 ms	8008 KB	Output is correct
58	Correct	46 ms	8004 KB	Output is correct
59	Incorrect	50 ms	8044 KB	Output isn't correct
60	Halted	0 ms	0 KB	-

Submission #1035969

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 20.0

Subtask #4 0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 20.0

Subtask #4
0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 15.0