oj.uz

Submission #445024

# Submission time Handle Problem Language Result Execution time Memory
445024 2021-07-16T09:26:25 Z fuad27 Fancy Fence (CEOI20_fancyfence) C++14
12 / 100
 5 ms 304 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define int long long
long long bin(long long x){
	x %= mod;
    return ((x*(x+1))/2)%mod;
}
long long rec(long long x, long long y){
    return (bin(x)*bin(y))%mod;
}

int32_t main () {
	int n;
	cin >> n;
	ll ans = 0;
	vector<int> h;
	for(int i = 0;i<n;i++) {
		int hi;
		cin >> hi;
		h.push_back(hi);
	}
	for(int i = 0;i<n;i++) {
		int w;cin>>w;
	}
	for(int i = 0;i<n;i++) {
		int MIN = h[i];
		for(int j = i+1;j<=n;j++) {
			MIN = min(MIN, h[j - 1]);
			ans += bin(MIN);
			ans%=mod;
		}
	}
	cout<<ans;
}

Subtask #1
0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 304 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 204 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 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

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