oj.uz

답안 #302361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302361 2020-09-18T16:00:08 Z errorgorn Fancy Fence (CEOI20_fancyfence) C++14
100 / 100
 30 ms 4608 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int MOD=1000000007;

ll fix(ll i){
	i%=MOD;
	if (i<0) i+=MOD;
	return i;
}

ll nC2(ll i){
	return i*(i+1)/2%MOD;
}

ll calc(ll lo,ll hi,ll len){
	//cout<<lo<<" "<<hi<<" "<<len<<endl;
	return nC2(len)*(nC2(hi)-nC2(lo))%MOD;
}

int n;
ll h[100005];
ll w[100005];
vector<int> stk;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n;
	rep(x,1,n+1) cin>>h[x];
	rep(x,1,n+1){
		cin>>w[x];
		w[x]=(w[x-1]+w[x])%MOD;
	}
	
	stk.push_back(0);
	
	ll ans=0;
	rep(x,1,n+1){
		while (h[stk.back()]>h[x]){
			int temp=h[stk.back()];
			stk.pop_back();
			ans+=calc(max(h[stk.back()],h[x]),temp,fix(w[x-1]-w[stk.back()]));
		}
		stk.push_back(x);
	}
	
	while (sz(stk)>1){
		int temp=h[stk.back()];
		stk.pop_back();
		ans+=calc(h[stk.back()],temp,fix(w[n]-w[stk.back()]));
	}
	
	cout<<fix(ans)<<endl;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 11 ms 1920 KB Output is correct
4 Correct 21 ms 3712 KB Output is correct
5 Correct 21 ms 3456 KB Output is correct
6 Correct 21 ms 3200 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 13 ms 2432 KB Output is correct
4 Correct 26 ms 4472 KB Output is correct
5 Correct 29 ms 4608 KB Output is correct
6 Correct 1 ms 384 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 14 ms 2432 KB Output is correct
5 Correct 28 ms 4472 KB Output is correct
6 Correct 30 ms 4608 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 14 ms 2688 KB Output is correct
10 Correct 25 ms 4344 KB Output is correct
11 Correct 26 ms 4472 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1920 KB Output is correct
12 Correct 22 ms 3840 KB Output is correct
13 Correct 21 ms 3456 KB Output is correct
14 Correct 21 ms 3200 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 896 KB Output is correct
17 Correct 13 ms 2432 KB Output is correct
18 Correct 27 ms 4472 KB Output is correct
19 Correct 29 ms 4608 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 3 ms 768 KB Output is correct
22 Correct 14 ms 2560 KB Output is correct
23 Correct 25 ms 4352 KB Output is correct
24 Correct 26 ms 4480 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 14 ms 2048 KB Output is correct
33 Correct 14 ms 2176 KB Output is correct
34 Correct 26 ms 3704 KB Output is correct
35 Correct 27 ms 3712 KB Output is correct
36 Correct 27 ms 3840 KB Output is correct
37 Correct 26 ms 3840 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 26 ms 3832 KB Output is correct
40 Correct 26 ms 3840 KB Output is correct
41 Correct 26 ms 3960 KB Output is correct
42 Correct 26 ms 4216 KB Output is correct