CPPCodeSnippets/cf.cpp at master · rnagasudhakar/CPPCodeSnippets · 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
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <cstring>
#include <iomanip>
#include <map>
#include <queue>

using namespace std;
#define ll long long

ll dp[300001][2];

void getMaxiumumFuel(vector<vector<ll>>&graph, vector<ll>&fuel, ll sou, ll parent){

    for(auto it:graph[sou]){
        if(it!=parent){

        }
    }
}

void solve() {
    ll x;
    cin>>x;
    vector<ll>fuel(x+1);
    for(int i=1;i<=x;i++){
        cin>>fuel[i];
    }
    vector<vector<ll>>graph(x+1);
    for(int i=0;i<x-1;i++){
        ll sou,des;
        cin>>sou>>des;
        graph[sou].push_back(des);
        graph[des].push_back(sou);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}