제출 #499733

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

shoes

#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long count_swaps(std::vector<int> s) {

    vector <int> v;
    v=s;
    int n=s.size();
//cout << n << " ";
    if (n/2 == 1){
        if (v[0] < v[1]) return 0;
        else return 1;
    }
    long long ans=0;

    bool ok=1;
    for (int i=0;i<n/2;i++){
        if (-v[i] != v[(n/2)+i]){
            ok=0;
            break;
        }

    }
    if (ok){
        int q=1;
        for (int i=1;i<n/2;i++) ans+=q, q+=2;
        return ans;
    }
    for (int i=0;i<n;i+=2){
        if (v[i] > 0){
            for (int j=i+1;j<n;j++){
                if (-v[j] == v[i]){
                    for (int j1=j-1;j1>=i;j1--) swap(v[j1], v[j1+1]), ans++;
                    break;
                }

            }

        }
        else {
            for (int j=i+1;j<n;j++){
                if (-v[j] == v[i]){
                    for (int j1=j-1;j1>i;j1--) swap(v[j1], v[j1+1]), ans++;
                    break;
                }

            }
        }
    }
    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