# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849114 | abcvuitunggio | Arranging Shoes (IOI19_shoes) | C++17 | 27 ms | 10064 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
int a[200001],f[200001],cnt=1,res;
vector <int> pos[100001];
long long count_swaps(vector <int> s){
for (int i=s.size()-1;i>=0;i--)
if (s[i]>0)
pos[s[i]].push_back(i);
for (int i=0;i<s.size();i++)
if (s[i]<0){
a[i]=cnt;
a[pos[-s[i]].back()]=cnt+1;
pos[-s[i]].pop_back();
cnt+=2;
}
for (int i=s.size()-1;i>=0;i--){
for (int j=a[i];j;j-=j&(-j))
res+=f[j];
for (int j=a[i];j<=s.size();j+=j&(-j))
f[j]++;
}
return res;
}
Compilation message (stderr)
# | 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... |