Submission #124582

# Submission time Handle Problem Language Result Execution time Memory
124582 2019-07-03T14:30:58 Z deinfreund Sightseeing (NOI14_sightseeing) C++14
0 / 25
3500 ms 56696 KB
#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());
  }

  
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 496 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 3956 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3517 ms 56696 KB Time limit exceeded
2 Halted 0 ms 0 KB -