제출 #532873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532873		PotheSloth	Fancy Fence (CEOI20_fancyfence)	C++17	0 / 100	1 ms	328 KiB

fancyfence

#include<bits/stdc++.h>
using namespace std;
#define int long long

int n, w, h;
const int mod = (int)1e9+7;
int qexp(int a, int b) {
	a%=mod;
	int res=1;
	while(b){
		if(b&1)res = res*a%mod;
		a = a*a%mod;
		b>>=1;
	}
	return res;
}
int C(int n, int k) {
	int x = 1, y = 1;
	for(int i=0; i<k-1; ++i){
		y*=n-i;
		x*=k-i;
		y%=mod;
		x%=mod;
	}
	return (y*qexp(x,mod-2))% mod;
}
int tri(int intelligence, int yeet){
	return (intelligence*(intelligence-1))*(yeet*(yeet-1))/4%mod;
}
int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=0; i<n; ++i){
		cin>>h;
	}
	for(int i=0; i<n; ++i){
		int l;
		cin>>l;
		w+=l;
	}
	cout<<tri(w, h);
	return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27