Submission #1277251

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277251		hiepsimauhong	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	115 ms	269668 KiB

shoes

#include <bits/stdc++.h>

using namespace std;

//#define int int64_t

#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)

#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 0, L){FOR(KO, 0, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';

#define fs first
#define sd second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()

const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;

int n;
int a[N];
queue<int> nev[N], pos[N];
bool check[N];

struct Segment_tree{
        int sg[N << 2];

        void update(int id, int l, int r, int pos, int val){
                if(l > pos || r < pos){
                        return;
                }
                if(l == r){
                        sg[id] = val;
                        return;
                }

                int mid = (l + r) >> 1;
                update(id << 1, l, mid, pos, val);
                update(id << 1 | 1, mid + 1, r, pos, val);

                sg[id] = sg[id << 1] + sg[id << 1 | 1];
        }

        int get(int id, int l, int r, int u, int v){
                if(l > v || r < u){
                        return 0;
                }
                if(u <= l && r <= v){
                        return sg[id];
                }

                int mid = (l + r) >> 1;

                return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
        }
} sg;

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

        FOR(i, 1, n){
                a[i] = s[i - 1];
        }

        FOR(i, 1, n){
                if(a[i] < 0){
                        nev[-a[i]].push(i);
                }
                else{
                        pos[a[i]].push(i);
                }
                sg.update(1, 1, n, i, 1);
        }

        int ans = 0, cnt = 0;

        FOR(l, 1, n){
                if(check[l]) continue;

                if(a[l] > 0){
                        int r = nev[a[l]].front();
                        nev[a[l]].pop();
                        pos[a[l]].pop();

                        sg.update(1, 1, n, l, 0);
                        sg.update(1, 1, n, r, 0);

                        ans += sg.get(1, 1, n, l, r) + 1;

                        check[r] = 1;
                }
                else{
                        int r = pos[a[l]].front();
                        pos[a[l]].pop();
                        nev[a[l]].pop();

                        sg.update(1, 1, n, l, 0);
                        sg.update(1, 1, n, r, 0);

                        ans += sg.get(1, 1, n, l, r);

                        check[r] = 1;
                }
        }

        return ans;
}

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