Submission #1047256

#TimeUsernameProblemLanguageResultExecution timeMemory
1047256vjudge1Arranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms600 KiB
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back

long long count_swaps(std::vector<int> s) {
	int n = s.size() + 5;
	vector<deque<int>> pos(n + n);
	ll ans = 0;
	int m = s.size();
	// for(int i = 0; i < s.size(); ++i){
	// 	if(s[i] < 0){
	// 		if(pos[-s[i] + n].empty()){
	// 			pos[-s[i]].pb(i);
	// 		}else{
	// 			ans += i - pos[-s[i] + n].front();
	// 			pos[-s[i] + n].pop_front();
	// 		}
	// 	}else{
	// 		if(pos[s[i]].empty()){
	// 			pos[s[i] + n].pb(i);
	// 		}else{
	// 			ans += i - 1 - pos[s[i]].front();
	// 			pos[s[i]].pop_front();
	// 			// cout << ans << ' ';
	// 		}
	// 	}
	// 	cout << ans << ' ';
	// }
	for(int i = 0; i < m; i += 2){
		for(int j = i + 1; j < m; ++j){
			if(abs(s[i]) == abs(s[j])){
				for(int l = j - 1; l > i; --l){
					swap(s[l], s[l + 1]);
					++ans;
					// cout << l << ' ';
				}
				if(s[i] > s[i + 1]) swap(s[i], s[i + 1]), ++ans;
				break;
			}
		}
		// cout << '\n';
	}

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