[BOJ] 2854 문제풀이

Time Lapse :1hour 18min 52sec

2854.cpp

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include <iostream>
#include <algorithm>
using namespace std;
#define MOD 1000000007
int arr1[100001], arr2[100001], n;
long long dp[100001][2];
int main(void) {
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
scanf("%d", &arr1[i]);
for(int i = 1; i < n; ++i)
scanf("%d", &arr2[i]);
dp[0][0] = 1;
for(int i = 1; i <= n; i++) {
dp[i][0] = ((dp[i-1][0] * (arr1[i] + arr2[i-1])) + dp[i-1][1] * (arr1[i] + arr2[i-1] -1))%MOD;
dp[i][1] = (arr2[i] * (dp[i-1][1] +dp[i-1][0])) % MOD;
}
printf("%d\n",dp[n][0]);
}
Author: Song Hayoung
Link: https://songhayoung.github.io/2020/08/22/PS/BOJ/2854/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.