oj.uz

Submission #285728

# Submission time Handle Problem Language Result Execution time Memory
285728 2020-08-29T14:02:41 Z williamMBDK Arranging Shoes (IOI19_shoes) C++14
30 / 100
 1000 ms 8300 KB 
#include<bits/stdc++.h>
#define int long long
#include "shoes.h"
using namespace std;
int N;
struct BIT{
	int N;
	vector<int> arr;
	BIT(int N){
		this->N = N;
		arr = vector<int> (N);
	}
	int q(int idx){
		int s = 0;
		while(idx > 0){
			s += arr[idx];
			idx -= (idx & (-idx));
		}
		return s;
	}
	void u(int idx, int val){
		while(idx < N){
			arr[idx] += val;
			idx += (idx & (-idx));
		}
	}
	
};
int count_swaps_perm(vector<signed>& s, vector<int>& indices, vector<int>& perm) {
	BIT bit (N + 1);
	map<int,pair<int,vector<int>>> mp;
	for(int i = 0; i < N; i++){
		mp[s[i]].second.push_back(i);
		bit.u(i + 1, i);
		if(i < N - 1) bit.u(i + 2, -i);
	}
	int res = 0;
	for(int i = 0; i < N / 2; i++){
		int idx1 = indices[perm[i]];
		res += bit.q(idx1 + 1);
		if(idx1 < N - 1) bit.u(idx1 + 2, -1);
		int idx2 = mp[s[idx1] * -1].second[mp[s[idx1] * -1].first++];
		res += bit.q(idx2 + 1);
		if(idx2 < N - 1) bit.u(idx2 + 2,-1);
	}
	return res;
}

int rec(vector<signed>& s, vector<int>& indices, vector<int>& perm, vector<bool>& used, int idx){
	if(idx == N / 2){
		return count_swaps_perm(s, indices, perm);
	}
	int res = LLONG_MAX;
	for(int i = 0; i < N / 2; i++){
		if(used[i]) continue;
		perm[idx] = i;
		used[i] = 1;
		res = min(res, rec(s, indices, perm, used, idx + 1));
		used[i] = 0;
		perm[idx] = -1;
	}
	return res;
}

int count_swaps_brute(vector<signed> s, vector<int> indices){
	vector<bool> used (N / 2);
	vector<int> perm (N / 2);
	return rec(s, indices, perm, used, 0); 
}
int count_swaps_fast(vector<signed> s, vector<int> indices){
	vector<int> temp (N / 2);
	for(int i = 0; i < N / 2; i++) temp[i] = i; 
	return count_swaps_perm(s, indices, temp);
}
int count_swaps(vector<signed> s){
	N = s.size();
	vector<int> indices;
	for(int i = 0; i < N; i++){
		if(s[i] < 0) indices.push_back(i);
	}
	return count_swaps_brute(s, indices);
}

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 1 ms 256 KB Output is correct
4 Correct 1 ms 416 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 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 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 0 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 12 ms 384 KB Output is correct
26 Correct 100 ms 256 KB Output is correct
27 Correct 89 ms 256 KB Output is correct
28 Correct 88 ms 256 KB Output is correct
29 Correct 46 ms 376 KB Output is correct
30 Correct 54 ms 256 KB Output is correct
31 Correct 70 ms 256 KB Output is correct
32 Correct 74 ms 360 KB Output is correct
33 Correct 80 ms 256 KB Output is correct
34 Correct 83 ms 256 KB Output is correct
35 Correct 75 ms 384 KB Output is correct
36 Correct 82 ms 256 KB Output is correct

Subtask #3
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 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 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 52 ms 360 KB Output is correct
14 Execution timed out 1084 ms 256 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Execution timed out 1043 ms 8300 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
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 1 ms 416 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 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 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 0 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 12 ms 384 KB Output is correct
26 Correct 100 ms 256 KB Output is correct
27 Correct 89 ms 256 KB Output is correct
28 Correct 88 ms 256 KB Output is correct
29 Correct 46 ms 376 KB Output is correct
30 Correct 54 ms 256 KB Output is correct
31 Correct 70 ms 256 KB Output is correct
32 Correct 74 ms 360 KB Output is correct
33 Correct 80 ms 256 KB Output is correct
34 Correct 83 ms 256 KB Output is correct
35 Correct 75 ms 384 KB Output is correct
36 Correct 82 ms 256 KB Output is correct
37 Execution timed out 1054 ms 256 KB Time limit exceeded
38 Halted 0 ms 0 KB -

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 1 ms 256 KB Output is correct
4 Correct 1 ms 416 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 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 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 0 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 12 ms 384 KB Output is correct
26 Correct 100 ms 256 KB Output is correct
27 Correct 89 ms 256 KB Output is correct
28 Correct 88 ms 256 KB Output is correct
29 Correct 46 ms 376 KB Output is correct
30 Correct 54 ms 256 KB Output is correct
31 Correct 70 ms 256 KB Output is correct
32 Correct 74 ms 360 KB Output is correct
33 Correct 80 ms 256 KB Output is correct
34 Correct 83 ms 256 KB Output is correct
35 Correct 75 ms 384 KB Output is correct
36 Correct 82 ms 256 KB Output is correct
37 Correct 0 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 0 ms 256 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 52 ms 360 KB Output is correct
48 Execution timed out 1084 ms 256 KB Time limit exceeded
49 Halted 0 ms 0 KB -