oj.uz

답안 #647350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647350 2022-10-02T09:39:36 Z myrcella Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 31 ms 3764 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

int n;
const int maxn  = 1e5+10;

int h[maxn],w[maxn];
stack <pii> q;

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	rep(i,0,n) cin>>h[i];
	rep(i,0,n) cin>>w[i];
	int ans = 0,sum = 0;
	rep(i,0,n) {
		int curw = w[i];
		while (!q.empty() and q.top().fi>=h[i]) {
			inc(curw,q.top().se);
			dec(sum,1ll*q.top().fi*(q.top().fi+1)/2%mod*q.top().se%mod);
	//		debug(sum);
			q.pop();
		}
		q.push({h[i],curw});
		inc(sum,1ll*h[i]*(h[i]+1)/2%mod*curw%mod);
	//	debug(sum);
		inc(ans,1ll*sum*w[i]%mod);
		dec(ans,(1ll*w[i]*(w[i]-1)/2%mod)*(1ll*h[i]*(h[i]+1)/2%mod)%mod);
	//	debug(ans);
	}
	cout<<ans;
	return 0;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 9 ms 1236 KB Output is correct
4 Correct 18 ms 2180 KB Output is correct
5 Correct 24 ms 2324 KB Output is correct
6 Correct 20 ms 2172 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 10 ms 720 KB Output is correct
4 Correct 21 ms 1028 KB Output is correct
5 Correct 28 ms 1092 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 300 KB Output is correct
4 Correct 11 ms 632 KB Output is correct
5 Correct 21 ms 1020 KB Output is correct
6 Correct 28 ms 1108 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 12 ms 852 KB Output is correct
10 Correct 20 ms 1848 KB Output is correct
11 Correct 23 ms 1816 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 9 ms 1236 KB Output is correct
12 Correct 18 ms 2180 KB Output is correct
13 Correct 18 ms 2124 KB Output is correct
14 Correct 18 ms 2260 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 11 ms 1580 KB Output is correct
18 Correct 22 ms 2960 KB Output is correct
19 Correct 31 ms 3124 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 13 ms 1876 KB Output is correct
23 Correct 22 ms 3680 KB Output is correct
24 Correct 22 ms 3764 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 3 ms 576 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 13 ms 1524 KB Output is correct
33 Correct 16 ms 1612 KB Output is correct
34 Correct 30 ms 2728 KB Output is correct
35 Correct 23 ms 2764 KB Output is correct
36 Correct 23 ms 2932 KB Output is correct
37 Correct 23 ms 3036 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 22 ms 3012 KB Output is correct
40 Correct 23 ms 2956 KB Output is correct
41 Correct 24 ms 3036 KB Output is correct
42 Correct 23 ms 3420 KB Output is correct