Submission #560653

#	Time	Username	Problem	Language	Result	Execution time	Memory
560653		Vanilla	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	618 ms	146676 KiB

shoes

#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 2e5 + 2;
int bit [maxn];


void solve(int id){
    
    return;
}

void add (int x, int d) {
    for (; x < maxn; x += x & -x) {
        bit[x]+=d;
    }
}

int query (int x) {
    int rs = 0;
    for (; x > 0; x -= x & -x) {
        rs+=bit[x];
    }
    return rs;
}

int64 count_swaps(vector <int> a) {
    int64 rs = 0;
    int n = a.size();
    a.insert(a.begin(), 0);
    map <int, queue <int> > mp;
    for (int i = 1; i <= n; i++){
        mp[a[i]].push(i);
    }
    for (int i = 1; i < n; i++){
        while (!mp[-a[i]].empty() && mp[-a[i]].front() < i) {
            mp[-a[i]].pop();
        }
        if (mp[-a[i]].empty()) continue;
        int pos = mp[-a[i]].front();
        int now = i + query(i);
        int actual = pos + query(pos);
        rs+=actual-now - 1;
        if (a[i] > 0) {
            rs++;
        }
        add(i, 1);
        add(pos + 1, -1);
    }
    return rs;
}


// int main(){
//     // ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
//     vector <int> a = {-2, 2, 2, -2, -2, 2};
//     // vector <int> a = {2, 1, -1, -2};
//     cout << count_swaps(a);
//     return 0;
// }

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