<p>You are given two <strong>sorted</strong> arrays of distinct integers <code>nums1</code> and <code>nums2</code>.</p>

<p>A <strong>valid<strong><em> </em></strong>path</strong> is defined as follows:</p>

<ul>
	<li>Choose array <code>nums1</code> or <code>nums2</code> to traverse (from index-0).</li>
	<li>Traverse the current array from left to right.</li>
	<li>If you are reading any value that is present in <code>nums1</code> and <code>nums2</code> you are allowed to change your path to the other array. (Only one repeated value is considered in the valid path).</li>
</ul>

<p>The <strong>score</strong> is defined as the sum of unique values in a valid path.</p>

<p>Return <em>the maximum score you can obtain of all possible <strong>valid paths</strong></em>. Since the answer may be too large, return it modulo <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/07/16/sample_1_1893.png" style="width: 500px; height: 151px;" />
<pre>
<strong>Input:</strong> nums1 = [2,4,5,8,10], nums2 = [4,6,8,9]
<strong>Output:</strong> 30
<strong>Explanation:</strong> Valid paths:
[2,4,5,8,10], [2,4,5,8,9], [2,4,6,8,9], [2,4,6,8,10],  (starting from nums1)
[4,6,8,9], [4,5,8,10], [4,5,8,9], [4,6,8,10]    (starting from nums2)
The maximum is obtained with the path in green <strong>[2,4,6,8,10]</strong>.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [1,3,5,7,9], nums2 = [3,5,100]
<strong>Output:</strong> 109
<strong>Explanation:</strong> Maximum sum is obtained with the path <strong>[1,3,5,100]</strong>.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10]
<strong>Output:</strong> 40
<strong>Explanation:</strong> There are no common elements between nums1 and nums2.
Maximum sum is obtained with the path [6,7,8,9,10].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums1[i], nums2[i] &lt;= 10<sup>7</sup></code></li>
	<li><code>nums1</code> and <code>nums2</code> are strictly increasing.</li>
</ul>

typedef long long int ll;
#define mod 1000000007;
class Solution {
public:
    int maxSum(vector<int>& nums1, vector<int>& nums2) {
        ll n1=nums1.size();
        ll n2=nums2.size();
        // cout<<n1<<' '<<n2<<'\n';
        map<ll,ll> um1;
        for(ll i=0;i<n1;i++)
        {
            um1[nums1[i]]++;
        }
        vector<ll> vec;
        for(ll i=0;i<n2;i++)
        {
            if(um1.find(nums2[i])!=um1.end())
            {
                vec.push_back((ll)nums2[i]);
            }
        }
        ll m=vec.size();
        vector<ll> v1;
        vector<ll> v2;
        ll sum1=0;
        ll i1=0;
        for(ll i=0;i<n1;i++)
        {
            sum1+=(ll)nums1[i];
            // sum1%=mod;
            if(i1<m)
            {
                if(vec[i1]==(ll)nums1[i])
                {
                    v1.push_back(sum1);
                    sum1=0;
                    i1++;
                }
            }
        }
        v1.push_back(sum1);
        ll sum2=0;
        ll i2=0;
        for(ll i=0;i<n2;i++)
        {
            sum2+=(ll)nums2[i];
            // sum2%=mod;
            if(i2<m)
            {
                if(vec[i2]==(ll)nums2[i])
                {
                    v2.push_back(sum2);
                    sum2=0;
                    i2++;
                }
            }
        }
        v2.push_back(sum2);
        m=v1.size();
        for(ll i=0;i<m;i++)
        {
            cout<<v1[i]<<' ';
        }
        cout<<'\n';
        for(ll i=0;i<m;i++)
        {
            cout<<v2[i]<<' ';
        }
        cout<<'\n';
        ll sum=0;
        for(ll i=0;i<m;i++)
        {
            sum+=max(v1[i],v2[i]);
            sum%=mod;
        }
        return sum;
    }
};
79398