Submission #305985

#	Time	Username	Problem	Language	Result	Execution time	Memory
305985		amunduzbaev	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1098 ms	1920 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>


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;
        int q=(a[j]<0 ? 1:0);
        while(l>i-q){
            swap(a[l],a[l+1]);
            ns++;
            l--;
        }
        
    }
    
	return ns;
}

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