Submission #1334471

#	Time	Username	Problem	Language	Result	Execution time	Memory
1334471		yhkhoo	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1096 ms	8872 KiB

shoes

#include "shoes.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define pb push_back
#define eb emplace_back

ll count_swaps(std::vector<int> s) {
    int n2 = s.size();
    int n = n2/2;
    vector<pii> m;
    m.reserve(n);
    vector<vi> p(n+1);
	for(int i=0; i<n2; i++){
        if(s[i] < 0){
            m.eb(-s[i], i);
        }
        else{
            p[s[i]].pb(i);
        }
    }
    for(int i=1; i<=n; i++){
        reverse(p[i].begin(), p[i].end());
    }
    vector<int> c;
    c.reserve(n2);
    for(int i=0; i<n; i++){
        auto& [si, mi] = m[i];
        c.pb(mi);
        c.pb(p[si].back());
        p[si].pop_back();
    }
    ll ans = 0;
    for(int i=0; i<n2; i++){
        for(int i=1; i<n2; i++){
            if(c[i-1] > c[i]){
                swap(c[i-1], c[i]);
                ans++;
            }
        }
    }
    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