Submission #1316887

#TimeUsernameProblemLanguageResultExecution timeMemory
1316887exoworldgdArranging Shoes (IOI19_shoes)C++20
100 / 100
317 ms146776 KiB
#include<bits/stdc++.h> #define ll long long #define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0) using namespace std; ll count_swaps(vector<int>s) { int n=s.size(),t[n+1]={}; ll ans=0; map<int,queue<int>>mp; for(int i=0,x,pos;i<n;i++){ x=s[i]; if(mp[-x].empty())pos=i+1,mp[x].push(pos); else{ pos=mp[-x].front(),mp[-x].pop(),ans+=i; for(int j=pos;j>0;j-=j&-j)ans-=t[j]; ans+=x<0; } for(;pos<=n;pos+=pos&-pos)t[pos]++; } 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...