Submission #1140483

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140483		tsengang	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	0 ms	328 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
#define ll int
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
#define vodka void
#include "shoes.h"
long long count_swaps(vector<int> s) {
	ll n = s.size()/2;
    if(n == 1){
        if(s[0] < 0)ertunt 0;
        else ertunt 1;
    }
    vector<ll> adj[n+4][2];
    map<ll,ll>m;
    for(ll i = 0; i < s.size(); i++){
        m[abs(s[i])] = 1;
        if(s[i] < 0){
            adj[abs(s[i])][0].pb(i);
        }
        else adj[s[i]][1].pb(i);
    }
    ll cnt = 0;
    ll k = -1;
    long long ans = 0;
    for(auto [x,y] : m){
        cnt++;
        k = x;
        for(ll i = 0; i < adj[x][0].size(); i++){
            if(adj[x][0][i] < adj[x][1][i]){
                ans+=adj[x][1][i] - adj[x][0][i] - 1;
            }
            else{
                ans+=adj[x][0][i] - adj[x][1][i] - 2;
            }
        }
    }
    if(cnt == 1){
        ertunt ans;
    }
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^

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