#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<int,vector<int>> mp,mp1;
int sum(ll node,ll x,ll y,ll l,ll r){
if(x>=l&&r<=y)return tr[node];
if(x>r||y<l||x>y)return 0;
ll mid=(l+r)/2;
return sum(node*2,x,y,l,mid)+sum(node*2+1,x,y,mid+1,r);
}
void add(ll node,ll l,ll r, ll k,ll val){
if(l>k||r<k)return;
tr[node]=tr[node]-c[k]+val;
if(l==r)return ;
ll mid=(l+r)/2;
add(node*2,l,mid,k,val);
add(node*2+1,mid+1,r,k,val);
}
int count_swaps(vector<int> vec){
n=vec.size()/2;
rep(i,0,vec.size()-1){
if(vec[i]<0)mp[vec[i]*-1].pb(i);
else mp1[vec[i]].pb(i);
}
vector<pair<int,int>>vpl;
for(auto u:mp){
x=u.ff;
y = mp[x].size();
for(ll i=0;i<y;i++){
if(mp[x][i]>mp1[x][i])ans++,swap(mp[x][i],mp1[x][i]);
vpl.pb({mp[x][i],mp1[x][i]});
}
}
for(auto u:vpl){
x=u.ff;
y=u.ss;
ans+=y-x;
ans-=(sum(1,x,y,1,n));
add(1,1,n,x,1);
add(1,1,n,y,1);
}
return ans;
}
Compilation message
shoes.cpp:39:36: error: 'int sum(ll, ll, ll, ll, ll)' redeclared as different kind of entity
39 | int sum(ll node,ll x,ll y,ll l,ll r){
| ^
shoes.cpp:31:28: note: previous declaration 'll sum'
31 | ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
| ^~~
shoes.cpp: In function 'int sum(ll, ll, ll, ll, ll)':
shoes.cpp:43:32: error: 'sum' cannot be used as a function
43 | return sum(node*2,x,y,l,mid)+sum(node*2+1,x,y,mid+1,r);
| ^
shoes.cpp:43:58: error: 'sum' cannot be used as a function
43 | return sum(node*2,x,y,l,mid)+sum(node*2+1,x,y,mid+1,r);
| ^
shoes.cpp: In function 'int count_swaps(std::vector<int>)':
shoes.cpp:20:32: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
20 | #define rep(i,a,b) for(ll i=a;i<=b;i++)
......
55 | rep(i,0,vec.size()-1){
| ~~~~~~~~~~~~~~~~
shoes.cpp:55:5: note: in expansion of macro 'rep'
55 | rep(i,0,vec.size()-1){
| ^~~
shoes.cpp:72:28: error: 'sum' cannot be used as a function
72 | ans-=(sum(1,x,y,1,n));
| ^
