Submission #426708

#	Time	Username	Problem	Language	Result	Execution time	Memory
426708		dreezy	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	39 ms	1868 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;
#define ll long long

//n = 1 its either 1 or 0
//n = 8 we can brutazo
//all shoes are same, we just need to get all inversion (even is left, odd is right)
//all shoes need to travel n?

//eta ~ 25 minutes

/*full solutions*/
//O(N^2) 
/*
dp[n][i]
//min swaps at position i after considering n pairs? 

*/

/*SUBTASK 1-2*/

long long count_swaps(vector<int> s) {
	
	ll ans = 0;
	int n = s.size();
	int first = 0;
	for(int i =0; i<n; i++){
		if(s[i] < 0){
			ans += abs(i - first);
			first +=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