Submission #399185

#TimeUsernameProblemLanguageResultExecution timeMemory
399185snasibov05Arranging Shoes (IOI19_shoes)C++14
50 / 100
1095 ms3116 KiB
#include "shoes.h"

using namespace std;

long long count_swaps(vector<int> s) {

    int n = s.size();
    long long ans = 0;

    for (int i = 0; i < n; i += 2) {
        if (s[i] == -s[i+1]){
            if (s[i] > 0) ans++;
            continue;
        }
        
        int k = i+1;
        while (s[k] != -s[i]) k++;

        for (int j = k-1; j > i; --j) {
            swap(s[j], s[j+1]);
            ans++;
        }
        
        if (s[i] > 0) ans++;
    }
    
    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...