제출 #783261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
783261		ivaziva	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	1 ms	212 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

#define MAXN 200010

long long nn;
long long niz[MAXN];
long long fenvik[MAXN];
map<long long,vector<long long>> mapa;

void update(long long x)
{
    if (x<=2*nn)
    {
        fenvik[x]++;
        x+=x&(-x);
    }
}

long long sum(long long x)
{
    long long ans=0;
    while (x>0)
    {
        ans+=fenvik[x];
        x-=x&(-x);
    }
    return ans;
}

long long count_swaps(std::vector<int> s)
{
    nn=s.size()/2;
    long long sol=0;
    for (long long i=1;i<=2*nn;i++)
    {
        cout<<sol<<" ";
        niz[i]=s[i-1];
        if (mapa[-niz[i]].empty()) mapa[niz[i]].push_back(i);
        else
        {
            long long poz=mapa[-niz[i]].back();
            sol+=(i-poz-1-sum(i)+sum(poz-1));
            mapa[-niz[i]].pop_back();
            update(i);
            update(poz);
        }
        cout<<sol<<endl;
    }
    return sol;
}

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