oj.uz

Submission #658119

# Submission time Handle Problem Language Result Execution time Memory
658119 2022-11-12T08:01:05 Z FatihSolak Calvinball championship (CEOI15_teams) C++17
100 / 100
 375 ms 532 KB 
#include <bits/stdc++.h>
#define N 200005
using namespace std;
int a[N];
int maxi[N];
const int mod = 1000007;
void solve(){
    int n;
    cin >> n;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
        maxi[i] = max(maxi[i-1],a[i]);
    }
    vector<int> dp(n+1,1);
    int ans = 0;
    for(int  i = n;i>=1;i--){
        ans = (ans + (long long)(a[i] - 1)*dp[maxi[i-1]])%mod;
        vector<int> ndp(n+1,0);
        for(int j = 1;j<=n;j++){
            ndp[j] = (long long)dp[j] * j%mod;
            if(j+1 <= n)
                ndp[j] = (ndp[j] + dp[j+1])%mod;
        }
        dp = ndp;
    }
    cout << (ans+1)%mod;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 512 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 404 KB Output is correct
2 Correct 98 ms 404 KB Output is correct
3 Correct 87 ms 412 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 508 KB Output is correct
2 Correct 364 ms 468 KB Output is correct
3 Correct 338 ms 532 KB Output is correct