제출 #708010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708010		MODDI	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1 ms	300 KiB

shoes

//#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second;
using namespace std;
long long count_swaps(std::vector<int> s) {
	ll ans = 0;
	vi arr = s;
	int n = s.size();
	for(int i = 0; i < n; i+=2){
		int target = arr[i] * -1;
		int j = i + 1;
		if(arr[i] * -1 == arr[i+1]){
			if(arr[i] < 0)	continue;
			else{
				ans++;
				continue;
			}
		}
		while(j < n && arr[i] != target)
		{
			j++;
		}
		for(int at = j; at > i+1; at--){
			swap(arr[at], arr[at-1]);
			ans++;
		}
		if(target > 0){
			ans++;
		}
	}
	return ans;
}

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