# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841875 | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 1069 ms | 5876 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")*/
#include <iostream>
#include <vector>
using namespace std;
#define ll int
ll m[50010];
ll n,cnt,a1,a2,a3,a4,a5;
vector<pair<ll,ll>>g[50001];
void dfs(ll v,ll p,ll sum)
{
if(m[v]==1)
{
cnt+=sum;sum=0;
}
//cout<<v<<" "<<sum<<"!!!\n";
for(pair<ll,ll> it:g[v])
{
if(it.first!=p)
{
dfs(it.first,v,sum + it.second);
}
}
//cout<<v<<" "<<sum<<"???\n";
}
int main()
{
ios_base::sync_with_stdio();
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
ll q,u,v,c;
for(int i=1;i<n;i++)
{
//cin>>u>>v>>c;
scanf("%d%d%d",&u,&v,&c);
g[u].push_back({v,c});
g[v].push_back({u,c});
}
cin>>q;
while(q--)
{
scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);
//cin>>a1>>a2>>a3>>a4>>a5;
m[a2]=m[a3]=m[a4]=m[a5]=1;
dfs(a1,-1,0);
cout<<cnt<<"\n";
m[a2]=m[a3]=m[a4]=m[a5]=0;
cnt=0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |