oj.uz

Submission #946072

# Submission time Handle Problem Language Result Execution time Memory
946072 2024-03-14T09:57:18 Z hmm789 Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
 1 ms 348 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, ans = 0, cur = 0, sm = 0;
	cin >> n;
	int h[n], w[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++) {
		if(h[i] == 2) cur += w[i];
		else {
			ans += cur*(cur-1) % MOD;
			ans %= MOD;
			cur = 0;
		}
		sm += w[i];
	}
	ans += cur*(cur-1) % MOD;
	ans %= MOD;
	ans += sm*(sm-1)/2 % MOD;
	cout << ans%MOD;
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -