제출 #161723

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

shoes

#include <bits/stdc++.h>
#include "shoes.h"

#define fi first
#define sz(x) (int)x.size()
#define se second
#define pll pair <ll,ll>
#define pii pair <int,int>

using namespace std;
typedef long long ll;
typedef long double ld;
const ll N = 2e5;

long long count_swaps(vector<int> s) {
    ll n = sz(s) / 2, ans = 0;
    vector <int> b = s;

    for(int i = 0; i < n * 2; i += 2){
        if(b[i] < 0){
            int j = i + 1;
            while(-b[j] != b[i])j++;
            while(j > i + 1)swap(b[j], b[j - 1]), j--, ans++;
        }else{
            int j = i + 1;
            while(-b[j] != b[i])j++;
            while(j > i)swap(b[j], b[j - 1]), j--, ans++;
        }
    }

	return ans;
}

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