제출 #431509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
431509		LouayFarah	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1080 ms	26808 KiB

shoes

#include "bits/stdc++.h"
#include "shoes.h"
using namespace std;
 
#define ll long long

bool check(vector<int> &s, int len)
{
    for(int j = 0; j<len-1; j+=2)
    {
        if(s[j]+s[j+1]!=0)
            return false;
        else if(s[j]+s[j+1]==0&&s[j]>s[j+1])
            return false;
    }

    return true;
}

ll solve(int last, vector<int> &s, int len, ll curr)
{
    if(check(s, len))
        return curr;

    if(last==len)
        return 1e18;

    ll res1 = 1e18;
    ll res2 = 1e18;
    ll res3 = 1e18;

    for(int i = last; i<len; i++)
    {
        res1 = min(res1, solve(last+1, s, len, curr));
        /*if(i<len-1)
        {
            swap(s[i], s[i+1]);
            res2 = min(res2, solve(last+1, s, len, curr+1));
            swap(s[i], s[i+1]);
        }*/
        if(i>0)
        {
            swap(s[i], s[i-1]);
            res3 = min(res3, solve(last+1, s, len, curr+1));
            swap(s[i], s[i-1]);
        }
    }

    return min(min(res1, res2), res3);
}

ll count_swaps(vector<int> s)
{
    int n = (int)s.size()/2;
    ll res = solve(0, s, 2*n, 0);
    return res;
}

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