oj.uz

답안 #946063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946063 2024-03-14T09:54:43 Z hmm789 Fancy Fence (CEOI20_fancyfence) C++14
30 / 100
 29 ms 3572 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define INF 1000000000000000000
#define MOD 1000000007

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	int h[n], w[n], dp[n];
	for(int i = 0; i < n; i++) cin >> h[i];
	for(int i = 0; i < n; i++) cin >> w[i];
	int pre[n];
	pre[0] = 0;
	for(int i = 0; i < n-1; i++) {
		int num = h[i]*(h[i]+1)/2 % MOD;
		pre[i+1] = pre[i] + w[i]*num % MOD;
		pre[i+1] %= MOD;
	}
	for(int i = 0; i < n; i++) {
		int num = (w[i]+1)*w[i]/2 % MOD, num2 = (h[i]+1)*h[i]/2 % MOD;
		dp[i] = num * num2 % MOD + (i==0?0:dp[i-1]) + (w[i]*pre[i]) % MOD;
		dp[i] %= MOD;
	}
	cout << dp[n-1];
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 688 KB Output is correct
3 Correct 9 ms 1884 KB Output is correct
4 Correct 21 ms 3548 KB Output is correct
5 Correct 29 ms 3420 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 688 KB Output is correct
4 Correct 10 ms 1884 KB Output is correct
5 Correct 23 ms 3560 KB Output is correct
6 Correct 18 ms 3572 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 12 ms 1884 KB Output is correct
10 Correct 27 ms 3572 KB Output is correct
11 Correct 17 ms 3564 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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

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