oj.uz

답안 #503390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503390 2022-01-07T19:18:07 Z MasterTaster Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 100010
#define MOD 1000000007

using namespace std;

ll two=500000004; //inv
ll n, dp[MAXN], pos[MAXN], h[MAXN], w[MAXN], pref[MAXN], ress;

ll add(ll x, ll y)
{
    ll ret=x+y;
    if (ret>=MOD) ret-=MOD;
    return ret;
}
ll mul(ll x, ll y)
{
    ll ret=x*y;
    if (ret>=MOD) ret%=MOD;
    return ret;
}
ll sum(ll x, ll y)
{
    ll ret=mul(mul(y, y+1), two);
    ret-=mul(mul(x-1, x), two);
    if (ret<0) ret+=MOD;
    return ret;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n;
    for (int i=1; i<=n; i++) cin>>h[i];
    for (int i=1; i<=n; i++) cin>>w[i];


    stack<pii> st;
    st.push({0, -1});
    for (int i=1; i<=n; i++)
    {
        while (st.top().xx>h[i]) st.pop();
        pos[i]=st.top().yy;
        st.push({h[i], i});
    }

    pref[0]=0;
    for (int i=1; i<=n; i++) pref[i]=pref[i-1]+w[i];

    ll x, y;
    x=sum(1, w[1]);
    y=sum(1, h[1]);
    dp[1]=mul(x, y);
    for (int i=2; i<=n; i++)
    {
        int ind=pos[i];

        //cout<<"ee "<<sum(pref[i-1]+1, pref[i])<<endl;
        x=sum(pref[i-1]+1, pref[i]);
        y=mul(mul(h[ind], h[ind]+1), two);
        dp[i]=add(dp[i], mul(x, y));
        //cout<<dp[i]<<endl;

        x=sum(pref[i-1]+1-pref[ind], pref[i]-pref[ind]);
        y=sum(h[ind]+1, h[i]);
        dp[i]=add(dp[i], mul(x, y));
        //cout<<dp[i]<<endl;


        /*int ind=pos[i];
        dp[i]=muldp[ind];

        cout<<ind<<endl;
        ll cnt=h[i]-h[ind];
        ll temp=mul(mul(mul(cnt, cnt+1), two), (pref[i-1]-pref[ind]));

        dp[i]=add(dp[i], temp);
        dp[i]=mul(dp[i], w[i]);

        ll x, y;
        x=mul(mul(h[i], h[i]+1), two);
        y=mul(mul(w[i], w[i]+1), two);
        dp[i]=add(dp[i], mul(x, y));*/
    }

    for (int i=1; i<=n; i++) { ress+=dp[i]; /*cout<<dp[i]<<" ";*/ }
    //cout<<endl;

    cout<<ress;
}
/*

3
1 2 1
1 2 3

*/

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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