# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
618214 | serize | Arranging Shoes (IOI19_shoes) | C++17 | 33 ms | 1876 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>
#include <cstdio>
#include <cassert>
using namespace std;
typedef long long ll;
long long count_swaps(std::vector<int> s) {
int n = s.size();
if(n == 2){
if(s[0] < 0 and s[1] > 0) return 0;
else return 1LL;
}
else{
int ans = 0, pos = -2;
for(int i = 0; i < n; i++){
if(s[i] < 0){
pos += 2;
ans += (abs(i-pos));
}
}
int ret = 0;
pos = n;
for(int i = n-1; i >= 0; i--){
if(s[i] < 0){
pos -= 2;
ret += abs(i-pos);
}
# | 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... |