Submission #532206

#TimeUsernameProblemLanguageResultExecution timeMemory
532206ohohorzArranging Shoes (IOI19_shoes)C++14
10 / 100
1089 ms1864 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

long long count_swaps(std::vector<int> s) {
	ll n = s.size()/2;
	ll ans = 0;
	for(int i = 0;i < (2 * n);i+=2){
		int idx = -1;
		for(int j = i;j < (2*n);j++){
			if(s[j] < 0){
				idx = j;
				break;
			}
		}

		while(idx > i){
			swap(s[idx], s[idx - 1]);
			idx --;
			ans ++;
		}
		idx = -1;
		for(int j = i;j < (2*n);j++){
			if(s[j] > 0 and abs(s[j]) == abs(s[i])){
				idx = j;
				break;
			}
		}
		while(idx > i+1){
			swap(s[idx], s[idx - 1]);
			idx --;
			ans ++;
		}

	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...