Submission #737097

#TimeUsernameProblemLanguageResultExecution timeMemory
737097NeroZeinArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms212 KiB
#include "shoes.h"
#include <bits/stdc++.h> 
using namespace std; 

long long count_swaps(std::vector<int> s) {
	int n = (int) s.size(); 
	vector<int> v[2]; 
	long long ans = 0; 
	for (int i = 0; i < n; ++i) {
		bool neg = s[i] < 0; 
		if (neg) s[i] = -s[i];
		s[i]--; 
		if (neg) {
			if (v[0].size()) {
				ans += i - v[0].back(); 
				v[0].pop_back(); 
			} else {
				v[1].push_back(i); 
			}
		} else {
			if (v[1].size()) {
				ans += i - v[1].back() - 1; 
				v[1].pop_back(); 
			} else {
				v[0].push_back(i); 
			}
		}
	}
	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...