제출 #305981

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

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> a) {
	int n = a.size()/2;
	long long ans = 0;
	
	int tmp = min(-a[0], a[0]);
	bool ch = true;
	for(int i=0;i<n;i++)if(a[i] != tmp)ch = false;
	for(int i=n;i<n*2;i++)if(a[i] != -tmp)ch = false;
	if(ch == true){
		ans = (long long)n*(n-1ll)/2ll;
		return ans;
	}
	for(int i=0;i<n;i++){
		if(a[i*2]+a[i*2+1] == 0){
			if(a[i*2] > 0){
				ans ++;
				swap(a[i*2], a[i*2+1]);
			}
			continue;
		}
		int j;
		for(j=i*2+1; j < n*2; j++){
			if(a[j] == -a[i*2]){ // found
				break;
			}
		}
		if(a[i*2] < 0){
			while(j-1 > i*2){
				j--;
				swap(a[j], a[j+1]);
				ans ++ ;
			}
		}else {
			while(j-1 >= i*2){
				j--;
				swap(a[j], a[j+1]);
				ans ++ ;
			}
		}
	}
	return ans;
}

/*

3
-2 2 2 -2 -2 2

2 
2 1 -1 -2

*/

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