# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655007 | DJeniUp | Designated Cities (JOI19_designated_cities) | C++17 | 13 ms | 19480 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.
#include "bits/stdc++.h"
//#pragma GCC optimize("O3")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pairll;
typedef long double ld;
#define fr first
#define sc second
#define pb push_back
#define INF 100000000000000007
#define I 100000000000007
#define N 100007
#define endl '\n'
#define MOD 998244353
ll n,res,resx;
vector<pairll>v[2*N];
map<ll,ll>m[N];
ll S(ll x,ll y){
ll rs=0;
for(int i=0;i<v[x].size();i++){
if(v[x][i].fr!=y){
rs+=v[x][i].sc+S(v[x][i].fr,x);
}
}
return rs;
}
void D(ll x,ll y,ll z){
if(res>z){
res=z;
resx=x;
}
for(int i=0;i<v[x].size();i++){
if(v[x][i].fr!=y){
D(v[x][i].fr,x,z-v[x][i].sc+m[v[x][i].fr][x]);
}
}
return ;
}
int main()
{
cin>>n;
for(int i=1;i<n;i++){
ll x,y,z,z1;
cin>>x>>y>>z>>z1;
v[x].pb({y,z});
v[y].pb({x,z1});
m[x][y]=z;
m[y][x]=z1;
}
res=INF;
D(1,1,S(1,1));
cout<<res<<endl;
return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |