# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124571 | deinfreund | Sightseeing (NOI14_sightseeing) | C++14 | 3535 ms | 65328 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;
vector<vector<int> > conns;
vector<vector<int> > costs;
int main(){
int nodes, edges, targets;
cin >> nodes >> edges >> targets;
conns.resize(nodes);
costs.resize(nodes);
for (int i = 0; i < edges; i++){
int a, b, c;
cin >> a >> b>> c;
a--; b--; c *= -1;
conns[a].push_back(b);
costs[a].push_back(c);
conns[b].push_back(a);
costs[b].push_back(c);
}
int remaining = 0;
vector<bool> needed(nodes, 0);
vector<int> trg;
for (int i = 0 ; i < targets; i++){
remaining ++;
int a;
cin >> a; a--;
needed[a] = 1;
Compilation message (stderr)
# | 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... |