Submission #570236

#TimeUsernameProblemLanguageResultExecution timeMemory
570236OspleiRoad Closures (APIO21_roads)C++17
0 / 100
47 ms4052 KiB
#include "roads.h"

#include <bits/stdc++.h>

using namespace std;

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
	int t=W.size();
	
	for (int i=0; i<t; i++) N+=W[i];

  return vector<long long>(N, 0);
}
#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...