Submission #1225328

#TimeUsernameProblemLanguageResultExecution timeMemory
1225328edga1Arranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace::std;

long long count_swaps(vector<int> s) {
    int n=s.size()/2;
	map<int,vector<int>> pp,np;
	for(int i=0; i<2*n; i++){
        if(s[i]>0){
            pp[s[i]].push_back(i);
        }
        else{
            np[abs(s[i])].push_back(i);
        }
	}
	long long rez=0;
	for(auto po : pp){
        vector<int> pv=po.second, nv=np[po.first];
        for(int i=0; i<pv.size(); i++){
            rez+=abs(pv[i]-nv[i])-1;
            if(pv[i]<nv[i]) rez++;
        }
	}
	return rez;
}
#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...