Submission #1358373

#TimeUsernameProblemLanguageResultExecution timeMemory
1358373alexiahArranging Shoes (IOI19_shoes)C++20
10 / 100
1096 ms3788 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;

long long count_swaps(vector<int> s) {
	ll ans = 0;
	while(!s.empty()){
		ll act = -1 , tn = s.size();
		for(ll i = 1; i < tn; i++){
			if(abs(s[0]) == abs(s[i])){
				act = i; break;
			}
		}
		if(s[0] > 0) ans += act;
		else ans += act-1;
		vi ns;
		for(ll i = 1; i < tn; i++){
			if(i != act) ns.push_back(s[i]);
		}
		s = ns;
	}
    return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...