oj.uz

Submission #285705

# Submission time Handle Problem Language Result Execution time Memory
285705 2020-08-29T13:24:39 Z williamMBDK Arranging Shoes (IOI19_shoes) C++14
45 / 100
 324 ms 25464 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(vector<signed> s) {
	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; i++){
		if(s[i] < 0){
			res += bit.q(i + 1);
			if(i < N - 1) bit.u(i + 2, -1);
			
			int idx = mp[s[i] * -1].second[mp[s[i] * -1].first++];
			res += bit.q(idx + 1);
			if(idx < N - 1) bit.u(idx + 2,-1);
		}
	}
	return res;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 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 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 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 0 ms 256 KB Output is correct
12 Correct 1 ms 384 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 384 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 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 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 384 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 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 5 ms 1024 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 50 ms 6508 KB Output is correct
23 Correct 47 ms 6508 KB Output is correct
24 Correct 48 ms 6416 KB Output is correct
25 Correct 42 ms 6900 KB Output is correct
26 Correct 49 ms 6516 KB Output is correct
27 Correct 42 ms 6372 KB Output is correct
28 Correct 45 ms 7024 KB Output is correct
29 Correct 44 ms 7024 KB Output is correct
30 Correct 47 ms 7020 KB Output is correct
31 Correct 53 ms 6400 KB Output is correct
32 Correct 45 ms 7020 KB Output is correct
33 Correct 43 ms 6892 KB Output is correct
34 Correct 46 ms 7020 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 44 ms 7028 KB Output is correct
38 Correct 45 ms 7024 KB Output is correct
39 Correct 45 ms 7020 KB Output is correct

Subtask #4
15.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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 324 ms 25464 KB Output is correct
6 Correct 120 ms 7416 KB Output is correct
7 Correct 279 ms 25336 KB Output is correct
8 Correct 48 ms 5680 KB Output is correct
9 Correct 271 ms 25336 KB Output is correct
10 Correct 196 ms 14840 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 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 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 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 0 ms 256 KB Output is correct
12 Correct 1 ms 384 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 384 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 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 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 0 ms 256 KB Output is correct
12 Correct 1 ms 384 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 -