Submission #1358367

#TimeUsernameProblemLanguageResultExecution timeMemory
1358367alexiahArranging Shoes (IOI19_shoes)C++20
10 / 100
1095 ms344 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;

long long count_swaps(vector<int> s) {
	ll tn = s.size() , ans = 0;
    while(!s.empty()){
        int act = -1;
        for(ll i = 0; i < tn; i++){
            if(s[0] == -s[i]){
                act = i; break;
            }
        }
        if(s[0] < 0) ans += act - 1;
        else ans += act;
        vi ns;
        for(ll i = 1; i < tn; i++){
            if(i != act) ns.push_back(s[i]);
        }
        s = ns;
    }
    return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...