oj.uz

답안 #945756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945756 2024-03-14T07:23:13 Z kxd Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 28 ms 7008 KB 
#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;
const int mod = 1e9+7;

int h[N], w[N];

int f(int x) {
	return (x*(x+1)/2)%mod;
}

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n;
	cin >> n;
	forn(i,n) cin >> h[i];
	forn(i,n) cin >> w[i];
	int ans = 0;
	int sum = 0;
	stack<tuple<int,int,int>> st;
	forn(i,n) {
		ans += f(h[i])*f(w[i]) % mod;
			ans %= mod;
		int m = 0;
		while (st.size() && get<0>(st.top()) >= h[i]){
			auto [h,w,p] = st.top();
			st.pop();
			m += w;
				m %= mod;
			sum = (sum-p + mod);
				sum %= mod;
		}
		ans += sum*w[i] %mod;
			ans %= mod;
		ans += m*f(h[i])%mod * w[i]%mod;
			ans %= mod;
		m += w[i];
			m %= mod;
		int t = m*f(h[i]);
			t %= mod;
		sum += t;
			sum %= mod;
		st.push({h[i], m, t});
	}
	cout << ans %mod;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2400 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 8 ms 2520 KB Output is correct
4 Correct 15 ms 3932 KB Output is correct
5 Correct 18 ms 3956 KB Output is correct
6 Correct 14 ms 3932 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 18 ms 2812 KB Output is correct
5 Correct 19 ms 2652 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2552 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Correct 14 ms 2652 KB Output is correct
5 Correct 17 ms 2652 KB Output is correct
6 Correct 18 ms 2768 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 9 ms 3188 KB Output is correct
10 Correct 17 ms 5212 KB Output is correct
11 Correct 18 ms 5212 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct

Subtask #6
18.0 / 18.0

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

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2512 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2548 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2400 KB Output is correct
11 Correct 8 ms 2656 KB Output is correct
12 Correct 15 ms 3936 KB Output is correct
13 Correct 18 ms 3912 KB Output is correct
14 Correct 18 ms 3984 KB Output is correct
15 Correct 1 ms 2548 KB Output is correct
16 Correct 3 ms 2800 KB Output is correct
17 Correct 11 ms 3724 KB Output is correct
18 Correct 18 ms 4556 KB Output is correct
19 Correct 19 ms 4860 KB Output is correct
20 Correct 1 ms 2400 KB Output is correct
21 Correct 3 ms 2912 KB Output is correct
22 Correct 12 ms 4164 KB Output is correct
23 Correct 18 ms 7008 KB Output is correct
24 Correct 28 ms 7008 KB Output is correct
25 Correct 1 ms 2404 KB Output is correct
26 Correct 1 ms 2528 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2404 KB Output is correct
29 Correct 1 ms 2404 KB Output is correct
30 Correct 2 ms 2664 KB Output is correct
31 Correct 2 ms 2664 KB Output is correct
32 Correct 9 ms 3428 KB Output is correct
33 Correct 12 ms 3616 KB Output is correct
34 Correct 22 ms 4444 KB Output is correct
35 Correct 22 ms 4412 KB Output is correct
36 Correct 21 ms 4536 KB Output is correct
37 Correct 19 ms 4536 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 18 ms 4580 KB Output is correct
40 Correct 28 ms 4672 KB Output is correct
41 Correct 21 ms 4944 KB Output is correct
42 Correct 19 ms 5956 KB Output is correct