#include<bits/stdc++.h> using namespace std; #include "shoes.h" #define F first #define S second #define MID ((l+r)/2) int seg[700000]; int n; void build(int l=0, int r=n, int ind=1){ if(l==r) seg[ind] = 1; else{ build(l, MID, ind*2); build(MID+1, r, ind*2+1); seg[ind] = seg[ind*2] + seg[ind*2+1]; } } void update(int p, int l=0, int r=n, int ind=1){ if(l==r && l==p) seg[ind] = 0; else if(r<p || l>p || l==r) return; else{ update(p, l, MID, ind*2); update(p, MID+1, r, ind*2+1); seg[ind] = seg[ind*2] + seg[ind*2+1]; } } int query(int rl, int rr, int l=0, int r=n, int ind=1){ if(rl<=l && r<=rr) return seg[ind]; else if(r<rl || l>rr) return 0; else return query(rl, rr, l, MID, ind*2) + query(rl, rr, MID+1, r, ind*2+1); } long long count_swaps(std::vector<int> s) { n = s.size(); build(); int swaps=0; int ind = 0; unordered_map<int, queue<int> > m; for(int i=0;i<s.size();i++){ m[s[i]].push(i); } while(ind<s.size()){ if(m[s[ind]].size()==0 || m[s[ind]].front() !=ind){ ind++; continue; } if(s[ind]>0) swaps++; int i = m[-s[ind]].front(); swaps += query(ind+1, i-1); //swaps += (i-ind-1); update(m[s[i]].front()); //cout<<query(ind, i)<<endl; m[-s[ind]].pop(); m[s[ind]].pop(); ind++; //cout<<endl<<endl<<endl; } return swaps; }

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:41:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<s.size();i++){
              ~^~~~~~~~~
shoes.cpp:44:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(ind<s.size()){
        ~~~^~~~~~~~~