제출 #737091

#제출 시각아이디문제언어결과실행 시간메모리
737091ammar2000Arranging Shoes (IOI19_shoes)C++17
50 / 100
1091 ms29884 KiB
#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 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...