Submission #1177931

#TimeUsernameProblemLanguageResultExecution timeMemory
1177931mahmudow_mahmyt도로 폐쇄 (APIO21_roads)C++20
0 / 100
22 ms3776 KiB
#include<bits/stdc++.h> #define ll long long #define ff first #define ss second #define mxn 100002 #define pb push_back #define yes cout<<"YES"<<endl #define no cout<<"NO"<<endl using namespace std; vector<ll>minimum_closure_costs(int n,vector<int> u,vector<int> v,vector<int> w){ ll sum=0; vector<ll> ans; for(int i=0;i<w.size();i++) sum+=w[i]; for(int i=1;i<=n-1;i++) ans.pb(0); ans[0]=sum,ans[1]=sum; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...