Submission #618214

#TimeUsernameProblemLanguageResultExecution timeMemory
618214serizeArranging Shoes (IOI19_shoes)C++17
10 / 100
33 ms1876 KiB
#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);
            }
        }
        return min(ret,ans);
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...