Submission #1288840

#TimeUsernameProblemLanguageResultExecution timeMemory
1288840muhammad-mutahirArranging Shoes (IOI19_shoes)C++20
10 / 100
1 ms344 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(vector<int> s) {
	long long ans = 0;
	int n = s.size();
	map<int,int>cnt;
	for(int i = 0;i<n;i++){
		cnt[abs(s[i])]++;
		if(cnt[abs(s[i])]%2 == 0){
			// int x = i;
			while(i-1>=0 and abs(s[i-1]) != abs(s[i])){
				swap(s[i],s[i-1]);
				i--;
				ans++;
			}
			
			if(i-1>=0 and s[i]<s[i-1]){
				swap(s[i],s[i-1]);
				ans++;
			}
		}
	}
	// print(s);
	return ans;
}

// int main(){
	// cout<<count_swaps({-1,1,-1,1})<<endl;
// }
#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...