Submission #201546

#	Time	Username	Problem	Language	Result	Execution time	Memory
201546		s_avila_g	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	5 ms	376 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;

long long count_swaps(std::vector<int> s) {
    bool der = false;
    int ans = 0;
    int n = s.size();
    for(int i = 0 ; i < n; i++){
        der = false;
        if(s[i] >  0)  der = true;
        int pos = INT_MAX;
        int m = s.size();
        for(int j = i+1; j < m; j++){
            if(abs(s[i]) == abs(s[j])){
                pos = j;
                s.erase(s.begin() + j);
                break;
            }
        }
        //cout<<i<<" "<<pos<<endl;
        if(pos == INT_MAX) continue;
        if(der && pos == i+1){
            ans += 1;
            continue;
        }
        if(pos == i  + 1 && !der){
            i += 2;
            continue;
        }
        if(der) ans += abs(i - pos);
        else ans += abs(i - pos) - 1;
    }
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15