제출 #266453

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

shoes

#include <bits/stdc++.h>

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

lint count_swaps(vector<int> s){
    int n = s.size()/2;
    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;
    vector<int>add(2*n);
    int curAdd=0;
    rep(i,2*n){
        curAdd+=add[i];
        sum+=curAdd;
        if(ignore[i]){continue;}
        int nearest=*set[-s[i]+n].begin();
        set[-s[i]+n].erase(set[-s[i]+n].begin());

        ignore[nearest]=true;
        curAdd--;
        add[nearest]++;
        if(s[i]>0){sum++;}
        sum+=nearest-i-1;
    }

    return sum;
}
/*
signed main(){
    int n;
    cin >> n;
    n*=2;
    vector<int>s(n);
    rep(i,n){cin>>s[i];}
    cout << count_swaps(s);
}
*/

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