概率
tomjobs
别慌,慌也没用
展开
-
2020ICPC 南京 Fireworks(整数三分+期望)
题意:拿一个鞭炮花nnn时间,点燃之前所有鞭炮花mmm时间。一个鞭炮有p10000\frac{p}{10000}10000p的可能是个好鞭炮。求最少期望时间能点燃好鞭炮。思路:可以想到,肯定是每次放固定数目的鞭炮再点燃,因为只要存在一个固定数目为xxx期望时间少,之后肯定还是放xxx个。那么设放xxx个鞭炮再点燃,能遇到好鞭炮的期望次数为(mid∗n+m)/(1−(1−p)mid))(mid * n + m) / (1 - (1 - p)^{mid}))(mid∗n+m)/(1−(1−p)mid原创 2020-12-25 17:26:18 · 486 阅读 · 0 评论 -
Codeforces1453 D. Checkpoints(DP,期望)
Gildong is developing a game consisting of ???? stages numbered from 1 to ????. The player starts the game from the 1-st stage and should beat the stages in increasing order of the stage number. The player wins the game after beating the ????-th stage.The原创 2020-12-08 17:37:02 · 307 阅读 · 0 评论 -
2020CCPC威海 C Rencontre(树形DP,期望)
Located at the easternmost tip of Shandon Peninsula, Weihai is one of the most famous tourist destinations all over China. There are beautiful hills, seas, bays, springs, islands, and beautiful beaches in Weihai. It is also a coastal city abundant in seafo原创 2020-10-30 14:51:41 · 351 阅读 · 0 评论 -
Knockout Tournament Gym - 101623K(概率)
题意:n个人比赛,要求每一轮两两比赛,每次比赛一个人晋级,晋级概率为a/(a+b),a,b为两个人rating。第一轮可以让一些人直接晋级,使得比赛树为完全二叉树,如图下。求安排比赛方案使得第一个人最终获胜的概率最高。思路:除了第一个人直接按照rating排序,让第一个人尽量与rating小的人比赛,并且要求使得第一个人比赛场次尽可能少。之后就是一个模拟了。这个模拟你可以递归模拟线段树建树过程,也可以直接补全最后一层成为完美二叉树然后再算出f[i][j]f[i][j]f[i][j],表示iii原创 2020-10-09 20:30:12 · 294 阅读 · 0 评论 -
Round F 2020 - Kick Start 2020 Yeetzhee(期望,记忆化搜索)
ProblemPommel is very bored at home so she has invented a new game involving N dice. Each die has the numbers from 1 to M written on it. Whenever she throws a die, it has an equal probability of landing on each of the M possible values.Pommel places all原创 2020-09-27 17:21:32 · 519 阅读 · 0 评论 -
Codeforces1418 E. Expected Damage(概率)
You are playing a computer game. In this game, you have to fight ???? monsters.To defend from monsters, you need a shield. Each shield has two parameters: its current durability ???? and its defence rating ????. Each monster has only one parameter: its st原创 2020-09-16 19:49:17 · 357 阅读 · 6 评论 -
2020 杭电多校第六场 Road To The 3rd Building(期望)
Problem DescriptionBecause of the thriller adventure game The 3rd Building, there are fewer and fewer students who would like to go to the 3rd Building. So few students are working in the studio in the 3rd Building. Students are even more reluctant to go原创 2020-08-07 00:57:27 · 348 阅读 · 0 评论 -
2020杭电多校第六场 Expectation(期望,基尔霍夫矩阵)
Problem DescriptionYou are given an undirected graph consisting of n vertices with m weighted edges. We define the weight of a spanning tree as the bitwise AND of all edges’ weight in spanning tree.Now select a spanning tree randomly, you should calculat原创 2020-08-07 00:31:58 · 383 阅读 · 0 评论 -
2020杭电多校第五场 Tetrahedron(直角三棱锥,概率)
题意:就是在[1,n][1,n][1,n]随机给出直角三棱锥的直角边a,b,c,求1h2\frac{1}{h^2}h21的期望值。可以用海伦公式(推到后面很麻烦了。。我直接百度了公式)算出1h2=1a2+1b2+1c2\frac{1}{h^2}=\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}h21=a21+b21+c21那么实际上就是算∑1a2n∗3\frac{∑\frac{1}{a^2}}{n}*3n∑a21∗3#include<iostr.原创 2020-08-05 13:55:58 · 250 阅读 · 0 评论 -
2020杭电多校第五场 Paperfolding(折纸,组合数学)
Problem DescriptionThere is a piece of paper in rectangular shape with sufficient length and width (lay flat on the table). Execute an operation instruction according to a string of length n from left to right that only contains 4 different characters of原创 2020-08-05 13:45:48 · 417 阅读 · 0 评论 -
2020杭电多校第五场 Set1(组合数学,概率)
Problem DescriptionYou are given a set S={1…n}. It guarantees that n is odd. You have to do the following operations until there is only 1 element in the set:Firstly, delete the smallest element of S. Then randomly delete another element from S.For each原创 2020-08-05 13:32:11 · 552 阅读 · 2 评论 -
2020百度之星初赛第三场 Ant(概率)
Problem Description有一棵 n 个节点的石榴树,点的下标为 1…n,下标为 m 的节点上有一颗石榴。石榴树有 2n−2 条有向边,每条有向边都连接两个不同的节点,不存在完全相同的两条有向边,且如果从节点 a 到节点 b 的有向边存在,反过来从节点 b 到节点 a 的有向边也必定存在。从任意一个节点都能(经过这些有向边中的若干条)到达任意一个其它节点。现在有两只小蚂蚁去找石榴。两只小蚂蚁都从 1 号点出发,第一只蚂蚁先走。它每次会从它当前所在的节点出发的没有走过的有向边中等概率地选择一原创 2020-07-30 10:42:01 · 353 阅读 · 0 评论 -
牛客多校第六场 Binary Vector(线性代数,线性相关,概率)
题意:f(n)f(n)f(n)代表生成nnn个nnn维向量线性不相关的概率。求f(1) xor f(2) xor f(3)... xor f(n)f(1)\;xor\;f(2)\;xor\;f(3)...\;xor\;f(n)f(1)xorf(2)xorf(3)...xorf(n)的值思路:线代就考试的时候应付了一下,感觉还是很重要的。本题的加法是异或,其实没有影响。向量矩阵因为高斯消元以后每一维度的数只出现在一个行上,不需要考虑相加异或。线性相关的定义为存在一组不全为0的k满足下.原创 2020-07-28 19:56:02 · 360 阅读 · 0 评论 -
2020百度之星初赛一 Rotate(期望)
Problem Description我们有一个圈,从内到外一共被分成了 nn 个环,中间是空的。我们把从外到内第 ii 层环平分成 a[i]a[i] 份,其中 a[i]a[i] 是偶数,我们把这 a[i]a[i] 份黑白染色,第奇数个染成黑色,第偶数个染成白色。现在我们旋转每一层,每一层都会等概率随机到一个中止位置。问黑色的联通块数目的期望。两块黑色的区域有交点即算联通。层之间的旋转是相互独立的。Input第一行一个正整数 test(1 \le test \le 10)test(1≤test≤原创 2020-07-21 00:09:51 · 559 阅读 · 4 评论 -
B - Bring Your Own Bombs Gym - 100519B(期望,离散化)
A sabotage platoon has completed its mission and planted some bombs on an enemy territory. Now they are about to report to their commanders how many enemy units will be destroyed. They have assigned this task to you.The enemy territory is represented by a原创 2020-07-05 10:57:18 · 269 阅读 · 0 评论 -
Fleecing the Raffle Gym - 101550F(概率)
题意:所有数选p个,但你可以加入a个自己的数。求选到的数中你加入数的个数恰好为1个的概率思路:#include <cstdio>#include <cstring>#include <vector>#include <map>using namespace std;typedef long long ll;const int maxn = 1e7 + 7;double C(int n,int p,int a) { doubl.原创 2020-06-14 23:34:44 · 420 阅读 · 0 评论 -
CF1279 D. Santa's Bot(概率)
Santa Claus has received letters from ???? different kids throughout this year. Of course, each kid wants to get some presents from Santa: in particular, the ????-th kid asked Santa to give them one of ???????? d...原创 2019-12-28 14:02:07 · 501 阅读 · 0 评论