Submission #537321

#	Time	Username	Problem	Language	Result	Execution time	Memory
537321		ERH	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	35 ms	10024 KiB

shoes

#include <iostream>
#include <vector>
using namespace std;
vector<int> lista[100001][2];
int temp[100001];
long long count_swaps(vector<int> v){
  long long int total=0;
  for(int i=1; i<100001; ++i){
    for(int j=i; j>0; j-=j&-j){
      temp[j]++;
    }
  }
  for(int i=0; i<v.size(); ++i){
    int a=v[i];
    if(a<0){
      a=-a;
      if(!lista[a][0].empty()){
        int temp1=0, temp2=0;
        for(int j=i+1; j>0; j-=j&-j){
          temp1+=temp[j];
        }
        temp1+=temp[0];
        for(int j=lista[a][0].front()+1; j>0; j-=j&-j){
          temp2+=temp[j];
        }
        temp2+=temp[0];
        total+=temp1-temp2;
        for(int j=lista[a][0].front()+1; j<100001; j+=j&-j){
          temp[j]++;
        }
        for(int j=i+1; j<100001; j+=j&-j){
          temp[j]--;
        }
        lista[a][0].erase(lista[a][0].begin());
      } else {
        lista[a][1].push_back(i);
      }
    } else {
      if(!lista[a][1].empty()){
        int temp1=0, temp2=0;
        for(int j=i+1; j>0; j-=j&-j){
          temp1+=temp[j];
        }
        temp1+=temp[0];
        for(int j=lista[a][1].front()+1; j>0; j-=j&-j){
          temp2+=temp[j];
        }
        temp2+=temp[0];
        total+=temp1-temp2;
        total--;
        for(int j=lista[a][1].front()+1; j<100001; j+=j&-j){
          temp[j]++;
        }
        for(int j=i+1; j<100001; j+=j&-j){
          temp[j]--;
        }
        lista[a][1].erase(lista[a][1].begin());
      } else {
        lista[a][0].push_back(i);
      }
    }
  }
  return total;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:13:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i=0; i<v.size(); ++i){
      |                ~^~~~~~~~~

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