Submission #1173743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173743		somefolk	Arranging Shoes (IOI19_shoes)	C++20	45 / 100	17 ms	3764 KiB

shoes

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
#define int long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

int64_t count_swaps(vector<int32_t> a){
    int n = a.size();

    if(n == 1){
        if(a[1] < a[0]) return 1;
        else return 0;
    }
    vector<int> pos, neg;
    for(int i = 0; i < n; i++){
        if(a[i] > 0 && i%2==0) pos.push_back(i);
        else if(a[i] < 0 && i%2!=0) neg.push_back(i);
    }

    int sol = 0, idx = 0;
    if(pos.size() < neg.size()){
        for(auto &i : pos){
            sol += abs(i-neg[idx]);
            idx++;
        }
    } else {
        for(auto &i : neg){
            sol += abs(i-pos[idx]);
            idx++;
        }
    }
    return sol;
}

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