제출 #1236415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236415		mariza	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	1096 ms	4932 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define MID ((l+r)/2)
const ll INF=1e18;

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

    pair<ll,ll> x[2*n];
    for(ll i=0; i<2*n; i++){
        x[i]={i,s[i]};
    }

    ll ans=INF;
    do{
        bool ok=1;
        for(ll i=0; i<2*n; i+=2){
            if(x[i].second>0 || x[i+1].second<0 || abs(x[i].second)!=abs(x[i+1].second)){
                ok=0;
                break;
            }
        }
        if(!ok) continue;

        ll y=0;
        for(ll i=0; i<2*n; i++){
            for(ll j=0; j<i; j++){
                if(x[j].first>x[i].first) y++;
            }
        }
        ans=min(ans,y);
    } while(next_permutation(x,x+2*n));
    
    return ans;
}

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