oj.uz

Submission #954836

# Submission time Handle Problem Language Result Execution time Memory
954836 2024-03-28T16:48:46 Z Acanikolic Arranging Shoes (IOI19_shoes) C++14
10 / 100
 25 ms 15840 KB 
#include <bits/stdc++.h>
		 				 
#define pb push_back 
		
#define F first
		 
#define S second
		 
using namespace std;
		 
const int N = 1e5 + 10;
		 
const int mod = 1e9 + 7; 
 
const int inf = 1e9;
 
long long fenw[N];
vector<int>p(N);
vector<int>g[N][2];//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]][0].pb(i + 1);
		else g[a[i]][1].pb(i + 1);
	}
	int index = 1;
	for(int i = 1; i <= n; i++) {
		for(int j = 0; j < (int)g[i][0].size(); j++) {
			p[g[i][0][j]] = index++;
			p[g[i][1][j]] = index++;
		}
	}
	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 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5468 KB Output is correct
4 Correct 2 ms 5468 KB Output is correct
5 Incorrect 2 ms 5468 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5464 KB Output is correct
4 Correct 2 ms 5468 KB Output is correct
5 Correct 2 ms 5380 KB Output is correct
6 Correct 1 ms 5468 KB Output is correct
7 Correct 2 ms 5468 KB Output is correct
8 Correct 1 ms 5468 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 1 ms 5468 KB Output is correct
11 Correct 1 ms 5468 KB Output is correct
12 Correct 2 ms 5468 KB Output is correct
13 Correct 2 ms 5468 KB Output is correct
14 Correct 1 ms 5464 KB Output is correct
15 Correct 2 ms 5464 KB Output is correct
16 Correct 2 ms 5468 KB Output is correct
17 Correct 1 ms 5468 KB Output is correct
18 Correct 2 ms 5468 KB Output is correct
19 Correct 2 ms 5516 KB Output is correct
20 Correct 4 ms 5980 KB Output is correct
21 Correct 4 ms 5980 KB Output is correct
22 Runtime error 25 ms 15840 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5468 KB Output is correct
2 Correct 2 ms 5468 KB Output is correct
3 Incorrect 1 ms 5472 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5468 KB Output is correct
4 Correct 2 ms 5468 KB Output is correct
5 Incorrect 2 ms 5468 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5468 KB Output is correct
4 Correct 2 ms 5468 KB Output is correct
5 Incorrect 2 ms 5468 KB Output isn't correct
6 Halted 0 ms 0 KB -