Submission #694856

#TimeUsernameProblemLanguageResultExecution timeMemory
694856allin27xArranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms212 KiB
#include <iostream>
#include <vector>
using namespace std;
 
long long count_swaps(vector<int> S){
    long long res = 0;
    int n = S.size();
    vector<int> s(n,0);
    vector<bool> ac(n,1);
    for (int i=0; i<n; i++){
        if (!ac[i]) continue;
        for (int j=i+1; j<n; j++){
            if (!ac[j] || S[j]!=(-S[i])) continue;
            ac[j] = 0;
            ac[i] = 0;
            if (S[i]<0) res+=j-i-1; else res+=j-i; break;
        }
    }
    return res;
}
#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...