codeforces 1599 C. Bubble Strike

题意

Little Johnny Bubbles enjoys spending hours in front of his computer playing video games. His favorite game is Bubble Strike, fast-paced bubble shooting online game for two players.

Each game is set in one of the N maps, each having different terrain configuration. First phase of each game decides on which map the game will be played. The game system randomly selects three maps and shows them to the players. Each player must pick one of those three maps to be discarded. The game system then randomly selects one of the maps that were not picked by any of the players and starts the game.

Johnny is deeply enthusiastic about the game and wants to spend some time studying maps, thus increasing chances to win games played on those maps. However, he also needs to do his homework, so he does not have time to study all the maps. That is why he asked himself the following question: "What is the minimum number of maps I have to study, so that the probability to play one of those maps is at least P"?

Can you help Johnny find the answer for this question? You can assume Johnny's opponents do not know him, and they will randomly pick maps.

思路

首先n只有1000
当然肯定是看的地图越多越有把握达到p的概率
所以就是暴力做法
一个一个涂色，当然可以二分，这里数剧太小就直接O(3e3)
对于每一局，如果恰好是一个熟悉的地图都没有，那么增加的概率必是0
如果恰好认识一个地图，那么选择另一个不认识的淘汰，有1/2的概率
如果恰好认识两个地图，那么选择另一个不认识的淘汰，必选中熟悉地图
如果三个地图，必选中熟悉地图
这就像高中的超几何分布吧

AC

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;//1e3
double p;//0~1

int C(int x, int t)//Cx^t
{
    ll ret = 1;
    for (int i = 1; i <= t; i++)
        ret *= x - i + 1;
    for (int i = 1; i <= t; i++)
        ret /= i;
    return ret;
}

int main()
{
    cin >> n >> p;
    for (int i = 0; i <= n; i++)
    {
        double ans = 0;
        for (int j = 1; j <= 3; j++)
        {
            int res = C(i, j) * C(n - i, 3 - j);
            if (j == 1)
                ans += res * 0.5;
            if (j >= 2)
                ans += res;
        }
        ans /= C(n, 3);
        if (ans >= p)
            return cout << i << endl, 0;
    }
    return 0;
}