Raffles - VietMX's Blog

Johnny is at a carnival which has n raffles. Raffle i has a prize with value p _i. Each participant can put tickets in whichever raffles they choose (they may have more than one ticket in a single raffle). At the end of the carnival, one ticket is selected at random from each raffle, and the owner of the ticket wins the associated prize. A single person can win multiple prizes from different raffles.

However, county rules prevent any one participant from owning more than half the tickets in a single raffle, i.e. putting more tickets in the raffle than all the other participants combined. To help combat this (and possibly win some prizes), the organizers started by placing a single ticket in each raffle, which they will never remove.

Johnny bought t tickets and is wondering where to place them. Currently, there are a total of l _i tickets in the i-th raffle. He watches as other participants place tickets and modify their decisions and, at every moment in time, wants to know how much he can possibly earn. Find the maximum possible expected value of Johnny’s winnings at each moment if he distributes his tickets optimally. Johnny may redistribute all of his tickets arbitrarily between each update, but he may not place more than t tickets total or have more tickets in a single raffle than all other participants combined.

Input

The first line contains two integers n, t, and q (1 ≤ n, t, q ≤ 200 000) — the number of raffles, the number of tickets Johnny has, and the total number of updates, respectively.

The second line contains n space-separated integers p _i (1 ≤ p _i ≤ 1000) — the value of the i-th prize.

The third line contains n space-separated integers l _i (1 ≤ l _i ≤ 1000) — the number of tickets initially in the i-th raffle.

The last q lines contain the descriptions of the updates. Each description contains two integers t _k, r _k (1 ≤ t _k ≤ 2, 1 ≤ r _k ≤ n) — the type of the update and the raffle number. An update of type 1 represents another participant adding a ticket to raffle r _k. An update of type 2 represents another participant removing a ticket from raffle r _k.

It is guaranteed that, after each update, each raffle has at least 1 ticket (not including Johnny’s) in it.

Output

Print q lines, each containing a single real number — the maximum expected value of Johnny’s winnings after the k-th update. Your answer will be considered correct if its absolute or relative error does not exceed 10^- 6.

Namely: let’s assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .

Examples

input

output

1.666666667
1.333333333
2.000000000

input

output

12.000000000
12.000000000
11.769230769
12.000000000
12.000000000

Note

In the first case, Johnny only has one ticket to distribute. The prizes are worth 4 and 5, and the raffles initially have 1 and 2 tickets, respectively. After the first update, each raffle has 2 tickets, so Johnny has expected value of winning by placing his ticket into the second raffle. The second update adds a ticket to the second raffle, so Johnny can win in the first raffle. After the final update, Johnny keeps his ticket in the first raffle and wins .

In the second case, Johnny has more tickets than he is allowed to spend. In particular, after the first update, there are 7, 6, and 6 tickets in each raffle, respectively, so Johnny can only put in 19 tickets, winning each prize with probability . Also, note that after the last two updates, Johnny must remove a ticket from the last raffle in order to stay under the tickets in the third raffle.

Solution:

#include <bits/stdc++.h>

using namespace std;

const int N = 400010;

int p[N];
int cnt[N];
int my[N];

inline pair <int, int> get_pair(int i, int my) {
if (my < 0) {
    return make_pair(0, 1);
  }
  if (my > cnt[i]) {
return make_pair(p[i], 2);
}
return make_pair(p[i] * my, my + cnt[i]);
}

inline double get_double(int i, int my) {
pair <int, int> z = get_pair(i, my);
return z.first * 1.0 / z.second;
}

struct Profit {
int id;
int my;
long long pa;
long long pb;
double profit;

Profit(int id, int my) {
this->id = id;
this->my = my;
if (my == 0) {
this->pa = 1;
this->pb = 0;
} else {
if (my <= cnt[id]) {
        this->pa = p[id] * cnt[id];
this->pb = (my + cnt[id]) * 1LL * (my + cnt[id] - 1);
} else {
this->pa = 0;
this->pb = 1;
}
}
this->profit = this->pa * 1.0 / this->pb;
}
};

struct better_first {
bool operator() (const Profit &thiss, const Profit &other) {
long long diff = thiss.pa * other.pb - thiss.pb * other.pa;
if (diff != 0) {
return diff > 0;
}
if (thiss.id != other.id) {
return thiss.id > other.id;
}
return thiss.my > other.my;
}
};

struct worse_first {
bool operator() (const Profit &thiss, const Profit &other) {
long long diff = thiss.pa * other.pb - thiss.pb * other.pa;
if (diff != 0) {
return diff < 0;
    }
    if (thiss.id != other.id) {
      return thiss.id < other.id;
    }
    return thiss.my < other.my;
  }
};

/*  bool operator <(const Profit &other) const {
    long long diff = this.pa * other.pb - this.pb * other.pa;
    if (diff != 0) {
      return diff < 0;
    }
    if (id != other.id) {
      return id < other.id;
    }
    return my < other.my;
  }*/

