oj.uz

Submission #285721

# Submission time Handle Problem Language Result Execution time Memory
285721 2020-08-29T13:54:10 Z williamMBDK Arranging Shoes (IOI19_shoes) C++14
45 / 100
 289 ms 29548 KB 
#include<bits/stdc++.h>
#define int long long
#include "shoes.h"
using namespace std;
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) {
	int N = s.size();
	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 count_swaps(vector<signed> s){
	int N = s.size();
	vector<int> indices;
	for(int i = 0; i < N; i++){
		if(s[i] < 0) indices.push_back(i);
	}
	vector<int> temp (N / 2);
	for(int i = 0; i < N / 2; i++) temp[i] = i; 
	return count_swaps_perm(s, indices, temp);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 1 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 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 1 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 1 ms 256 KB Output is correct
6 Correct 1 ms 288 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 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 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 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 7 ms 1408 KB Output is correct
21 Correct 5 ms 1408 KB Output is correct
22 Correct 65 ms 10220 KB Output is correct
23 Correct 55 ms 9836 KB Output is correct
24 Correct 52 ms 9836 KB Output is correct
25 Correct 44 ms 9836 KB Output is correct
26 Correct 51 ms 9836 KB Output is correct
27 Correct 49 ms 9836 KB Output is correct
28 Correct 47 ms 9836 KB Output is correct
29 Correct 49 ms 9816 KB Output is correct
30 Correct 51 ms 9836 KB Output is correct
31 Correct 52 ms 10096 KB Output is correct
32 Correct 50 ms 9836 KB Output is correct
33 Correct 52 ms 9836 KB Output is correct
34 Correct 50 ms 9836 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 47 ms 9836 KB Output is correct
38 Correct 47 ms 9836 KB Output is correct
39 Correct 49 ms 9964 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 289 ms 29548 KB Output is correct
6 Correct 123 ms 11500 KB Output is correct
7 Correct 281 ms 29548 KB Output is correct
8 Correct 49 ms 9964 KB Output is correct
9 Correct 279 ms 29396 KB Output is correct
10 Correct 219 ms 19052 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 1 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 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 1 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 1 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 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 1 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -