Decomposition Reaction Solution || Codechef Starters - 29

           

Decomposition Reaction Solution 

Codechef Starters - 29

Problem Code : DCP

Problem Link : https://www.codechef.com/START29C/problems/DCP

Solution :

#include <bits/stdc++.h>

#define ll long long int

#define ull unsigned long long int

using namespace std;

void solve()

{

    ll M = 1000000007;

    ll n, m;

    cin >> n >> m;

    ll a[n];

    for (ll i = 0; i < n; i++)

    {

        cin >> a[i];

    }

    while (m--)

    {

        ll f, ite;

        cin >> f >> ite;

        for (ll i = 0; i < ite; i++)

        {

            ll t1, t2;

            cin >> t1 >> t2;

            a[t2 - 1] += a[f - 1] * t1;

            a[t2 - 1] = a[t2 - 1] % M;

        }

        a[f - 1] = 0;

    }

    for (ll i = 0; i < n; i++)

    {

        cout << a[i] % M << "\n";

    }

}

int main()

{

    solve();

}