# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841875 | 2023-09-02T07:57:25 Z | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 1000 ms | 5876 KB |
/*#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1069 ms | 5876 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 121 ms | 4012 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
2 | Execution timed out | 1069 ms | 5876 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |