oj.uz

답안 #445025

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445025 2021-07-16T09:28:44 Z fuad27 Fancy Fence (CEOI20_fancyfence) C++14
27 / 100
 95 ms 1412 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, sum = 0;
	bool check = false;
	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;
		sum += w;
		sum%=mod;
		if(w != 1)check = 1;
	}
	if(!check and n<=50) {
	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;}
	else cout<<rec(sum, h[0])<<endl;
}

Subtask #1
0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 460 KB Output is correct
3 Correct 43 ms 932 KB Output is correct
4 Correct 95 ms 1412 KB Output is correct
5 Correct 91 ms 1392 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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