Submission #899548

#	Time	Username	Problem	Language	Result	Execution time	Memory
899548		themm1	Calvinball championship (CEOI15_teams)	C++17	20 / 100	512 ms	604 KiB

teams

#include <bits/stdc++.h>
using namespace std;
// ordered set whith s.order_of_key(x) method, which returns rank of element x in set s
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/

// pair printing
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "(" << par.first << "; " << par.second << ")"; return out;}
// set printing
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// map printing
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// unordered_set printing
template <class T>
ostream& operator<<(ostream& out, const unordered_set<T> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// unordered_map printing
template <class T, class U>
ostream& operator<<(ostream& out, const unordered_map<T, U> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// vector printing
template<class T>
ostream& operator<<(ostream& out, const vector<T> &cont){ out << "[";  for (const auto &x:cont) out << x << ", ";  out << "]"; return out;}

#define print(x) cout << (x) << endl;
#define dmp(x) cerr << #x << " = " << x << endl
#define dmpn(x) cerr << #x << " = " << x << "; "
#define dmpl(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << endl

#define int long long
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define contains(s,x) ((s).find(x) != (s).end())
const int MOD = 1e6 + 7;

/* Returns a^b % MOD. O(log(B)) */
int fast_pow(int a, int b) {
        int ans = 1;
        while (b > 0) {
                if (b % 2 == 1) ans = ((ll)a * (ll)ans) % MOD;
                a = ((ll)a * (ll)a) % MOD;
                b /= 2;
        }
        return ans;
}

int get_smaller_cnt(vector<int> &a, int l, int r, int alph_size) {
        if (l > r) return 0;
        if (r - l == 0) return a[l] - 1;
        int cnt = ((a[l] - 1) * fast_pow(alph_size, r - l)) % MOD;
        return (cnt + get_smaller_cnt(a, l + 1, r, alph_size)) % MOD;
}

void solve() {
        int N;
        cin >> N;
        vector<int> a(N), b;
        for (int i = 0; i < N; i++) cin >> a[i];
        vector<int> first_occs(N + 1, -1);
        for (int i = 0; i < N; i++) if (first_occs[a[i]] == -1) first_occs[a[i]] = i;

        int ans = 1;
        vector<int> dp(N + 1, 0), prev_dp(N + 1, 1);
        for (int k = 2; k <= N && first_occs[k] != -1; k++) {
                for (int i = k; i <= N; i++) {
                        dp[i] = (prev_dp[i - 1] + (dp[i - 1] * k) % MOD) % MOD;
                }
                // dmpn(k); dmp(dp);
                prev_dp = dp;
                ans = (ans + dp[N]) % MOD;
                dp.assign(N + 1, 0);
        }
        cout << ans << endl;
}

int32_t main() {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);

        int t = 1;
        // cin >> t;
        while (t--) {
                solve();
        }
}

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