제출 #779563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
779563		Minindu206	Arranging Shoes (IOI19_shoes)	C++14	65 / 100	1064 ms	2836 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll count_swaps(vector<int> s)
{
	ll n = s.size() / 2;
    if(n == 1)
        return s[0] > 0;
    int iseq = 1;
    for(int i=0;i<n;i++)
        if(s[i] + s[i + n] != 0 || s[i] > 0)
        {
            iseq = 0;
            break;
        }
    if(iseq)
        return n * (n - 1) / 2;
    int cur = 0;
    ll ans = 0LL;
    while(cur < 2 * n)
    {
        int val = s[cur];
        if(val < 0)
        {
            int i = cur + 1;
            while(s[i] != -val)
                i++;
            s.erase(s.begin() + i);
            s.insert(s.begin() + cur + 1, -val);
            ans += (i - cur - 1);
        }
        else
        {
            int i = cur + 1;
            while(s[i] != -val)
                i++;
            s.erase(s.begin() + i);
            s.insert(s.begin() + cur, -val);
            ans += (i - cur);
        }
        cur += 2;
    }
    return ans;
}

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