Submission #1351401

#	Time	Username	Problem	Language	Result	Execution time	Memory
1351401		ElayV13	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	0 ms	344 KiB

shoes

#include "shoes.h"
#include "bits/stdc++.h"
using namespace std;

#define ll long long
const int N=100001;

int nn;

ll st[N*4];

void upd(int idx,int l,int r,int pos,int val){
      if(l==r){
            st[idx]=val;
            return;
      }
      int mid=(l+r)>>1;
      if(mid>=pos) upd(2*idx,l,mid,pos,val);
      else upd(2*idx+1,mid+1,r,pos,val);
      st[idx]=st[idx*2]+st[idx*2+1];
}

int ask(int idx,int l,int r,int ql,int qr){
      if(ql>r||l>qr) return 0;
      else if(ql<=l&&r<=qr) return st[idx];
      int mid=(l+r)>>1;
      return ask(2*idx,l,mid,ql,qr)+ask(2*idx+1,mid+1,r,ql,qr);
}

int get(int l,int r){
      return ask(1,0,nn-1,l,r);
}

ll count_swaps(vector<int>s)
{
      int n=(int)s.size();
      nn=n;
      ll res=0;
      for(int i=0;i<n;i++){
            if(get(i,i)) continue;
            for(int j=i+1;j<n;j++){
                  if(!get(j,j)&&s[j]==-s[i]){
                        if(s[i]>0) ++res;
                        res+=(((i+1)-(j-1)+1)-get(i+1,j-1));
                        upd(1,0,n-1,i,1);
                        upd(1,0,n-1,j,1);
                        break;
                  }
            }
      }
      return res;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15