Codeforces div2 D. Madoka and The Corruption Scheme

组合数学题

题意： 给定两个数n,k，共有2^n位选手进行2^k场淘汰赛，比赛方可以改变k场比赛的结果，要求最大化的最小值是多少。

思路：先看特殊情况当k>n时，比赛方可以控制最大序号的选手直接赢得比赛（因为每一位选手只进行k场比赛）因此ans=2^n。

由于越大的总是被安排的失败的次数越多，因此，k每增加一就是使得Ck+1,n的选手被改变比赛淘汰，即ans增加Ck+1,n因此，我们从k+1,枚举到n，计算最小值的减少过程，最后即是ans

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
ll fact[N], infact[N];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll mod) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

inline void init() { 
    fact[0] = infact[0] = 1;
    pre(i, 1, 100000) {
        fact[i] = fact[i - 1] * i % MOD;;
        infact[i] = infact[i - 1] * qmi(i, MOD - 2, MOD) % MOD;
    }
}

ll C(int a, int b)
{
    return fact[b] * infact[a] % MOD * infact[b - a] % MOD;
}

void slove()
{
    cin >> n >> k;
    ll ans = qmi(2, n, MOD);
    if (k >= n) { cout << qmi(2,n,MOD) << endl; return; }

    pre(i, k + 1, n)
        ans = ((ans - C(i, n) + MOD) % MOD);
    cout << ans << Endl;
}

signed main()
{
    int _;
    //si(_);
    _ = 1;
    init();
    while (_--)
    {
        slove();
    }
    return 0;
}