oj.uz

답안 #881384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881384 2023-12-01T08:12:20 Z Alish Fancy Fence (CEOI20_fancyfence) C++17
12 / 100
 2 ms 4444 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long int	ll;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;


#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl;
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("connect.in" , "r" , stdin) ; freopen("connect.out" , "w" , stdout);


ll mod = 1e9+7;

ll power(ll a, ll b){

    ll ans=1;
    a%=mod;
    while(b){
        if(b&1) ans=ans*a%mod;
        b>>=1;
        a=a*a%mod;
    }
    return ans;

}


const int N = 1e5+23;
ll pref[N], L[N], R[N];
ll h[N];
ll H[N], W[N], w[N];
int n;
int m;

map<pll, int> vis;

ll C(ll n){
    return n*(n+1)%mod*power(2, mod-2)%mod;
}


int main()
{
    fast_io
    cin>>n;
    for (int i=1; i<=n; i++)cin>>H[i];
    for (int i=1; i<=n; i++) cin>>W[i];

    for (int i=1; i<=n; i++){
        if(H[i]==H[i-1]){
            w[m]+=W[i];
        }
        else{
            m++;
            h[m]=H[i];
            w[m]=W[i];
        }
    }

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


    vector<int> st;

    for (int i=1; i<=m; i++){
        while(!st.empty() && h[st.back()]>=h[i]) st.pop_back();

        if(!st.empty()) L[i]=st.back();
        st.pb(i);

    }
    st.clear();

    for (int i=m; i>0; i--){
        while(!st.empty() && h[st.back()]>=h[i]) st.pop_back();
        if(!st.empty()) R[i]=st.back();
        else R[i]=m+1;
        st.pb(i);
    }

    ll ans=0;
    for (int i=1; i<=m; i++){
        if(vis[{h[i], L[i]}]) continue;
        vis[{h[i], L[i]}]=1;
        ll tool=pref[R[i]-1]-pref[L[i]];
        ll r1=h[i]-max(h[R[i]], h[L[i]]);
        ll r2=max(h[R[i]], h[L[i]]);
        ans=(ans+(C(r1)%mod+ r1*r2%mod)%mod*C(tool)%mod)%mod;

    }

    cout<<ans<<endl;


}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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