제출 #580184

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

fancyfence

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
const int MOD = 1e9 + 7;
int main(){
	int n;
	cin>>n;
	vl visina, sirina;
	for(int i = 0; i < n; i++){
		ll a;
		cin>>a;
		visina.pb(a);
	}
	for(int i = 0; i < n; i++){
		ll a;
		cin>>a;
		sirina.pb(a);
	}
	ll rez = 0, cur = 0, sum = 0;
	for(int i = 0; i < n; i++){
		if(visina[i] == 1){
			if(cur > 0){
				cur%=MOD;
				rez += (cur * (cur + 1)) / 2;
				cur = 0;
			}
		}
		else{
			cur+=sirina[i];
			sum += sirina[i];
			sum %= MOD;
			cur%=MOD;
		}
	}
	sum %= MOD;
	rez += (sum *(sum + 1)) /2;
	cout<<rez<<endl;
}

• 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