# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168291 | juggernaut | Arranging Shoes (IOI19_shoes) | C++14 | 33 ms | 4088 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;
#include "shoes.h"
long long count_swaps(vector<int>a){
int i,cnt=0;
queue<int>pos,neg;
for(i=0;i<a.size();i++)
if(a[i]<0)pos.push(i);
else neg.push(i);
for(i=0;i<a.size();i++){
if(i&1){
cnt+=max(neg.front()-i,0);
neg.pop();
}else{
cnt+=max(pos.front()-i,0);
pos.pop();
}
}
return cnt;
}
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... |