Submission #124582

#	Time	Username	Problem	Language	Result	Execution time	Memory
124582		deinfreund	Sightseeing (NOI14_sightseeing)	C++14	0 / 25	3517 ms	56696 KiB

sightseeing

#include <bits/stdc++.h>

using namespace std;

vector<vector<pair<int, int>> > conns;
vector<int> ind;

void dijkstra(int maxcost){

  
}

int main(){
  int nodes, edges, targets;
  cin >> nodes >> edges >> targets;
  conns.resize(nodes);
  ind.resize(nodes);
  
  vector<pair<int, int>> edgeSort;
  for (int i = 0; i < edges; i++){
    int a, b, c;
    cin >> a >> b>> c;
    a--; b--; c *= -1;
    conns[a].push_back({c,b});
    conns[b].push_back({c, a});
  }
  for (int i = 0 ; i < nodes; i++){
    sort(conns[i].begin(), conns[i].end());
  }

  
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 10