I use long long int type and rigth read-write operations. But also have WA#6. Who can help me?
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
#define left(x) ((x) << 1)
#define right(x) ((x) << 1 | 1)
#define parent(x) ((x) >> 1)
enum CmdType {BID,DEL,SALE};
struct
{
int price,c;
enum CmdType cmd;
} data[100000];
struct
{
int l,r,v;
} tree[265000];
int n,size,sz,bnd[100100],bnds[100100],bndc,bndsc;
char buf[20];
int query(int price)
{
int ans = 0;
int v = 1;
while (v < sz && tree[v].v > 0)
if (price <= tree[left(v)].r)
v = left(v);
else
{
ans += tree[left(v)].v;
v = right(v);
}
return ans+tree[v].v;
}
void add(int price, int delta)
{
int v = 1;
while (v < sz)
{
tree[v].v += delta;
if (price <= tree[left(v)].r)
v = left(v);
else
v = right(v);
}
tree[v].v += delta;
}
void main()
{
#ifndef ONLINE_JUDGE
freopen("data.txt","r",stdin);
#endif
n = bndsc = 0;
bnds[bndsc++] = 0;
bnds[bndsc++] = 1000000;
while (true)
{
gets(buf);
if (buf[0] == 'Q')
break;
double t;
if (buf[0] == 'S')
{
sscanf(buf+4,"%lf%d",&t,&data[n].c);
data[n].cmd = SALE;
}
else
{
sscanf(buf+4,"%lf",&t);
if (buf[0] == 'B')
data[n].cmd = BID;
else
data[n].cmd = DEL;
}
data[n].price = 1000000-floorl(t*100.0+0.3);
if (data[n].cmd == SALE)
bnds[bndsc++] = data[n].price;
n++;
}
sort(bnds,bnds+bndsc);
bnd[0] = bnds[0];
bndc = 1;
for (int i = 1; i < bndsc; i++)
if (bnds[i] != bnds[i-1])
bnd[bndc++] = bnds[i];
bndc--;
for (sz = 1; sz < bndc; sz*=2);
for (int i = 0; i < bndc; i++)
{
tree[sz+i].l = bnd[i]+1;
tree[sz+i].r = bnd[i+1];
tree[sz+i].v = 0;
}
for (int i = sz-1; i >= 1; i--)
{
tree[i].l = tree[left(i)].l;
tree[i].r = tree[right(i)].r;
tree[i].v = 0;
}
long long ans = 0;
for (int i = 0; i < n; i++)
if (data[i].cmd == SALE)
{
int v = query(data[i].price);
if (v > data[i].c) v = data[i].c;
ans += v;
}
else if (data[i].cmd == BID)
add(data[i].price,+1);
else
add(data[i].price,-1);
printf("%.2lf",(ans*0.01)+1.e-5);
}
