2016年07月_yamiedie_

原创 Uoj 33 树上GCD (树分治)

#include #include #include #include #include #include #include using namespace std;#define N 300020#define B 300#define M 600200#define inf 0x3f3f3f3f#define mod 1000000007#define LL lo

2016-07-29 17:06:48 1199 1

原创 bzoj 3672 [Noi2014]购票 (线段树+凸壳)

#include #include #include #include #include #include using namespace std;#define N 200020#define M 400020#define mod 1000000007#define inf 0x3f3f3f3f#define LL long long#define ls (i <<

2016-07-24 16:54:06 641

原创 CodeForces 643E Bear and Destroying Subtrees (概率)

#include #include #include #include #include #include using namespace std;#define N 500020#define T 66#define eps 1e-8int n;double dp[N][T];int fa[N], d[N];int main() { int q; scan

2016-07-18 13:59:23 502

原创 CodeForces 175D Plane of Tanks: Duel (概率)

#include #include #include #include #include using namespace std;#define N 100020#define T 5030#define eps 1e-8int hp0, dt0, l0, r0;int hp1, dt1, l1, r1;double p0, p1;double f0[220], f

2016-07-17 17:53:31 417

原创 CodeForces 248E Piglet's Birthday (概率)

#include #include #include #include #include using namespace std;#define N 100020int n, a[N], aa[N];int c[N];long double p[N][120];long double C(int a, int b) { long double ret = 1;

2016-07-17 16:05:49 370

原创 CodeForces 605E Intergalaxy Trips (概率)

#include #include #include #include #include using namespace std;#define N 1020int n;double p[N][N];double m[N], A[N], B[N];bool vis[N];int dcmp(double x) { if(fabs(x) < 1e-12) return

2016-07-17 14:53:55 547

原创 CodeForces 113D Museum (高斯消元)

#include #include #include #include #include using namespace std;#define N 23vector g[N];int n, m, a, b;int d[N];double p[N];double A[N * N][N * N], X[N * N][N], B[N * N][N];int mp[

2016-07-17 13:22:46 776

原创 CodeForces 623D Birthday (贪心)

2016-07-17 13:21:51 396

原创 CodeForces 101D Castle (贪心)

#include #include #include #include #include #include using namespace std;#define N 400020#define M 200020int fst[N], nxt[M], vv[M], cost[M], e;void init() { memset(fst, -1, sizeof fs

2016-07-02 16:35:44 588

原创 CodeForces 464D World of Darkraft - 2 (概率)

#include #include #include #include #include #include using namespace std;#define N 100020#define B 800double dp[2][B];int n, k;int main() { scanf("%d%d", &n, &k); dp[0][1] = 0; for

2016-07-02 14:58:27 670

原创 CodeForces 24D Broken robot (三对角矩阵消元）

#include #include #include #include #include #include using namespace std;#define N 1020int n, m, x, y;double dp[N][N];void ele(double x[], double a[], double b[], double c[], double r

2016-07-01 15:45:03 604

原创 CodeForces 494C Helping People (treedp)

#include #include #include #include #include #include using namespace std;#define N 100020int n, q;int a[N];int L[N], R[N];double p[N];int ord[N];int stk[N], top;vector adj[N];int

2016-07-01 15:43:47 492

yamiedie_