Submission #540206

#TimeUsernameProblemLanguageResultExecution timeMemory
540206beaconmcArranging Shoes (IOI19_shoes)C++14
0 / 100
0 ms212 KiB
#include <bits/stdc++.h>

typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
using namespace std;

long long count_swaps(vector<int> S) {
    ll n = S.size();
    ll cur = 0;
    ll ans = 0;
    FOR(i,0,n){
        if (S[i] < 0){
            cur += 2;
            ans += abs(i-cur);
        }
    }
    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...