Submission #1272960

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272960		arkanefury	Arranging Shoes (IOI19_shoes)	C++20	50 / 100	1094 ms	1964 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int a[N], b[N];
long long count_swaps(vector <int> v){
    int n = v.size(), k;
    long long ans = 0;
	for(int i = 0; i < n; i += 2){
		if(v[i] < 0){
		for(int j = i+1; j < n; j ++){
			if(v[j] > 0 && v[j] == abs(v[i])){
			k = j;break;
			}
		}
			for(int j = k; j > i+1; j --){
				swap(v[j], v[j-1]);
				ans ++;
			}
		}
		else{
			for(int j = i+1; j < n; j ++){
			if(v[j] < 0 && abs(v[j]) == v[i]){
			k = j;break;
			}
		}
			for(int j = k; j > i; j --){
				swap(v[j], v[j-1]);
				ans ++;
			}
		}
	}
	return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15