Submission #1004581

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004581		Valaki2	Calvinball championship (CEOI15_teams)	C++14	20 / 100	1059 ms	604 KiB

teams

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int mod = 1e9 + 7;

void nxt(vector<int> &v) {
    int n = (int) v.size();
    vector<int> prefmax(n);
    prefmax[0] = 1;
    for(int i = 1; i < n; i++) {
        prefmax[i] = max(prefmax[i - 1], v[i]);
    }
    if(prefmax[n - 1] == n) {
        // 1 2 3 ... n
        return;
    }
    for(int i = n - 1; i >= 0; i--) {
        if(prefmax[i - 1] >= v[i]) {
            v[i]++;
            return;
        }
        v[i] = 1;
    }
}

void solve() {
    int n;
    cin >> n;
    vector<int> v(n, 1);
    vector<int> goal(n);
    for(int i = 0; i < n; i++) {
        cin >> goal[i];
    }
    int ans = 0;
    ans++;
    while(v != goal) {
        nxt(v);
        ans++;
    }
    ans %= mod;
    cout << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 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