제출 #305977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
305977		amunduzbaev	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	1 ms	256 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 r=a[j];
        a.erase(a.begin()+j);
        if(r<0)
        a.insert(a.begin()+(i*2),r);
        else
        a.insert(a.begin()+(i*2)+1,r);

        ns+=j-(2*i);

    }
    for(int i=0;i<n;i++){
        cout<<a[i*2]<<" "<<a[i*2+1]<<" ";
    }
cout<<"\n";
	return ns;
}

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