제출 #286235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286235		BeanZ	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	52 ms	7424 KiB

shoes

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

using namespace std;

#define ll long long
#define endl '\n'

const int N = 2e5 + 5;
vector<ll> node[100005];
ll a[200005];
ll count_swaps(vector<int> s){
        ll ans = 0;
        int n = s.size() / 2;
        ll cnt = 1;
        for (int i = 0; i < (2 * n); i++){
                if (s[i] > 0){
                        node[s[i]].push_back(cnt - 1);
                        cnt += 2;
                }
        }
        for (int i = 1; i <= n; i++){
                if (node[i].size() == 0) continue;
                reverse(node[i].begin(), node[i].end());
        }
        for (int i = 0; i < (2 * n); i++){
                if (s[i] < 0){
                        ans = ans + abs(i - node[-s[i]].back());
                        node[-s[i]].pop_back();
                }
        }
        return ans;
}
/*
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        ll n;
        cin >> n;
        for (int i = 1; i <= 2 * n; i++) cin >> a[i];
        ll now = 1, ans = 0;
        for (int i = 1; i <= (2 * n); i++){
                if (a[i] < 0){
                        ans = ans + abs(i - now);
                        now += 2;
                }
        }
        cout << ans;
}
*/
/*
*/

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