Submission #559346

#	Time	Username	Problem	Language	Result	Execution time	Memory
559346		LastRonin	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1090 ms	10392 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;

const ll N = 2e5;

ll n;
vector<ll> st, ex[N];

long long count_swaps(vector<int> s) {
	n = s.size();
	ll pos = 0;
	for(auto u : s) {
		if(u < 0) {
			st.pb(pos++);
		}
		else {
			ex[u].pb(pos++);
		}
	}
	for(int j = 1; j <= n; j++) {
		reverse(ex[j].begin(), ex[j].end());
	}
	ll ans = 0;
	for(int j = 0; j < n; j += 2) {
		ll z = -1;
		for(int i = j; i < n; i++) {
			if(s[i] < 0) {
				z = i;
				break;
			}
		}
		for(int i = z; i > j; i--)
			swap(s[i], s[i - 1]), ans++;
		z = -1;
		for(int i = j + 1; i < n; i++) {
			if(s[i] == -s[j]) {
				z = i;				
				break;
			}
		}
		for(int i = z; i > j + 1; i--) 
			swap(s[i], s[i - 1]), ans++;
	}
	return ans;
}
/*
int main() {
	int n;
	vector<int> s;
	cin >> n;
	for(int i = 0; i < n; i++) {
		s.pb(0);
		cin >> s.back();
	}
	cout << count_swaps(s);	
}
*/

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