Submission #670610

#TimeUsernameProblemLanguageResultExecution timeMemory
670610birthdaycakeArranging Shoes (IOI19_shoes)C++17
50 / 100
18 ms3540 KiB
#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;
 
int vs[2001];
long long count_swaps(vector<int>s) {
    
    long long n = s.size(); long long ans = 0;
    for(int i = 0; i < n; i++) vs[i] = 0;
    for(long long i = 0; i < n; i++){
        long long f = 0;
        for(long long j = 0; j < i; j++){
            if(!vs[j] && s[i] == -s[j]){
                f = j + 1;
                break;
            }
        }
        if(f){
            f--;
            long long j = i;
            while(j != f + 1){
                swap(vs[j], vs[j - 1]);
                swap(s[j], s[j - 1]);
                j--;
                ans++;
            }
            if(s[f] > 0) {
                swap(s[f], s[f + 1]);
                ans++;
            }
            vs[f] = vs[f + 1] = 1;

        }
        
    }
    
    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...