# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100138 | CpDark | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 12 ms | 2652 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>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int sum = 0;
void init(int N, vector<int> V, vector<int> U, vector<int> W) {
for (int i = 0;i < N - 1;i++) sum += W[i];
}
int query(int a, int b, int c, int d, int e) {
return sum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, Q;
cin >> N;
vi V(N - 1), U(N - 1), W(N - 1);
for (int i = 0;i < N - 1;i++)cin >> V[i] >> U[i] >> W[i];
init(N, V, U, W);
cin >> Q;
for (int i = 0;i < Q;i++) {
int a, b, c, d, e;
# | 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... |