# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626540 | Trunkty | Arranging Shoes (IOI19_shoes) | C++14 | 74 ms | 69708 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
#include "shoes.h"
ll ans,cnt;
deque<int> shoes[100005];
ll count_swaps(vector<int> s){
for(ll i=0;i<s.size();i++){
if(s[i]<0){
cnt++;
shoes[-s[i]].push_back(cnt);
ans += abs(cnt*2LL-1LL-(i+1LL));
}
}
cnt = 0;
for(ll i=0;i<s.size();i++){
if(s[i]>0){
cnt++;
int x = shoes[s[i]].front();
shoes[s[i]].pop_front();
ans += max(0LL,cnt-x);
}
}
return ans;
}
Compilation message (stderr)
# | 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... |