Submission #1334607

#TimeUsernameProblemLanguageResultExecution timeMemory
1334607ensonArranging Shoes (IOI19_shoes)C++20
10 / 100
14 ms1960 KiB
#include <bits/stdc++.h>
using namespace std;


long long count_swaps(vector<int>S){
    if (S.size() == 2){
        if (S[0] < 0) return 0;
        return 1;
    }
    int a = 0, r = 0;
    for(int i = 0; i < S.size(); i++){
        if (S[i] < 0){
            a++;
            r += abs(i - 2*(a-1));
        }
    }
    return r;
}
#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...