# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124602 | deinfreund | Sightseeing (NOI14_sightseeing) | C++14 | 2914 ms | 262148 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<pair<int, int>> > conns;
vector<int> ind;
vector<bool> needed;
vector<int> res;
int remaining;
void dijkstra(int node, int maxcost, int cost){
// cerr << "@" << node << " for " << cost << " until " << maxcost << endl;
if (needed[node]){
remaining --;
res[node] = cost;
}
for (;ind[node] < conns[node].size() && conns[node][ind[node]].first < maxcost; ind[node]++){
dijkstra(conns[node][ind[node]].second, ind[node] < (conns[node].size() - 1) ? conns[node][ind[node] + 1].first : 1000000000, max(conns[node][ind[node]].first, cost));
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int nodes, edges, targets;
cin >> nodes >> edges >> targets;
conns.resize(nodes);
ind.resize(nodes);
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... |