제출 #389529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
389529		wiwiho	Binary Subsequences (info1cup17_binary)	C++14	12.90 / 100	64 ms	31784 KiB

binary

#include <bits/stdc++.h>

#define mp make_pair
#define F first
#define S second
#define eb emplace_back
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;

using pii = pair<int, int>;

const ll MOD = 1000000007;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int sz = 2002;
    vector<vector<ll>> dp(sz + 1, vector<ll>(sz + 1));
    dp[1][1] = 1;
    for(int sum = 2; sum <= sz; sum++){
        for(int i = 1; i < sum; i++){
            int j = sum - i;
            dp[i][i + j] += dp[i][j];
            dp[i][i + j] %= MOD;
            dp[i + j][j] += dp[i][j];
            dp[i + j][j] %= MOD;
        }
    }

    vector<ll> ans(sz + 1);
    for(int i = 1; i <= sz; i++){
        for(int j = 1; i + j <= sz; j++){
            ans[i + j - 2] += dp[i][j];
            ans[i + j - 2] %= MOD;
        }
    }

    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        cout << ans[n] << "\n-1\n";
    }

    return 0;
}

• Subtask 1: 12.9 / 43
• Subtask 2: 0 / 39
• Subtask 3: 0 / 18