Submission #1177909

#TimeUsernameProblemLanguageResultExecution timeMemory
1177909AgageldiRoad Closures (APIO21_roads)C++20
0 / 100
14 ms2628 KiB
#include "bits/stdc++.h" #include "roads.h" // #include "grader.cpp" using namespace std; #define ll long long ll sum, sum2, n, ans, sum3; vector <ll> v; vector<ll>minimum_closure_costs(int N,vector<int> U,vector<int> V,vector<int> W) { bool tr = 0; sum2 = sum3 = 0; for(int i = 0; i < (int)U.size(); i++) { if(i % 2 == 0) sum2 += W[i]; else sum3 += W[i]; sum += W[i]; } v.push_back(sum); v.push_back(min(sum2,sum3)); for(int i = 0; i <= n - 3; i++) { v.push_back(0); } return v; }
#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...