Competitive_Programming_Solutions/codechef/DBFB.cpp at master · akkaboss/Competitive_Programming_Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82

//https://www.codechef.com/MAY18B/problems/DBFB/
//username-jaydavev

#include<bits/stdc++.h>
#define  la 1000000007
typedef long long int ll;

ll feb[1000000];
using namespace std;
map<ll,ll> F;
ll fibb(ll n)
    {
                for (ll i = 2; i <= n; i++)
        {

            feb[i] = (feb[i-1] + feb[i-2])%la;
        }
        return feb[n];
    }
int main()
{
    ll t,n,i,jam,j,m,jem,jre,jtm;
    cin>>t;
    while(t--)
    {
        vector< pair <ll,ll> >lit;
        jam=0;

        cin>>m>>n;

        vector<ll>b;
        vector<ll>c;

        for(i=0;i<m;i++)
        {
            cin>>jam;
            b.push_back(jam);
        }
            for(i=0;i<m;i++)
        {
            cin>>jam;
            c.push_back(jam);
        }
        jam=0;
    if(n>=3){
                feb[0]=1;
        feb[1]=0;
    jem=fibb(n-1);
            for(i=0;i<m;i++)
        {
            jre=(b[i]*jem)%la;

            jam=(jam+(jre*m)%la)%la;
        }
        feb[0]=0;
        feb[1]=1;
    jem=fibb(n-1);
    for(i=0;i<m;i++)
        {
            jre=(c[i]*jem)%la;
                jam=(jam+(jre*m)%la)%la;
        }
    }
    else
    {
        if(n==1){
        for(i=0;i<m;i++)
        {
            jam=(jam+(b[i]*m)%la)%la;
        }
        }
        else{
                for(i=0;i<m;i++)
        {
                jam=(jam+(c[i]*m)%la)%la;
        }
        }
    }
    cout<<jam<<endl;
}
}