Submission #623210

#	Time	Username	Problem	Language	Result	Execution time	Memory
623210		PanTkd	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1 ms	212 KiB

shoes

//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
    ll n=rand()%20+2;
    vi a(n,ll());
    for(ll i=0;i<n;i++){
        a[i]=rand()%20+2;
    }
    for(ll b=0;b<(1<<n);b++){
        vi on,off;
        for(ll i=0;i<n;i++){
            if(i&(1<<i)){
                on.push_back(i);
            }
            else{
                off.push_back(i);
            }
        }
    }
}
///////////////////////////////////////////////////////////////////////

struct shoes{
    int s;
    bool r;
};
long long count_swaps(vector <int> S) {
    ll n=S.size();
    shoes A[n];
    ll m=n/2;
    for(ll i=0;i<n;i++){
        A[i].s=abs(S[i]);
        A[i].r=(S[i]>0);
    }
    ll counter=0;
    ll ans=0;
    for(ll i=0;i<n;i++){
        if(!A[i].r){
            //cout<<i<<' '<<counter<<endl;
            ans+=i-counter;
            counter++;
        }
    }
    ll ans2=0;counter=0;
    for(ll i=n-1;i>=0;i--){
        if(A[i].r){
            ans2+=(n-1-i-counter++);
        }
    }
    return min(ans,ans2);
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:68:8: warning: unused variable 'm' [-Wunused-variable]
   68 |     ll m=n/2;
      |        ^

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