oj.uz

Submission #946043

# Submission time Handle Problem Language Result Execution time Memory
946043 2024-03-14T09:51:01 Z hmm789 Fancy Fence (CEOI20_fancyfence) C++14
30 / 100
 1000 ms 1628 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];
	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]);
		int mn = h[i];
		for(int j = i-1; j >= 0; j--) {
			mn = min(mn, h[j]);
			num = w[i]*w[j] % MOD;
			num2 = (mn+1)*mn/2 % MOD;
			dp[i] += num * num2 % MOD;
			dp[i] %= MOD;
		}
	}
	cout << dp[n-1];
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 516 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Execution timed out 1029 ms 1368 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 476 KB Output is correct
2 Correct 336 ms 664 KB Output is correct
3 Execution timed out 1056 ms 1624 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 4 ms 732 KB Output is correct
3 Correct 323 ms 664 KB Output is correct
4 Execution timed out 1074 ms 1628 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 472 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 516 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 4 ms 368 KB Output is correct
11 Execution timed out 1035 ms 1372 KB Time limit exceeded
12 Halted 0 ms 0 KB -