Submission #292332

#	Time	Username	Problem	Language	Result	Execution time	Memory
292332		Ruba_K	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	266 ms	273244 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std ;
 
const int N = 2e5 + 2 ;
 
deque<int>pos[N];
 
struct BIT{
    int sz;
    vector<long long>v ;
 
    explicit BIT(int n){
        sz = n + 1;
        v.resize(sz);
    }
 
    long long get(int i){
        long long ret = 0;
        for(i++ ; i ; i -= ( i & -i))
            ret += v[i];
 
        return ret ;
    }
 
    void update(int i , long long x){
        for(i ++ ; i <= sz ; i += (i & -i))
            v[i] += x ;
    }
 
    long long query(int a , int b){
        return get(b) - get(a - 1);
    }
 
 
 
};
int finish[N * 4];
long long count_swaps(vector<int> v) {
     int n = v.size() / 2;
 
     for(int i = 0 ; i < n  * 2; i ++){
        pos[n + v[i]].push_back(i);
     }
 
     long long ans = 0 ;
 
    BIT bit (n * 2);
     for(int i = 0 ;i < n * 2 ; i ++ ){
        if(finish[i])continue ;
        int ab = -v[i] , p = pos[ab + n].front();
        finish[p]++;
        pos[ab + n].pop_front();
 
        pos[v[i] + n].pop_front();
 
        int betwen = bit.query(i + 1 , p + 1);
 
        ans += p - i - 1 - betwen  + (v[i] > 0 ? 1 : 0);
 
 
        bit.update( p + 1 , 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