이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "shoes.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int MOD=1e9+7;
ll n,a[SI],re[SI],vis[SI];
map <ll,ll> la,lai,lan;
long long count_swaps(std::vector<int> s) {
n=s.size()/2;
for (int i=n*2-1;i>=0;i--)
{
if (la[s[i]])
lai[i]=la[s[i]];
if (la[-s[i]])
lan[i]=la[-s[i]];
la[s[i]]=i;
}
ll ans=0;
for(int i=0;i<2*n;i++)
{
if (vis[i])
continue;
if (s[i]>0)
{
int u=lan[i];
while (vis[u])
u=lai[u];
ans+=u-i;
vis[u]=1;
ans-=re[u]-re[i];
for(int o=u+1;o<2*n;o++)
re[o]++;
}
else
{
int u=lan[i];
while (vis[u])
u=lai[u];
ans+=u-i-1;
ans-=re[u]-re[i];
vis[u]=1;
for(int o=u+1;o<2*n;o++)
re[o]++;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |