oj.uz

Submission #155362

# Submission time Handle Problem Language Result Execution time Memory
155362 2019-09-27T16:24:40 Z Sasuke0004 Arranging Shoes (IOI19_shoes) C++17
0 / 100
 274 ms 282208 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define ll long long
#define pb push_back
#define left 2*h,l,(l+r)/2,L,R
#define right 2*h+1,(l+r)/2+1,r,L,R
#define tree ll h,ll l,ll r,ll L,ll R
using namespace std;
ll sg[4000006],fx[4000006],n,ans;
vector<ll>v[4000006],v1[4000006],v2[4000006];
void upd(tree)
{
    if(l>r)return;
    if(l>R)return;
    if(L>r)return;
    if(l==r)
    {
        sg[h]=sg[h]^(1);
        return;
    }
    upd(left);
    upd(right);
    sg[h]=sg[2*h]+sg[2*h+1];
}
ll get(tree)
{
    if(l>r)return 0;
    if(l>R)return 0;
    if(L>r)return 0;
    if(l>=L && r<=R)return sg[h];
    else return (get(left)+get(right));
}
int64_t count_swaps(vector<int> x)
{
    n=x.size();
    for(ll i=0;i<n;i++)
    {
      if(x[i]<0)
      {
        v1[-x[i]].pb(i);
      }
      else
      {
        v2[x[i]].pb(i);
      }
    }
    for(ll i=0;i<n;i++)
    {
        for(ll j=0;j<int(v[i].size());j++)
        {
            if(v1[i][j]>v2[i][j]){ans++;swap(v1[i][j],v2[i][j]);}
            fx[v1[i][j]]=v2[i+n][j];
        }
    }
    for(ll i=0;i<n;i++)
    {
        upd(1,0,n-1,i,i);
    }
    for(ll i=0;i<n;i++)
    {
        ans+=get(1,0,n-1,i+1,fx[i]);
        upd(1,0,n-1,fx[i],fx[i]);
    }
    return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 282140 KB Output is correct
2 Incorrect 246 ms 282104 KB Output isn't correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 282140 KB Output is correct
2 Incorrect 246 ms 282104 KB Output isn't correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 282140 KB Output is correct
2 Incorrect 246 ms 282104 KB Output isn't correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 282208 KB Output is correct
2 Incorrect 274 ms 282128 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 282140 KB Output is correct
2 Incorrect 246 ms 282104 KB Output isn't correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 282140 KB Output is correct
2 Incorrect 246 ms 282104 KB Output isn't correct