oj.uz

Submission #117646

# Submission time Handle Problem Language Result Execution time Memory
117646 2019-06-17T03:47:57 Z minhtung0404 Calvinball championship (CEOI15_teams) C++17
100 / 100
 217 ms 640 KB 
//https://oj.uz/problem/view/CEOI15_teams

#include<bits/stdc++.h>
const int N = 1e4 + 5;
const int mod = 1e6 + 7;
using namespace std;

int n, a[N], f[N], g[N], cur[N], ans;

void add(int&a, int b){
    a += b; if (a >= mod) a -= mod; if (a < 0) a += mod;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        cur[i] = max(cur[i-1], a[i]);
    }
    for (int i = 0; i <= n; i++) f[i] = 1;
    for (int i = n; i >= 1; i--){
        add(ans, 1LL * f[cur[i-1]] * (a[i]-1) % mod);
        for (int j = 0; j <= n; j++) g[j] = (1LL * f[j] * j + f[j+1]) % mod;
        for (int j = 0; j <= n; j++) f[j] = g[j];
    }
    add(ans, 1);
    cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 320 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 568 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 484 KB Output is correct
2 Correct 57 ms 488 KB Output is correct
3 Correct 57 ms 504 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 640 KB Output is correct
2 Correct 214 ms 632 KB Output is correct
3 Correct 214 ms 632 KB Output is correct