Submission #1121850

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121850		vjudge1	Calvinball championship (CEOI15_teams)	C++17	0 / 100	1061 ms	516 KiB

teams

// Author: RufatM
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1e9+7
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int,int>
#define pb push_back
#define pii pair<ll,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll solve(int n, vector<int>& teams) {
    ll day = 0;
    int max_team = *max_element(all(teams));
    for(int i = 0; i < n; i++) {
        for(int j = 1; j < teams[i]; j++) {
            vector<int> used(max_team + 2);
            for(int k = 0; k < i; k++) {
                used[teams[k]] = 1;
            }
            used[j] = 1;
            ll cnt = 1;
            int avail = max_team + (j > max_team);
            for(int k = i + 1; k < n; k++) {
                cnt = (cnt * avail) % MOD;
            }
            day = (day + cnt) % MOD;
        }
        if(teams[i] > max_team) break;
    }
    return (day + 1) % MOD; 
}
signed main() {
    fastio;
    int n;
    cin >> n;
    vector<int> teams(n);
    for(int i = 0; i < n; i++) {
        cin >> teams[i];
    }
    cout << solve(n, teams) << '\n';
}

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