# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155638 | Berted | Arranging Shoes (IOI19_shoes) | C++14 | 357 ms | 207072 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 <iostream>
#include <deque>
#define ll long long
using namespace std;
bool skp[300021]={};
int fwk[300021]={},n,pr=0;
deque<int> v[300021]={};
ll rs = 0;
int qry(int x)
{
x = n+1 - x;
int to = 0;
for (;x;x-=x&(-x)) {to+=fwk[x];}
return to;
}
void upd(int x,int v)
{
x = n+1 - x;
for (;x<=n;x+=x&(-x)) {fwk[x]+=v;}
}
long long count_swaps(vector<int> s)
{
n = s.size();
for (int i=0;i<s.size();i++) {v[s[i]+n].push_back(i+1);upd(i+1,i+1);upd(i,-i-1);}
int i=0;
while (pr<n)
{
while (skp[i]) {i++;}
//cout<<i+1<<" "<<v[-s[i]+n].front()<<" "<<qry(v[-s[i]+n].front())<<" "<<qry(i+1)<<"\n";
skp[v[-s[i]+n].front()-1] = 1;
rs += (ll)qry(v[-s[i]+n].front()) - (ll)(qry(i+1)+(s[i]<0));
upd(v[-s[i]+n].front(),1);
v[s[i]+n].pop_front();
v[-s[i]+n].pop_front();
i++;
pr += 2;
}
return rs;
}
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... |