제출 #630669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
630669		fadyscube	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	562 ms	1048576 KiB

shoes

#include <bits/stdc++.h>

using namespace std;

#define ll long long

int getIndex(vector<int> v, int K) {
    auto it = find(v.begin(), v.end(), K);
    if (it != v.end()) return it - v.begin();
    else return -1;
}

int ans = 0;
ll count_swaps(vector<int> S) {
    if (S.size() == 2) {
        ans += (S[0] > 0) ? 1 : 0;
        return ans;
    } else if (S.size() < 2) return ans;

    int in = getIndex(S, S[0]*-1);
    ans += S[0] > 0 ? in : in-1;
    S.erase(S.begin()+in);
    S.erase(S.begin()+0);
    return count_swaps(S);
}

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