제출 #732144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732144		GrindMachine	Calvinball championship (CEOI15_teams)	C++17	70 / 100	1073 ms	1712 KiB

teams

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1000007;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n + 5);
    rep1(i, n) cin >> a[i];

    assert(a[1] == 1);

    vector<vector<ll>> dp1(n + 5, vector<ll>(2));
    dp1[1][1] = 1;

    for (int i = 2; i <= n; ++i) {
        vector<vector<ll>> dp2(n + 5, vector<ll>(2));
        ll d = a[i];

        rep1(j, n + 1) {
            rep(t, 2) {
                // < d
                {
                    ll cnt = min((ll) j, d - 1);
                    dp2[j][0] = (dp2[j][0] + dp1[j][t] * cnt) % MOD;

                    if (j + 1 < d) {
                        dp2[j + 1][0] = (dp2[j + 1][0] + dp1[j][t]) % MOD;
                    }
                }

                // = d
                if (d <= j) {
                    dp2[j][t] = (dp2[j][t] + dp1[j][t]) % MOD;
                }
                else if (d == j + 1) {
                    dp2[j + 1][t] = (dp2[j + 1][t] + dp1[j][t]) % MOD;
                }

                // > d
                if (!t) {
                    ll cnt = j - min((ll) j, d);
                    dp2[j][0] = (dp2[j][0] + dp1[j][t] * cnt) % MOD;

                    if (j + 1 > d) {
                        dp2[j + 1][0] = (dp2[j + 1][0] + dp1[j][t]) % MOD;
                    }
                }
            }
        }

        dp1 = dp2;
    }

    ll ans = 0;
    rep1(j, n + 1) {
        rep(t, 2) {
            ans = (ans + dp1[j][t]) % MOD;
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10