oj.uz

Submission #298847

# Submission time Handle Problem Language Result Execution time Memory
298847 2020-09-14T07:30:45 Z square1001 Arranging Shoes (IOI19_shoes) C++14
85 / 100
 1000 ms 38776 KB 
#include "shoes.h"
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
long long count_inversions(int n, vector<int> a, vector<int> b) {
	map<int, int> da, db;
	vector<int> aprecnt(n);
	for(int i = 0; i < n; ++i) {
		aprecnt[i] = da[a[i]]++;
	}
	map<pair<int, int>, int> dats;
	for(int i = 0; i < n; ++i) {
		dats[make_pair(a[i], aprecnt[i])] = i;
	}
	vector<int> perm(n);
	for(int i = 0; i < n; ++i) {
		int bprecnt = db[b[i]]++;
		perm[i] = dats[make_pair(b[i], bprecnt)];
	}
	vector<int> bit(n + 1);
	vector<int> iperm(n);
	for(int i = 0; i < n; ++i) {
		iperm[perm[i]] = i;
	}
	long long ans = 0;
	for(int i = n - 1; i >= 0; --i) {
		int pos = iperm[i];
		for(int j = pos; j >= 1; j -= j & (-j)) {
			ans += bit[j];
		}
		for(int j = pos + 1; j <= n; j += j & (-j)) {
			++bit[j];
		}
	}
	return ans;
}
long long count_swaps(std::vector<int> s) {
	int N = s.size() / 2;
	bool subtask3 = true, subtask4 = true;
	for(int i = 1; i < 2 * N; ++i) {
		if(abs(s[i]) != abs(s[i - 1])) {
			subtask3 = false;
		}
	}
	for(int i = 0; i < N; ++i) {
		if(!(s[i] < 0 && s[i + N] > 0 && s[i] + s[i + N] == 0)) {
			subtask4 = false;
		}
	}
	if(subtask3) {
		vector<int> seq(2 * N);
		for(int i = 0; i < N; ++i) {
			seq[i * 2] = -abs(s[0]);
			seq[i * 2 + 1] = abs(s[0]);
		}
		long long ans = count_inversions(2 * N, seq, s);
		return ans;
	}
	else if(subtask4) {
		vector<int> seq(2 * N);
		for(int i = 0; i < N; ++i) {
			seq[i * 2] = s[i];
			seq[i * 2 + 1] = -s[i];
		}
		long long ans = count_inversions(2 * N, seq, s);
		return ans;
	}
	else {
		// subtask 1, 2, 5
		vector<int> pl, pr;
		map<int, queue<int> > que;
		for(int i = 0; i < 2 * N; ++i) {
			if(!que[-s[i]].empty()) {
				int u = que[-s[i]].front();
				que[-s[i]].pop();
				pl.push_back(s[u] < 0 ? u : i);
				pr.push_back(s[u] < 0 ? i : u);
			}
			else {
				que[s[i]].push(i);
			}
		}
		long long ans = 0;
		for(int i = 0; i < N; ++i) {
			if(pl[i] > pr[i]) {
				swap(pl[i], pr[i]);
				++ans;
			}
		}
		for(int i = 0; i < N; ++i) {
			for(int j = i + 1; j < N; ++j) {
				vector<int> g = { pl[i], pl[j], pr[i], pr[j] };
				sort(g.begin(), g.end());
				string str;
				for(int k : g) {
					str += (pl[i] == k || pr[i] == k ? '0' : '1');
				}
				if(str == "0011" || str == "1100") ans += 0;
				else if(str == "0101" || str == "1010") ans += 1;
				else ans += 2;
			}
		}
		return ans;
	}
	return -1;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 416 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 12 ms 2176 KB Output is correct
21 Correct 15 ms 2304 KB Output is correct
22 Correct 147 ms 19832 KB Output is correct
23 Correct 142 ms 19832 KB Output is correct
24 Correct 147 ms 19832 KB Output is correct
25 Correct 135 ms 19832 KB Output is correct
26 Correct 162 ms 19832 KB Output is correct
27 Correct 142 ms 19832 KB Output is correct
28 Correct 141 ms 19928 KB Output is correct
29 Correct 159 ms 19832 KB Output is correct
30 Correct 136 ms 19832 KB Output is correct
31 Correct 160 ms 19960 KB Output is correct
32 Correct 143 ms 19832 KB Output is correct
33 Correct 134 ms 19832 KB Output is correct
34 Correct 139 ms 19832 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 288 KB Output is correct
37 Correct 153 ms 19832 KB Output is correct
38 Correct 160 ms 19832 KB Output is correct
39 Correct 139 ms 19832 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 572 ms 38648 KB Output is correct
6 Correct 392 ms 21528 KB Output is correct
7 Correct 546 ms 38776 KB Output is correct
8 Correct 151 ms 19920 KB Output is correct
9 Correct 568 ms 38776 KB Output is correct
10 Correct 470 ms 29304 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 57 ms 1792 KB Output is correct
42 Correct 47 ms 1792 KB Output is correct
43 Correct 49 ms 1536 KB Output is correct
44 Correct 62 ms 1408 KB Output is correct
45 Correct 49 ms 1280 KB Output is correct
46 Correct 45 ms 1056 KB Output is correct
47 Correct 59 ms 896 KB Output is correct
48 Correct 57 ms 768 KB Output is correct
49 Correct 52 ms 672 KB Output is correct
50 Correct 54 ms 384 KB Output is correct
51 Correct 1 ms 512 KB Output is correct
52 Correct 67 ms 1792 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 1 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 1 ms 256 KB Output is correct
45 Correct 0 ms 256 KB Output is correct
46 Correct 1 ms 416 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 1 ms 512 KB Output is correct
54 Correct 12 ms 2176 KB Output is correct
55 Correct 15 ms 2304 KB Output is correct
56 Correct 147 ms 19832 KB Output is correct
57 Correct 142 ms 19832 KB Output is correct
58 Correct 147 ms 19832 KB Output is correct
59 Correct 135 ms 19832 KB Output is correct
60 Correct 162 ms 19832 KB Output is correct
61 Correct 142 ms 19832 KB Output is correct
62 Correct 141 ms 19928 KB Output is correct
63 Correct 159 ms 19832 KB Output is correct
64 Correct 136 ms 19832 KB Output is correct
65 Correct 160 ms 19960 KB Output is correct
66 Correct 143 ms 19832 KB Output is correct
67 Correct 134 ms 19832 KB Output is correct
68 Correct 139 ms 19832 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 0 ms 288 KB Output is correct
71 Correct 153 ms 19832 KB Output is correct
72 Correct 160 ms 19832 KB Output is correct
73 Correct 139 ms 19832 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 572 ms 38648 KB Output is correct
79 Correct 392 ms 21528 KB Output is correct
80 Correct 546 ms 38776 KB Output is correct
81 Correct 151 ms 19920 KB Output is correct
82 Correct 568 ms 38776 KB Output is correct
83 Correct 470 ms 29304 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 1 ms 384 KB Output is correct
86 Correct 1 ms 384 KB Output is correct
87 Correct 6 ms 640 KB Output is correct
88 Correct 57 ms 1792 KB Output is correct
89 Correct 47 ms 1792 KB Output is correct
90 Correct 49 ms 1536 KB Output is correct
91 Correct 62 ms 1408 KB Output is correct
92 Correct 49 ms 1280 KB Output is correct
93 Correct 45 ms 1056 KB Output is correct
94 Correct 59 ms 896 KB Output is correct
95 Correct 57 ms 768 KB Output is correct
96 Correct 52 ms 672 KB Output is correct
97 Correct 54 ms 384 KB Output is correct
98 Correct 1 ms 512 KB Output is correct
99 Correct 67 ms 1792 KB Output is correct
100 Correct 73 ms 1792 KB Output is correct
101 Execution timed out 1046 ms 13440 KB Time limit exceeded
102 Halted 0 ms 0 KB -