Submission #3246696

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

int f(ll x){
    int cnt = 0;
    while (x) {
        x >>= 1;
        ++cnt;
    }
    return cnt;
}

ll solve(int N, int K, vector<ll>& a) {
    sort(ALL(a));
    vi ca(N);
    rep(i,N) ca[i] = f(a[i]);
    int S = ca.back();
    int shallow = ca[0];
#ifdef DEBUG
    fprintf(stderr, "N=%d, S=[%d %d], K=min(%d, %d)\n", N, shallow, S, K, S * N);
#endif
    K = min(K, S*N); // 60x50=3000
#ifdef DEBUG
    cerr << ca << endl;
#endif

    // ll ans = 0;
    vector<vll> dp(2, vll(K+1, 0));
    dp[0][0] = 1;
    int last = 0;
    rep(z, N) {
        int mx = ca[z];
#ifdef DEBUG
        cerr << z << dp << endl;
#endif
        vector<vll> dp2(2, vll(K+1, 0));

        for (int i=0; i<=last; ++i) {
            for (int j=i; j<=i+mx; ++j) {
                if (j > K) break;
                if (j == i+mx) {
                  dp2[1][j] = ADD(dp2[1][j], dp[0][i]);
                  dp2[1][j] = ADD(dp2[1][j], dp[1][i]);
                } else {
                  dp2[0][j] = ADD(dp2[0][j], dp[0][i]);

                  dp2[1][j] = ADD(dp2[1][j], dp[1][i]);
                }
                // int t = min(j - i, ca[z]);
                // dp2[j] = ADD(dp2[j], MUL(dp[i], 1+t));
            }
        }
        dp = dp2;
        last = min(K, last+mx);
#ifdef DEBUG
        cerr << N << dp << endl;
#endif
    }

    ll ans = 0;
    ans = ADD(ans, dp[0][K]);
    rep(i, K+1) {
        ans = ADD(ans, dp[1][i]);
    }
    return ans;
}

int main() {
    int N, K; cin >> N >> K;
    vector<ll> a(N);
    rep(i,N) cin >> a[i];
    cout << solve(N,K,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 半分
User naoya_t
Language C++14 (GCC 5.4.1)
Score 500
Code Size 3360 Byte
Status
Exec Time 19 ms
Memory 384 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
All 500 / 500 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01.txt 1 ms 256 KB
02.txt 10 ms 256 KB
03.txt 17 ms 384 KB
04.txt 19 ms 384 KB
05.txt 17 ms 384 KB
06.txt 18 ms 384 KB
07.txt 18 ms 384 KB
08.txt 15 ms 384 KB
09.txt 18 ms 384 KB
10.txt 18 ms 384 KB
11.txt 1 ms 256 KB
12.txt 1 ms 256 KB
13.txt 1 ms 256 KB
14.txt 1 ms 256 KB
15.txt 1 ms 256 KB
16.txt 2 ms 256 KB
17.txt 6 ms 384 KB
18.txt 6 ms 256 KB
19.txt 6 ms 384 KB
20.txt 8 ms 256 KB
21.txt 7 ms 384 KB
22.txt 5 ms 256 KB
23.txt 6 ms 384 KB
24.txt 6 ms 256 KB
25.txt 5 ms 256 KB
26.txt 5 ms 256 KB
27.txt 6 ms 256 KB
28.txt 14 ms 384 KB
29.txt 14 ms 384 KB
30.txt 1 ms 256 KB
31.txt 1 ms 256 KB
32.txt 1 ms 256 KB
sample-01.txt 1 ms 256 KB
sample-02.txt 1 ms 256 KB
sample-03.txt 1 ms 256 KB
sample-04.txt 1 ms 256 KB