# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423921 | Apiram | Arranging Shoes (IOI19_shoes) | C++14 | 1 ms | 204 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 "shoes.h"
#include<bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
vector<int>arr;
vector<deque<int>>adj(s.size()+1);
for (int i =0;i<s.size();++i){
if (s[i]<0){
arr.push_back(i);
}
else {
adj[s[i]].push_back(i);}
}
int64_t answer=0;
for (int i =0,j=0;i<arr.size();++i,j+=2){
answer+=arr[i]-j;
int temp =0;
if (adj[abs(s[arr[i]])][0]<arr[i]){
temp++;}
//cout<<arr[i]-j<<" "<<adj[abs(s[arr[i]])][0]-j+temp-1<<endl;
answer+=adj[abs(s[arr[i]])][0]-j+temp-1;
adj[abs(s[arr[i]])].pop_front();
}
return answer;
}
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... |