/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Accepted 2ms 492.0 KiB
#3 Accepted 11ms 604.0 KiB
#4 Accepted 639ms 15.582 MiB
#5 Accepted 1482ms 27.805 MiB
#6 Accepted 1619ms 31.242 MiB
#7 Time Exceeded ≥2031ms ≥97.133 MiB
#8 Time Exceeded ≥2015ms ≥87.562 MiB
#9 Accepted 6ms 1.305 MiB
#10 Time Exceeded ≥2098ms ≥91.07 MiB
#11 Accepted 3ms 360.0 KiB
#12 Time Exceeded ≥2021ms ≥91.441 MiB
#13 Time Exceeded ≥2084ms ≥106.918 MiB
#14 Accepted 514ms 4.762 MiB
#15 Time Exceeded ≥2031ms ≥83.379 MiB
#16 Time Exceeded ≥2010ms ≥88.719 MiB
#17 Time Exceeded ≥2032ms ≥100.246 MiB
#18 Time Exceeded ≥2057ms ≥110.418 MiB
#19 Time Exceeded ≥2018ms ≥97.148 MiB
#20 Accepted 162ms 30.957 MiB
#21 Time Exceeded ≥2060ms ≥88.492 MiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

const int mod = 1e9 + 7;

void solve() {
    int n, k, cnt0 = 0;
    cin >> n >> k;
    vector<bool> v(n);
    for (int i = 0; i < n; i++) {
        bool x; cin >> x;
        v[i] = x;
        cnt0 += x;
    }
    if(cnt0 < k) {
        cout << 0 << endl;
        return;
    }

    map<pair<int, int>, int> dp;
    auto rec = [&](int i, int cnt, auto&& self) -> int {
        if(i == n or cnt < k) return 0;
        auto it = dp.find(make_pair(i, cnt));
        if(it != dp.end()) return it->S;
        int ans = self(i + 1, cnt, self); // not take
        if(v[i]) ans += (cnt - 1 >= k) + self(i + 1, cnt - 1, self);
        else ans += (cnt >= k) + self(i + 1, cnt, self);
        ans %= mod;
        return dp[{i, cnt}] = ans;
    };

    cout << (rec(0, cnt0, rec) + mod) % mod << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1094 Number of ways (Hard version)
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 17:25:22
Judged At
2024-10-03 13:04:22
Judged By
Score
32
Total Time
≥2098ms
Peak Memory
≥110.418 MiB