Submission #1169736

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169736		aagii	Arranging Shoes (IOI19_shoes)	C++20	45 / 100	63 ms	74952 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define sz size()
#define veg vegeta
#define harderahhh ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
const int N = 1e9+7;
const int M = 998244353;
using namespace std;
ll x, l, y, t, z, hp, sus1, sus2, g, sus, sus3, bruh, bruh1, bruh2, bruh3, dog1, h, r, dog2, dog3;
ll ck1, ck2, ck3, dog, i, p, j, q, m, a[1000005], b[696969], c[696969], n, k, d[2000005], e[696969];
ll x2[696969], x17[696969], x1[696969], joy[1005][1005], pp[1005][1005], di[1234566], de[1234566];
string s1, s2, s3, s4, s5, s6, s7, s8, s9, rep1, rep2, rep, s, hsr[696969], gi[696969];
char c1, c2, oon, hi[1005][1005], na[1005][1005], cc[696969], dd[696969];
pair <ll, ll> goku[696969], veg[696969];
vector<ll> aag[1000005], eeg[200005], ski, bidi;
bool vis[200005];
map <pair<ll,ll>, ll> mm;
map <ll, ll> wii, waa;
set <ll> kk;
void dfs(ll x) {
    
}
ll count_swaps(vector<int>s){
    ll n = s.size()/2;
    if (n == 1) {
        if (s[0] < 0) return 0LL;
        return 1LL;
    } else {
        for (i = 0; i < n*2; i++) {
            if (s[i] < 0) {
                ski.pb(i);
            }
        }
        for (i = 0; i < n*2; i += 2) {
            sus += abs(i-ski[i/2]);
        }
        return sus;
    }
}

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