Submission #424761

#	Time	Username	Problem	Language	Result	Execution time	Memory
424761		alireza_kaviani	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1091 ms	6568 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN = 2e5 + 10;

int n;
vector<int> pos[MAXN];

ll count_swaps(vector<int> s) {
	n = s.size() / 2; ll ans = 0;
	for(int i = 0 ; i < n * 2 ; i += 2){
		int p = -1;
		for(int j = i ; j < n * 2 ; j++){
			if(s[i] + s[j] == 0){
				p = j;
				break;
			}
		}
		for(int j = p ; j > i + 1 ; j--){
			swap(s[j] , s[j - 1]);
			ans++;
		}
		if(s[i] > 0)	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