제출 #266501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
266501		wdjpng	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	29 ms	3072 KiB

shoes

#include <bits/stdc++.h>

#define rep(i,n) for(int i = 0; i  < n; i++)
#define lint long long
using namespace std;


vector<int>T;
void update(int i, int k, int n){
    i++;
    for(;i <= n;i+=i&-i){
        T[i]+=k;
    }
}

int get(int i){
    i++;
    int s = 0;
    for(; i>0; i-=i&-i){
        s+=T[i];
    }
    return s;
}

int getRange(int l, int r){
    return get(r) - get(l-1);
}
lint count_swaps(vector<int> s){
    int n = s.size()/2;
    return n*(n-1)/2;
    T.resize(4*n+4);
    vector<set<int>>set(2*n+1);
    vector<bool>ignore(2*n);

    rep(i,2*n){
        set[s[i]+n].insert(i);
    }
    int sum=0;
  
    rep(i,2*n){
        if(ignore[i]){continue;}
        
        int nearest=*set[-s[i]+n].begin();
        set[-s[i]+n].erase(set[-s[i]+n].begin());
        set[s[i]+n].erase(set[s[i]+n].begin());

        ignore[nearest]=true;
        
        if(s[i]>0){sum++;}
        sum+=nearest-i-1 - getRange(i, nearest);
        update(nearest,1, 2*n);
    }

    return sum;
}

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