제출 #340615

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340615		israeladewuyi	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1086 ms	3436 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define PB push_back
#define pb pop_back
#define in insert 
#define endl "\n"
const unsigned int M = 1000000007;
 
ll count_swaps(vi s){
	ll n = s.size();
	vector<ll>arr(n);
	for(int i =0; i < n; i++){
		arr[i] = s[i];
	}
	ll swaps = 0;
	for(int i = 0; i < n; i+=2){
		ll ind = -1;
		for(int  j = 0; j < n; j++){
			if(arr[j] == -arr[i]){
				ind = j;
				break;
			}
		}
		
		for(int j = ind; j > i+1; j--){
			swap(arr[j], arr[j-1]);
			swaps++;
		}
		
		if(arr[i] > 0)swaps++;
	}
	
	
	return swaps;
}
 
//int main(){
//	vi v;
//	v.PB(-2);
//	v.PB(2);
////	v.PB(2);
////	v.PB(-2);
//	cout<<count_swaps(v);
//}

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