oj.uz

Submission #881895

# Submission time Handle Problem Language Result Execution time Memory
881895 2023-12-02T08:07:08 Z 1L1YA Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 22 ms 6712 KB 
//1L1YA
#include<bits/stdc++.h>
using namespace std;
#define ll           long long
#define Pb           push_back
#define dokme(x)     cout << x << endl, exit(0)
#define pii          pair<int,int>
#define F            first
#define S            second
#define endl         '\n'
#define sep          ' '
#define all(x)       x.begin(),x.end()
#define FastIO       ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define lc           id<<1
#define rc           lc|1

const ll mod=1e9+7;
const ll oo=4e18;
const int N=1e5+5;
const int lg=23;

ll n,in=(mod+1)/2,h[N],w[N],dp[N],lst[N],sum[N];

ll C(ll x){
    x%=mod;
    return (x*(x-1)%mod*in%mod)%mod;
}

int main(){
    FastIO

    cin >> n;
    for(int i=1;i<=n;i++)
        cin >> h[i];
    for(int i=1;i<=n;i++)
        cin >> w[i],sum[i]=(sum[i-1]+w[i])%mod;
    vector<int> st;
    st.Pb(0);
    for(int i=1;i<=n;i++){
        while(h[i]<=h[st.back()])
            st.pop_back();
        lst[i]=st.back();
        st.Pb(i);
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        ll W=(sum[i]-sum[lst[i]]+mod)%mod;
        ll p=C(W+1);
        p=(p-C((W-w[i]+1+mod)%mod)+mod)%mod;
        ans=(ans+p*C(h[i]+1)%mod)%mod;
        ans=(ans+dp[lst[i]]*w[i]%mod)%mod;
        dp[i]=(W*C(h[i]+1)%mod+dp[lst[i]])%mod;
    }
    cout << ans << endl;

    return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 8 ms 3880 KB Output is correct
4 Correct 19 ms 5720 KB Output is correct
5 Correct 16 ms 5468 KB Output is correct
6 Correct 16 ms 5496 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 10 ms 4320 KB Output is correct
4 Correct 19 ms 6288 KB Output is correct
5 Correct 20 ms 6236 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2932 KB Output is correct
4 Correct 13 ms 4296 KB Output is correct
5 Correct 19 ms 6048 KB Output is correct
6 Correct 19 ms 6172 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 10 ms 4696 KB Output is correct
10 Correct 18 ms 6712 KB Output is correct
11 Correct 19 ms 6616 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2592 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 8 ms 3932 KB Output is correct
12 Correct 15 ms 5468 KB Output is correct
13 Correct 16 ms 5424 KB Output is correct
14 Correct 15 ms 5428 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 10 ms 4376 KB Output is correct
18 Correct 19 ms 6236 KB Output is correct
19 Correct 19 ms 6232 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 2 ms 3036 KB Output is correct
22 Correct 10 ms 4620 KB Output is correct
23 Correct 22 ms 6524 KB Output is correct
24 Correct 19 ms 6624 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2552 KB Output is correct
30 Correct 2 ms 2904 KB Output is correct
31 Correct 3 ms 2908 KB Output is correct
32 Correct 9 ms 4188 KB Output is correct
33 Correct 10 ms 4444 KB Output is correct
34 Correct 18 ms 6000 KB Output is correct
35 Correct 19 ms 5972 KB Output is correct
36 Correct 19 ms 6168 KB Output is correct
37 Correct 20 ms 6224 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 20 ms 6184 KB Output is correct
40 Correct 19 ms 6236 KB Output is correct
41 Correct 20 ms 6360 KB Output is correct
42 Correct 19 ms 6572 KB Output is correct