제출 #393846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393846		teehandsome	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	598 ms	146824 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxn=2e5+10;
map<int,queue<int>> q;
vector<int> t;
void add(int pos,int val) {
    while(pos<mxn) {
        t[pos]+=val;
        pos+=pos&-pos;
    }
}
int get(int pos) {
    int res=0;
    while(pos>0) {
        res+=t[pos];
        pos-=pos&-pos;
    }
    return res;
}

long long count_swaps(std::vector<int> s) {
	int n=s.size(); t.resize(mxn+1);
	ll ans=0;
	for(int i=0;i<n;i++) {
        q[s[i]].push(i);
	}
	vector<bool> flag(n,false);
	for(int i=0;i<n;i++) {
        if(flag[i]) continue;
        int p1=q[-abs(s[i])].front(); q[-abs(s[i])].pop();
        int p2=q[abs(s[i])].front(); q[abs(s[i])].pop();
        flag[p1]=flag[p2]=true;
//        if(i) debug(p1,get(p1+1));
        p1+=get(p1+1);
        p2+=get(p2+1);

        int d=abs(p1-p2);
        ans+=d-1;
        if(p1>=p2) ans++;
//        debug(i,p1,p2);
        int mn=min(p1,p2);
        int mx=max(p1,p2);

        add(mn+1,1);
        add(mx+1,-1);
//        debug(t);
	}
	return ans;
}

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