oj.uz

답안 #946366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946366 2024-03-14T14:41:58 Z Xiaoyang Fancy Fence (CEOI20_fancyfence) C++17
30 / 100
 19 ms 5204 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define fi first 
#define se second 
#define pll pair<ll,ll>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl;
#define MP make_pair
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define SZ(x) (ll)x.size()
#define ALL(x) x.begin(),x.end()
#define endl "\n"
const ll inf=1e18;
ll lowbit(ll x){return x&(-x);}



const ll mod=1e9+7;
ll c2(ll x){
	return (x*(x-1)/2)%mod;
}
ll rect(ll x,ll y){
	ll xx=(x*(x+1)/2)%mod;
	ll yy=(y*(y+1)/2)%mod;
	return (xx*yy)%mod;
}

const ll maxn=1e5+5;
ll h[maxn],w[maxn],pre[maxn];

ll inc(ll &a,ll b){return a=(a+b)%mod;}
ll dec(ll &a,ll b){return a=(a-b+mod)%mod;}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n;cin>>n;
	ll sum=0,ans=0;
	rep(i,1,n+1)cin>>h[i];
	rep(i,1,n+1)cin>>w[i];
	
	
	stack<ll>s;
	//monotonically increasing stack 
	rep(i,1,n+1){
		while(!s.empty() and h[i]<=s.top()){
			dec(sum,(c2(h[s.top()]+1)*pre[s.top()])%mod);
			inc(pre[i],pre[s.top()]);
			s.pop();
		}
		s.push(i);
		inc(sum,(c2(h[i]+1)*pre[i])%mod);
		inc(ans,rect(h[i],w[i]));
		inc(ans,(sum*w[i])%mod);
		inc(sum,(c2(h[i]+1)*w[i])%mod);
		
		inc(pre[i],w[i]);
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 9 ms 3672 KB Output is correct
4 Correct 18 ms 4928 KB Output is correct
5 Correct 18 ms 4948 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 3592 KB Output is correct
5 Correct 18 ms 4888 KB Output is correct
6 Correct 18 ms 4700 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 3 ms 2716 KB Output is correct
9 Correct 12 ms 3676 KB Output is correct
10 Correct 18 ms 4700 KB Output is correct
11 Correct 19 ms 5204 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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