Submission #1141137

#TimeUsernameProblemLanguageResultExecution timeMemory
1141137altern23Arranging Shoes (IOI19_shoes)C++20
10 / 100
1 ms328 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

long long count_swaps(vector<int> s) {
	ll n = s.size();
	vector<pair<ll, ll>> isi[n + 5];
	for(int i = 0; i < n; i++){
		isi[abs(s[i])].push_back({i, s[i]});
	}	
	ll ans = 0;
	for(ll i = 1; i <= n; i++){
		deque<ll> pos, neg;
		for(auto [idx, val] : isi[i]){
			// kalau - ketemu +
			if(val < 0){
				if(!pos.empty()){
					ans += idx - pos.front();
					pos.pop_front();
				}
				else{
					neg.push_back(idx);
				}
			}
			else{
				if(!neg.empty()){
					ans += idx - neg.front() - 1;
					neg.pop_front();
				}
				else{
					pos.push_back(idx);
				}
			}
		}
	}

	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...