Submission #1236367

#TimeUsernameProblemLanguageResultExecution timeMemory
1236367marizaArranging Shoes (IOI19_shoes)C++20
45 / 100
15 ms1864 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

long long count_swaps(vector<int> s){
    ll n=s.size()/2;

    ll nxtl=0, nxtr=1, ans=0;
    for(ll i=0; i<2*n; i++){
        if(s[i]<0){
            ans+=max(0ll,nxtl-i);
            nxtl+=2;
        }
        else{
            ans+=max(0ll,nxtr-i);
            nxtr+=2;
        }
    }
    return ans;
}
#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...