oj.uz

Submission #955141

# Submission time Handle Problem Language Result Execution time Memory
955141 2024-03-29T13:13:30 Z Acanikolic Arranging Shoes (IOI19_shoes) C++14
45 / 100
 31 ms 13400 KB 
#include <bits/stdc++.h>
		 				 
#define pb push_back 
		
#define F first
		 
#define S second
		 
using namespace std;
		 
const int N = 2e5 + 10;
		 
const int mod = 1e9 + 7; 
 
const int inf = 1e9;
 
long long fenw[N];
vector<int>p(N);
vector<int>g[N];//0 neg 1 pos
 
void add(int index,int n,int val) {
	while(index <= n) {
		fenw[index] += val;
		index += index & -index;
	}
}
 
long long get(int index) {
	long long ret = 0;
	while(index >= 1) {
		ret += fenw[index];
		index -= index & -index;
	}
	return ret;
}
 
long long count_swaps(vector<int>a) {
	int n = a.size();
	for(int i = 0; i < n; i++) {
		if(a[i] > 0) g[a[i]].pb(i + 1);
	}
	int index = 1;
	for(int i = 1; i <= n; i++)  reverse(g[i].begin(),g[i].end());
	for(int i = 0; i < n; i++) {
		if(a[i] < 0) {
			p[i + 1] = index++;
			p[g[-a[i]].back()] = index++;
			g[-a[i]].pop_back();
		}
	}
	long long res = 0;
	for(int i = 1; i <= n; i++) {
		res += get(n) - get(p[i]);
		add(p[i],n,1);
	}
	return res;
}
 		 	 		 
/*signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	
	int n;
	cin >> n;
	vector<int>a(n);
	for(int i = 0; i < n; i++) cin >> a[i];
	cout << count_swaps(a);
    return 0; 
}*/

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 2 ms 5724 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 2 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Incorrect 2 ms 5724 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 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 1 ms 5724 KB Output is correct
4 Correct 2 ms 5976 KB Output is correct
5 Correct 2 ms 5796 KB Output is correct
6 Correct 1 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 1 ms 5724 KB Output is correct
9 Correct 2 ms 5724 KB Output is correct
10 Correct 2 ms 5724 KB Output is correct
11 Correct 2 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Correct 2 ms 5880 KB Output is correct
15 Correct 2 ms 5720 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 2 ms 5724 KB Output is correct
18 Correct 2 ms 5724 KB Output is correct
19 Correct 2 ms 5724 KB Output is correct
20 Correct 4 ms 6236 KB Output is correct
21 Correct 4 ms 6236 KB Output is correct
22 Correct 27 ms 9544 KB Output is correct
23 Correct 25 ms 10708 KB Output is correct
24 Correct 28 ms 10700 KB Output is correct
25 Correct 24 ms 10452 KB Output is correct
26 Correct 29 ms 10704 KB Output is correct
27 Correct 24 ms 10444 KB Output is correct
28 Correct 25 ms 10708 KB Output is correct
29 Correct 27 ms 10788 KB Output is correct
30 Correct 24 ms 10700 KB Output is correct
31 Correct 27 ms 10816 KB Output is correct
32 Correct 25 ms 10704 KB Output is correct
33 Correct 24 ms 10448 KB Output is correct
34 Correct 25 ms 10708 KB Output is correct
35 Correct 2 ms 5724 KB Output is correct
36 Correct 2 ms 5724 KB Output is correct
37 Correct 24 ms 10700 KB Output is correct
38 Correct 24 ms 10704 KB Output is correct
39 Correct 25 ms 10708 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 1 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 30 ms 12164 KB Output is correct
6 Correct 27 ms 10844 KB Output is correct
7 Correct 30 ms 13368 KB Output is correct
8 Correct 27 ms 10860 KB Output is correct
9 Correct 31 ms 13400 KB Output is correct
10 Correct 30 ms 11856 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 2 ms 5724 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 2 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Incorrect 2 ms 5724 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 2 ms 5724 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 2 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Incorrect 2 ms 5724 KB Output isn't correct
15 Halted 0 ms 0 KB -