oj.uz

Submission #746967

# Submission time Handle Problem Language Result Execution time Memory
746967 2023-05-23T09:52:08 Z vjudge1 Calvinball championship (CEOI15_teams) C++14
100 / 100
 251 ms 716 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
vector<int>A(10001,-1),B(10001,-1);
int slv(int a,int b){
    if(b==0)return A[a]=1;
    return A[a]=(B[a+1]+B[a]*a)%1000007;
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    int arr[n];
    for(auto &i:arr)cin>>i;
    int ans=1;
    int mx[n];
    for(int i=0;i<n;i++)mx[i]=max((i==0?0:mx[i-1]),arr[i]);
    for(int i=n-1;i>=0;i--){
        for(int w=1;w<=n;w++)slv(w,n-i-1);
        ans+=(slv((i==0?1:mx[i-1]),n-i-1)*(arr[i]-1))%1000007;
        ans%=1000007;
        B=A;
    }
    cout<<ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 484 KB Output is correct
2 Correct 66 ms 484 KB Output is correct
3 Correct 68 ms 552 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 716 KB Output is correct
2 Correct 237 ms 640 KB Output is correct
3 Correct 251 ms 596 KB Output is correct