Submission #843940

#TimeUsernameProblemLanguageResultExecution timeMemory
843940Mr_HusanboyArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms436 KiB
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

template <typename T>
int len(T &a){return a.size();}

#define ll long long
long long count_swaps(vector<int> s){
	int n = len(s) / 2;
	vector<vector<vector<int>>> g(2, vector<vector<int>> (n + 1));
	for(int i = 2 * n - 1; i >= 0; i --){
		g[s[i]<0][abs(s[i])].push_back(i);
	}

	vector<int> done(2 * n);

	ll ans = 0;

	for(int i = 0; i < 2 * n; i ++){
		g[s[i] < 0][abs(s[i])].pop_back();
		if(done[i]) continue;
		ans += g[s[i] > 0][abs(s[i])].back() - i + (s[i] > 0) - 1;
		done[g[s[i] > 0][abs(s[i])].back()] = 1;
	}
	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...