제출 #713725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713725		europium	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1091 ms	3156 KiB

shoes

#include "shoes.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include<iterator>
#include <set>
#include <map>
#include <math.h>
#include <iomanip>
#include <unordered_set>
using namespace std;

using ll = long long;

ll count_swaps(vector<int> a) {
	ll n = a.size();
	ll ans = 0;

	vector<bool> used(n);

	for (ll i = 0; i < n; i++){
		if (used[i]) continue;

		ll j = i + 1;
		ll val = 0;

		while (a[j] != -a[i] || used[j]){
			if (!used[j]) val++;
			j++;
		}

		if (a[i] > 0) ans += val + 1;
		else ans += val;

		used[i] = true;
		used[j] = true;
	}

	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