Submission #1311343

#TimeUsernameProblemLanguageResultExecution timeMemory
1311343nataliaaArranging Shoes (IOI19_shoes)C++20
10 / 100
1097 ms1960 KiB
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
    long long ans = 0;
    int n = s.size()/2;
    for(int i = 0; i < n; i++){
        for(int j = 2*i; j < 2*n; j++) {
            if(s[j]<0) {
                for(int k = j; k>i; k--) swap(s[k], s[k-1]);
                ans+=j-2*i;
                break;
            }
        }
        for(int j = 2*i+1; j < 2*n; j++) {
            if(s[j]>0) {
                for(int k = j; k>i+1; k--) swap(s[k], s[k-1]);
                ans+=j-2*i-1;
                break;
            }
        }
    }
    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...