제출 #713439

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713439		europium	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	26 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;

// subtask 4 - 15 points
// ll count_swaps(vector<int> s) {
// 	ll n = s.size() / 2;
// 	return n * (n - 1) / 2;
// }

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

	for (ll i = 0; i < n; i++){
		if (a[i] < 0){
			ans += abs(i - closest);
			closest +=2 ;
		}
	}

	return ans;
}

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