# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133216 | Marszpace | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 328 KiB |
/*
* And in that light, I find deliverance.
* TASK : IOI19 : Arranging Shoes
* AUTHOR : Marszpace
*/
#include"shoes.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll count_swaps(vector<int> s) {
ll ans=0;
multimap<int,int> prev_shoes;
for(int i=0;i<(int)s.size();i++){
if(prev_shoes.count(-s[i])==0){
prev_shoes.insert({s[i],i});
}
else{
auto it=prev_shoes.find(-s[i]);
ans+=i-(ll)(it->second);
if(it->first<0){
ans--;
}
prev_shoes.erase(it);
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |