답안 #244429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244429	2020-07-04T05:46:22 Z	tictaccat	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	106 ms	15864 KB

shoes

#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

struct ft {
	int N; vector<int> tr;
	ft(int N): N(N), tr(N+1,0) {}
	int sum(int i) {
		i++;
		int ans = 0;
		while (i > 0) {
			ans += tr[i];
			i -= i&-i;
		}
		return ans;
	}
	int sumR(int i, int j) {
		return sum(j) - sum(i);
	}
	void add(int i, int x) {
		i++;
		while (i <= N) {
			tr[i] += x;
			i += i&-i;
		}
	}
};

long long count_swaps(std::vector<int> s) {

	int n = s.size() / 2;

	vector<vector<int>> posL(n+1), posR(n+1);
	vector<int> R(2*n, -1);

	for (int i = 0; i < 2*n; i++) {
		if (s[i] > 0) posR[s[i]].push_back(i);
		else posL[-s[i]].push_back(i);
	}

	long long ans = 0;

	for (int j = 1; j <= n; j++) {
		for (int k = 0; k < (int)posR[j].size(); k++) {
		//	cout << posL[j][k] << " " << posR[j][k] << "\n";
			//ans += abs(posR[j][k] - posL[j][k]) - 1;
			if (posR[j][k] < posL[j][k]) {
				R[posR[j][k]] = posL[j][k];
				ans++;
			}
			else R[posL[j][k]] = posR[j][k];
		}
	}

	ft tree(2*n);

	for (int i = 0; i < 2*n; i++) {
		if (R[i] == -1) continue;
	//	cout << i << " " << R[i] << " " << tree.sum(1) << "\n";
		ans += R[i] - i - 1 - tree.sumR(i,R[i]);
		tree.add(R[i],1);
	}

	return ans;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	5 ms	416 KB	Output is correct
10	Correct	5 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	4 ms	256 KB	Output is correct
23	Correct	5 ms	256 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	256 KB	Output is correct
26	Correct	5 ms	256 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct
28	Correct	5 ms	256 KB	Output is correct
29	Correct	4 ms	256 KB	Output is correct
30	Correct	4 ms	256 KB	Output is correct
31	Correct	5 ms	256 KB	Output is correct
32	Correct	4 ms	256 KB	Output is correct
33	Correct	5 ms	256 KB	Output is correct
34	Correct	5 ms	256 KB	Output is correct
35	Correct	4 ms	256 KB	Output is correct
36	Correct	5 ms	256 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	4 ms	256 KB	Output is correct
12	Correct	5 ms	256 KB	Output is correct
13	Correct	4 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	9 ms	1280 KB	Output is correct
21	Correct	8 ms	1152 KB	Output is correct
22	Correct	47 ms	9112 KB	Output is correct
23	Correct	44 ms	9196 KB	Output is correct
24	Correct	47 ms	9068 KB	Output is correct
25	Correct	41 ms	9080 KB	Output is correct
26	Correct	47 ms	10348 KB	Output is correct
27	Correct	43 ms	10220 KB	Output is correct
28	Correct	43 ms	10356 KB	Output is correct
29	Correct	43 ms	10352 KB	Output is correct
30	Correct	43 ms	10352 KB	Output is correct
31	Correct	46 ms	10372 KB	Output is correct
32	Correct	44 ms	10352 KB	Output is correct
33	Correct	42 ms	10224 KB	Output is correct
34	Correct	44 ms	10352 KB	Output is correct
35	Correct	5 ms	256 KB	Output is correct
36	Correct	5 ms	256 KB	Output is correct
37	Correct	43 ms	10352 KB	Output is correct
38	Correct	43 ms	10352 KB	Output is correct
39	Correct	43 ms	10352 KB	Output is correct

Subtask #4

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	93 ms	14456 KB	Output is correct
6	Correct	59 ms	10872 KB	Output is correct
7	Correct	88 ms	15608 KB	Output is correct
8	Correct	45 ms	10380 KB	Output is correct
9	Correct	86 ms	15864 KB	Output is correct
10	Correct	70 ms	12664 KB	Output is correct

Subtask #5

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	5 ms	416 KB	Output is correct
10	Correct	5 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	4 ms	256 KB	Output is correct
23	Correct	5 ms	256 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	256 KB	Output is correct
26	Correct	5 ms	256 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct
28	Correct	5 ms	256 KB	Output is correct
29	Correct	4 ms	256 KB	Output is correct
30	Correct	4 ms	256 KB	Output is correct
31	Correct	5 ms	256 KB	Output is correct
32	Correct	4 ms	256 KB	Output is correct
33	Correct	5 ms	256 KB	Output is correct
34	Correct	5 ms	256 KB	Output is correct
35	Correct	4 ms	256 KB	Output is correct
36	Correct	5 ms	256 KB	Output is correct
37	Correct	4 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	5 ms	256 KB	Output is correct
40	Correct	5 ms	384 KB	Output is correct
41	Correct	5 ms	384 KB	Output is correct
42	Correct	5 ms	512 KB	Output is correct
43	Correct	5 ms	384 KB	Output is correct
44	Correct	5 ms	512 KB	Output is correct
45	Correct	5 ms	384 KB	Output is correct
46	Correct	5 ms	384 KB	Output is correct
47	Correct	5 ms	384 KB	Output is correct
48	Correct	5 ms	384 KB	Output is correct
49	Correct	5 ms	384 KB	Output is correct
50	Correct	5 ms	384 KB	Output is correct
51	Correct	5 ms	384 KB	Output is correct
52	Correct	5 ms	384 KB	Output is correct

Subtask #6

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	5 ms	416 KB	Output is correct
10	Correct	5 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	4 ms	256 KB	Output is correct
23	Correct	5 ms	256 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	4 ms	256 KB	Output is correct
26	Correct	5 ms	256 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct
28	Correct	5 ms	256 KB	Output is correct
29	Correct	4 ms	256 KB	Output is correct
30	Correct	4 ms	256 KB	Output is correct
31	Correct	5 ms	256 KB	Output is correct
32	Correct	4 ms	256 KB	Output is correct
33	Correct	5 ms	256 KB	Output is correct
34	Correct	5 ms	256 KB	Output is correct
35	Correct	4 ms	256 KB	Output is correct
36	Correct	5 ms	256 KB	Output is correct
37	Correct	4 ms	256 KB	Output is correct
38	Correct	4 ms	256 KB	Output is correct
39	Correct	5 ms	256 KB	Output is correct
40	Correct	5 ms	256 KB	Output is correct
41	Correct	4 ms	256 KB	Output is correct
42	Correct	5 ms	256 KB	Output is correct
43	Correct	4 ms	256 KB	Output is correct
44	Correct	5 ms	384 KB	Output is correct
45	Correct	4 ms	256 KB	Output is correct
46	Correct	5 ms	256 KB	Output is correct
47	Correct	4 ms	256 KB	Output is correct
48	Correct	4 ms	256 KB	Output is correct
49	Correct	5 ms	256 KB	Output is correct
50	Correct	5 ms	256 KB	Output is correct
51	Correct	5 ms	384 KB	Output is correct
52	Correct	5 ms	384 KB	Output is correct
53	Correct	5 ms	384 KB	Output is correct
54	Correct	9 ms	1280 KB	Output is correct
55	Correct	8 ms	1152 KB	Output is correct
56	Correct	47 ms	9112 KB	Output is correct
57	Correct	44 ms	9196 KB	Output is correct
58	Correct	47 ms	9068 KB	Output is correct
59	Correct	41 ms	9080 KB	Output is correct
60	Correct	47 ms	10348 KB	Output is correct
61	Correct	43 ms	10220 KB	Output is correct
62	Correct	43 ms	10356 KB	Output is correct
63	Correct	43 ms	10352 KB	Output is correct
64	Correct	43 ms	10352 KB	Output is correct
65	Correct	46 ms	10372 KB	Output is correct
66	Correct	44 ms	10352 KB	Output is correct
67	Correct	42 ms	10224 KB	Output is correct
68	Correct	44 ms	10352 KB	Output is correct
69	Correct	5 ms	256 KB	Output is correct
70	Correct	5 ms	256 KB	Output is correct
71	Correct	43 ms	10352 KB	Output is correct
72	Correct	43 ms	10352 KB	Output is correct
73	Correct	43 ms	10352 KB	Output is correct
74	Correct	5 ms	384 KB	Output is correct
75	Correct	4 ms	256 KB	Output is correct
76	Correct	4 ms	256 KB	Output is correct
77	Correct	4 ms	256 KB	Output is correct
78	Correct	93 ms	14456 KB	Output is correct
79	Correct	59 ms	10872 KB	Output is correct
80	Correct	88 ms	15608 KB	Output is correct
81	Correct	45 ms	10380 KB	Output is correct
82	Correct	86 ms	15864 KB	Output is correct
83	Correct	70 ms	12664 KB	Output is correct
84	Correct	4 ms	384 KB	Output is correct
85	Correct	5 ms	384 KB	Output is correct
86	Correct	5 ms	256 KB	Output is correct
87	Correct	5 ms	384 KB	Output is correct
88	Correct	5 ms	384 KB	Output is correct
89	Correct	5 ms	512 KB	Output is correct
90	Correct	5 ms	384 KB	Output is correct
91	Correct	5 ms	512 KB	Output is correct
92	Correct	5 ms	384 KB	Output is correct
93	Correct	5 ms	384 KB	Output is correct
94	Correct	5 ms	384 KB	Output is correct
95	Correct	5 ms	384 KB	Output is correct
96	Correct	5 ms	384 KB	Output is correct
97	Correct	5 ms	384 KB	Output is correct
98	Correct	5 ms	384 KB	Output is correct
99	Correct	5 ms	384 KB	Output is correct
100	Correct	5 ms	512 KB	Output is correct
101	Correct	10 ms	1792 KB	Output is correct
102	Correct	10 ms	1408 KB	Output is correct
103	Correct	106 ms	15608 KB	Output is correct
104	Correct	96 ms	15612 KB	Output is correct
105	Correct	84 ms	12920 KB	Output is correct
106	Correct	80 ms	15608 KB	Output is correct
107	Correct	62 ms	11000 KB	Output is correct
108	Correct	67 ms	11384 KB	Output is correct
109	Correct	44 ms	10608 KB	Output is correct
110	Correct	43 ms	10352 KB	Output is correct
111	Correct	77 ms	14968 KB	Output is correct
112	Correct	87 ms	14200 KB	Output is correct
113	Correct	60 ms	10944 KB	Output is correct
114	Correct	78 ms	15608 KB	Output is correct
115	Correct	80 ms	15608 KB	Output is correct