oj.uz

Submission #1004581

# Submission time Handle Problem Language Result Execution time Memory
1004581 2024-06-21T10:02:08 Z Valaki2 Calvinball championship (CEOI15_teams) C++14
20 / 100
 1000 ms 604 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 379 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1059 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1059 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1031 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1016 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1024 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -