제출 #1324841

#제출 시각아이디문제언어결과실행 시간메모리
1324841fahmid_rngArranging Shoes (IOI19_shoes)C++20
25 / 100
31 ms6556 KiB
#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;
using ll=long long;
long long count_swaps(std::vector<int> s) {
	ll ans=0;
	set<int> pos;
	for(int i=0;i<s.size();++i){if(s[i]<0) pos.insert(i);}
	for(int i=0;i<s.size();i+=2){
		auto low=pos.lower_bound(i);
		if(low==pos.begin()){
			ans+=(*low-i);
			pos.erase(low);
			continue;
		}
		auto up=low--;
		if(up==pos.end()||i-*low<*up-i){
			ans+=(i-*low);
			pos.erase(low);
			continue;
		}
		ans+=*up-i;
		pos.erase(up);
	}
	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...