Submission #944808

# Submission time Handle Problem Language Result Execution time Memory
944808 2024-03-13T05:50:18 Z ys2 Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
1000 ms 2648 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, h[1000001], w[1000001], ans, mod=(10e9)+7, totalw;
signed main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	cin>>n;
	for (int i=0; i<n; i++){
		cin>>h[i];
	}
	for (int i=0; i<n; i++){
		cin>>w[i];
		totalw+=w[i];
	}
		for (int i=1; i<=totalw; i++){
			ans+=i;
			ans%=mod;
		}
	
	if (h[0]==2){
		ans=ans*3;
	}
	ans%=mod;
		
	/*for (int i=1; i<=h[0]; i++){
		ans+=i;
	}
	if (w[0]!=1){
	ans+=h[0]*3*(w[0]-1)-1;
	ans%=mod;
}
	for (int i=1; i<n; i++){
		ans+=3*w[i]*h[i]-1;
		ans%=mod;
	}*/
	cout<<ans;	
	return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -