Submission #305982

#TimeUsernameProblemLanguageResultExecution timeMemory
305982amunduzbaevArranging Shoes (IOI19_shoes)C++14
10 / 100
1087 ms1912 KiB
#include "shoes.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;

long long count_swaps(vector<int> a) {
    int n=a.size()/2;

    long long ns=0;
    for(int i=0;i<n;i++){
        if(a[i*2]+a[i*2+1]==0){
            if(a[i*2]>a[i*2+1]){
                swap(a[i*2],a[i*2+1]);
                ns++;
            }
            continue;
        }
        int j;
        for(j=2*i+1;j<2*n;j++){
            if(a[j]+a[i*2]==0)
                break;
        }
        int l=j-1;
        while(l>i){
            swap(a[l],a[l+1]);
            ns++;
            l--;
        }
        if(a[i]>0){
            swap(a[i],a[i+1]);
            ns++;
        }


    }
    
	return ns;
}
#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...