int main() {
  int n, have, q;
  scanf("%d %d %d", &n, &have, &q);
  for (int i = 0; i < n; i++) {
    scanf("%d", p + i);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", cnt + i);
  }
  for (int i = 0; i < n; i++) {
    my[i] = 0;
  }
  set <Profit, better_first> nxt;
for (int i = 0; i < n; i++) {
    nxt.insert(Profit(i, 1));
  }
  double res = 0.0;
  while (have > 0 && !nxt.empty()) {
have--;
Profit z = *(nxt.begin());
nxt.erase(nxt.begin());
int i = z.id;
res += z.profit;
my[i]++;
if (my[i] < cnt[i]) {
      nxt.insert(Profit(i, my[i] + 1));
    }
  }
  set <Profit, worse_first> lst;
for (int i = 0; i < n; i++) {
    if (my[i] > 0) {
lst.insert(Profit(i, my[i]));
}
}
while (q--) {
int type, id;
scanf("%d %d", &type, &id);
id--;
if (my[id] < cnt[id]) {
      nxt.erase(Profit(id, my[id] + 1));
    }
    if (my[id] > 0) {
lst.erase(Profit(id, my[id]));
}
if (type == 1) {
if (have > 0) {
cnt[id]++;
my[id]++;
have--;
} else {
res -= p[id] * my[id] * 1.0 / (my[id] + cnt[id]);
cnt[id]++;
res += p[id] * my[id] * 1.0 / (my[id] + cnt[id]);
while (my[id] > 0 && !nxt.empty()) {
Profit cur = Profit(id, my[id]);
Profit best = *(nxt.begin());
if (cur.profit < best.profit) {
            int rm = best.id;
            if (my[rm] < cnt[rm]) {
              nxt.erase(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.erase(Profit(rm, my[rm]));
}
res += best.profit;
my[rm]++;
if (my[rm] < cnt[rm]) {
              nxt.insert(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.insert(Profit(rm, my[rm]));
}
res -= cur.profit;
my[id]--;
} else {
break;
}
}
while (my[id] < cnt[id] && !lst.empty()) {
          Profit cur = Profit(id, my[id] + 1);
          Profit worst = *(lst.begin());
          if (cur.profit > worst.profit) {
int rm = worst.id;
if (my[rm] < cnt[rm]) {
              nxt.erase(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.erase(Profit(rm, my[rm]));
}
res -= worst.profit;
my[rm]--;
if (my[rm] < cnt[rm]) {
              nxt.insert(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.insert(Profit(rm, my[rm]));
}
res += cur.profit;
my[id]++;
} else {
break;
}
}
}
if (my[id] < cnt[id]) {
        nxt.insert(Profit(id, my[id] + 1));
      }
      if (my[id] > 0) {
lst.insert(Profit(id, my[id]));
}
} else {
if (my[id] == cnt[id]) {
cnt[id]--;
my[id]--;
if (!nxt.empty()) {
Profit z = *(nxt.begin());
nxt.erase(nxt.begin());
int i = z.id;
if (my[i] < cnt[i]) {
            nxt.erase(Profit(i, my[i] + 1));
          }
          if (my[i] > 0) {
lst.erase(Profit(i, my[i]));
}
res += z.profit;
my[i]++;
if (my[i] < cnt[i]) {
            nxt.insert(Profit(i, my[i] + 1));
          }
          if (my[i] > 0) {
lst.insert(Profit(i, my[i]));
}
} else {
have++;
}
} else {
res -= p[id] * my[id] * 1.0 / (my[id] + cnt[id]);
cnt[id]--;
res += p[id] * my[id] * 1.0 / (my[id] + cnt[id]);
while (my[id] < cnt[id] && !lst.empty()) {
          Profit cur = Profit(id, my[id] + 1);
          Profit worst = *(lst.begin());
          if (cur.profit > worst.profit) {
int rm = worst.id;
if (my[rm] < cnt[rm]) {
              nxt.erase(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.erase(Profit(rm, my[rm]));
}
res -= worst.profit;
my[rm]--;
if (my[rm] < cnt[rm]) {
              nxt.insert(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.insert(Profit(rm, my[rm]));
}
res += cur.profit;
my[id]++;
} else {
break;
}
}
while (my[id] > 0 && !nxt.empty()) {
Profit cur = Profit(id, my[id]);
Profit best = *(nxt.begin());
if (cur.profit < best.profit) {
            int rm = best.id;
            if (my[rm] < cnt[rm]) {
              nxt.erase(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.erase(Profit(rm, my[rm]));
}
res += best.profit;
my[rm]++;
if (my[rm] < cnt[rm]) {
              nxt.insert(Profit(rm, my[rm] + 1));
            }
            if (my[rm] > 0) {
lst.insert(Profit(rm, my[rm]));
}
res -= cur.profit;
my[id]--;
} else {
break;
}
}
if (my[id] < cnt[id]) {
          nxt.insert(Profit(id, my[id] + 1));
        }
        if (my[id] > 0) {
lst.insert(Profit(id, my[id]));
}
}
}
printf("%.17f\n", res);
}
return 0;
}

Satanic Panic

Check if two segments intersect

Alyona and a Narrow Fridge

Paint the edges of the tree

Unusual Graph

Lingua Romana