HNOI 2015

http://www.cnblogs.com/New-Godess/p/4450078.html

/**************************************************************
    Problem: 4009
    User: hzt1
    Language: C++
    Result: Accepted
    Time:11572 ms
    Memory:460476 kb
****************************************************************/
 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define u t[x]
using namespace std;
typedef long long LL;
const int N = 40005, inf = 1000000000, D = 15;
struct Edge { int y, nex; } g[N*2];
struct arr { int x, y, z, ty, v; } b[N*10];
struct Segnode { int s, lc, rc; } t[N*950];
int n, m, Q, pos[N], sz, in[N], out[N], dz, q1[N], l1, tz, q, qa, qz;
int ans[N], bz, up[N][D + 1], par[N], h[N];
bool Cmp(arr x, arr y) { return (x.x == y.x) ? (abs(x.ty) > abs(y.ty)) : x.x < y.x; }
void Init(int x, int y) { g[++ sz] = (Edge) { y, pos[x] }, pos[x] = sz; }
int Mov(int x, int y) {
    Dwn(i, D, 0) if ((1 << i) <= y) y -= (1 << i), x = up[x][i];
    return x;
}
void Dfs(int x, int ft) {
//  cout << x << endl;
    par[x] = ft;
    Rep(i, 1, D) up[x][i] = up[ up[x][i - 1] ][i - 1];
    in[x] = ++ dz;
    RepE(i, x) {
        int y = g[i].y;
        if (y != ft) up[y][0] = x, h[y] = h[x] + 1, Dfs(y, x);
    }
    out[x] = dz;
}
void Modify(int x, int l, int r) { // cout << x<<endl;
    u.s += qz;
    if (l == r) return ;
    int mid = l + r >> 1;
    if (q <= mid) {
        if (!u.lc) u.lc = ++ tz;
        Modify(u.lc, l, mid);
    } else {
        if (!u.rc) u.rc = ++ tz;
        Modify(u.rc, mid + 1, r);
    }
}
void Add(int x, int y, int z) {// puts("-------------- in ------------");
    if (!x) return ;
    q = y, qz = z;
    for (; x <= n; x += x & (-x)) Modify(x, 0, inf);// cout << x<<endl, 
}
void Query(int l, int r) {
    if (l == r) { qa = l; return ; }
    int mid = l + r >> 1, p = 0;
    Rep(i, 1, l1) p += t[ t[ q1[i] ].lc ].s;
//  cout << l<<"  "<<r<<endl;
    if (p >= q) {
        Rep(i, 1, l1) q1[i] = t[ q1[i] ].lc;
        Query(l, mid);
    } else {
        Rep(i, 1, l1) q1[i] = t[ q1[i] ].rc;
        q -= p, Query(mid + 1, r);
    }
}
int Qry(int x, int y) {
    q = y, l1 = 0;
    for (; x; x -= x & (-x)) q1[++ l1] = x;
//  cout << q1[l1]<<" l1"<<endl;
    Query(0, inf);
    return qa;
}
int main()
{
    scanf ("%d%d%d", &n, &m, &Q), tz = n;
    int x, y, k;
    Rep(i, 1, n - 1) {
        scanf ("%d%d", &x, &y);
        Init(x, y), Init(y, x);
    }
    Dfs(1, 0);
    Rep(i, 1, m) {
        scanf ("%d%d%d", &x, &y, &k);
        if (in[y] > in[x]) swap(x, y);
        int z = Mov(x, h[x] - h[y] - 1);
        //cout << x<<" "<<y<<" "<<z<<" "<<par[z]<<" "<<in[x]<<" "<<out[x]<<" "<<in[y]<<" "<<out[y]<<endl;
        if (par[z] == y) {
            //cout << " ty == 1  "<<in[x]<<" "<<in[8]<<endl;
            b[++ bz] = (arr) { in[x], 1, in[z] - 1, 1, k };
            b[++ bz] = (arr) { out[z] + 1, in[x], out[x], 1, k };
            b[++ bz] = (arr) { out[x] + 1, 1, in[z] - 1, -1, k };
            b[++ bz] = (arr) { n + 1, in[x], out[x], -1, k };
        } else {
            b[++ bz] = (arr) { in[x], in[y], out[y], 1, k };
            b[++ bz] = (arr) { out[x] + 1, in[y], out[y], -1, k };
        }
    }
    Rep(i, 1, Q) {
        scanf ("%d%d%d", &x, &y, &k);
        if (in[y] > in[x]) swap(x, y);
        b[++ bz] = (arr) { in[x], in[y], i, 0, k };
    }
//  puts("fin");
    sort(b + 1, b + bz + 1, Cmp);
    Rep(i, 1, bz) {
        // cout << b[i].x<<" "<<b[i].y<<" "<<b[i].z<<" "<<b[i].ty<<" "<<b[i].v<<" ------------"<<endl;
        if (!b[i].ty) {
            ans[ b[i].z ] = Qry(b[i].y, b[i].v);
        } else {
            Add(b[i].y, b[i].v, b[i].ty), Add(b[i].z + 1, b[i].v, -b[i].ty);
        }
    }
    Rep(i, 1, Q) printf("%d\n", ans[i]);
 
    return 0;
}

/**************************************************************
    Problem: 4008
    User: hzt1
    Language: C++
    Result: Accepted
    Time:784 ms
    Memory:1688 kb
****************************************************************/
 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define RepE(i, x) for(int i = pos[x]; i; i = g[i].nex)
using namespace std;
typedef long long LL;
const int N = 230;
int n, m, d[N], T;
double f[N][N], ans, p[N];
int main()
{
    scanf ("%d", &T);
    while (T --) {
        ans = 0;
        scanf ("%d%d", &n, &m);
        Rep(i, 1, n) scanf ("%lf%d", &p[i], &d[i]);
        memset(f, 0, sizeof(f));
        f[1][m] = 1;
        Rep(i, 1, n - 1) {
            // Rep(j, 1)
            double p0 = 1 - p[i];
            Rep(j, 1, m) { // if (f[i][j] > 0) {
                f[i + 1][j] += f[i][j] * p0;
                f[i + 1][j - 1] += f[i][j] * (1 - p0);
                ans += f[i][j] * (1 - p0) * d[i];
                p0 *= 1 - p[i];
                // cout << f[i][j]<<" "<<ans<< endl;
            }
        }
        // cout << ans << endl;
        double p0 = 1 - p[n];
        Rep(j, 1, m) {
            ans += f[n][j] * (1 - p0) * d[n];
            p0 *= 1 - p[n];
        }
        printf("%.10f\n", ans);
    }
     
    return 0;
}