oj.uz

답안 #394235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394235 2021-04-26T08:04:21 Z ak2006 Calvinball championship (CEOI15_teams) C++14
20 / 100
 43 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
    int n;
    cin>>n;

    vl a(n + 1);
    for (int i = 1;i<=n;i++)cin>>a[i];

    vvl dp(n + 1,vl(n + 1));
    ll ans = 0;
    ll mx = 0;

    for (int i = n;i>=1;i--){
        for (int j = n;j>=1;j--){
            if (i == n){dp[i][j] = 1ll * j + 1;continue;}
            dp[i][j] = ((1ll * j)%mod * (dp[i + 1][j])%mod)%mod;
            if (j != n)dp[i][j] = (dp[i][j]%mod + dp[i + 1][j + 1]%mod)%mod;
        }
    }
    for (int i = 1;i<=n;i++){
        if (i != n){
            for (int j = 1;j<a[i];j++){
                ans = (ans%mod + dp[i + 1][max(mx,1ll * j)]%mod)%mod;
            }
        }
        else
            ans = (ans%mod + a[i]%mod)%mod;
        mx = max(mx,a[i]);
    }
    if (ans < 0)ans += mod;
    cout<<ans;
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 8140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 43 ms 65540 KB Execution killed with signal 9

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 38 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 40 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -