Submission #238775

#	Time	Username	Problem	Language	Result	Execution time	Memory
238775		duality	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	117 ms	16504 KiB

shoes

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

vi pos[200001];
int p[200001],used[200001],bit[200001];
long long int count_swaps(vector<int> S) {
    int i,j;
    LLI ans = 0;
    for (i = 0; i < S.size(); i++) pos[S[i]+S.size()/2].pb(i);
    for (i = 0; i < S.size(); i++) {
        if (!used[i]) {
            int u = pos[-S[i]+S.size()/2][p[-S[i]+S.size()/2]++];
            p[S[i]+S.size()/2]++;
            used[i] = used[u] = 1;
            ans += u-i-1;
            for (j = u; j > 0; j -= j & (-j)) ans -= bit[j];
            for (j = i+1; j > 0; j -= j & (-j)) ans += bit[j];
            for (j = u+1; j <= S.size(); j += j & (-j)) bit[j]++;
            if (S[i] > 0) ans++;
        }
    }
    return ans;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:63:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < S.size(); i++) pos[S[i]+S.size()/2].pb(i);
                 ~~^~~~~~~~~~
shoes.cpp:64:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < S.size(); i++) {
                 ~~^~~~~~~~~~
shoes.cpp:72:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = u+1; j <= S.size(); j += j & (-j)) bit[j]++;
                           ~~^~~~~~~~~~~

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