제출 #554441

#제출 시각아이디문제언어결과실행 시간메모리
554441n0sk1llArranging Shoes (IOI19_shoes)C++17
45 / 100
314 ms27424 KiB
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;
long long int typedef li;

int n;
int fwt[200005];

void add(int i)
{
    for (;i<=2*n;i+=(i&-i)) fwt[i]++;
}
int pre(int i)
{
    li ret=0;
    for (;i;i-=(i&-i)) ret+=fwt[i];
    return ret;
}

int gde[200005];
li invcount(int n)
{
    li ans=0;
    //for (int i=0;i<2*n;i++) cout<<gde[i]<<" "; cout<<endl;
    for (int i=0;i<2*n;i++)
    {
        ans+=i-pre(gde[i]);
        //cout<<i<<": "<<pre(gde[i])<<endl;
        //for (int i=1;i<=2*n;i++) cout<<fwt[i]<<","; cout<<endl<<endl;
        add(gde[i]);
    }

    return ans;
}

li count_swaps(vector<int> s)
{
	n=s.size()/2;
	vector<int> pom; map<int,vector<int>> poz;
	for (int i=0;i<2*n;i++) if (s[i]<0) pom.push_back(s[i]),pom.push_back(-s[i]);
	for (int i=0;i<2*n;i++) poz[s[i]].push_back(i);
	for (int i=2*n-1;i>=0;i--) gde[i]=poz[pom[i]].back()+1,poz[pom[i]].pop_back();

    return invcount(n);
}

/*

2
1 2 -1 -2

*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...