oj.uz

Submission #942380

# Submission time Handle Problem Language Result Execution time Memory
942380 2024-03-10T14:40:17 Z batsukh2006 Fancy Fence (CEOI20_fancyfence) C++17
15 / 100
 21 ms 5212 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
 
using namespace std;
 
#define MOD 1000000007
#define int long long
#define endl '\n'
int cal(int a, int b){
    int f=(a*(a+1))%MOD*((MOD+1)/2)%MOD;
    int s=(b*(b+1))%MOD*((MOD+1)/2)%MOD;
    return (f*s)%MOD;
}
void solve(){
    int n; cin>>n;
    vector<int> pref(n+1);
    vector<int> h(n+1),w(n+1);
    for(int i=1; i<=n; i++) cin>>h[i];
    for(int i=1; i<=n; i++) cin>>w[i];
    vector<int> up(n+1),dw(n+2);
    for(int i=1; i<=n; i++) up[i]=(up[i-1]+w[i])%MOD;
    for(int i=n; i>=1; i--) dw[i]=(dw[i+1]+w[i])%MOD;
    stack<int> f;
    f.push(0);
    int ans=0;
    for(int i=1; i<=n; i++){
        while(f.size()>1&&h[f.top()]>=h[i]) f.pop();
        ans=(ans+cal(up[i]-up[f.top()],h[i]))%MOD;
        ans=(ans-cal(up[i]-up[f.top()]-w[i],h[i])+MOD)%MOD;
        f.push(i);
    }
    stack<int> s;
    s.push(n+1);
    int cur=0;
    for(int i=n; i>=1; i--){
        while(s.size()>1&&h[s.top()]>=h[i]) s.pop();
        if(h[i]==h[i+1]) cur=(cur+w[i])%MOD;
        else cur=w[i];
        if(dw[i]-dw[s.top()]!=cur){
            ans=(ans-cal(cur,h[i])+MOD)%MOD;
            ans=(ans+cal(dw[i]-dw[s.top()],h[i]))%MOD;
            ans=(ans-cal(dw[i]-dw[s.top()]-w[i],h[i])+MOD)%MOD;
        }
        s.push(i);
    }
    cout<<ans;
}
signed main(){
	// freopen("hps.in", "r", stdin);
	// freopen("hps.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t=1;
	// cin>>t;
	while(t--){
		solve();
		cout<<endl;
	}
	return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 10 ms 2396 KB Output is correct
4 Correct 20 ms 4188 KB Output is correct
5 Correct 21 ms 4184 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 10 ms 2392 KB Output is correct
5 Correct 20 ms 4188 KB Output is correct
6 Correct 21 ms 4356 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 3 ms 688 KB Output is correct
9 Correct 13 ms 2416 KB Output is correct
10 Incorrect 21 ms 5212 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -