# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573039 | sff_user | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 468 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>
#define vi vector<int>
#define ll long long
using namespace std;
ll count_swaps(vector<int> s){
int n = s.size() / 2;
ll ans = 0;
int l,r;
for(int i = 0 ; i < 2*n ; i++){
if(s[i]<0){
l=i;
break;
}
}
for(int i = 0 ;i < 2*n ; i++){
if(s[i]>0){
r=i;
break;
}
}
for(int i = 0 ; i < 2* n ; i++){
if(s[i] < 0){
ans += r-l-1;
}
else{
ans += l-r;
}
s.erase(s.begin() + s[max(l,r)]);
for(int j = l+1 ; j < 2*n;j++){
if(s[j]<0){
l=j;
break;
}
}
for(int j = r+1 ; j < 2*n;j++){
if(s[j]>0){
r=j;
break;
}
}
}
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... |