oj.uz

답안 #124584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124584 2019-07-03T14:33:09 Z deinfreund 관광 (NOI14_sightseeing) C++14
15 / 25
 3500 ms 114080 KB 
    #include <bits/stdc++.h>
     
    using namespace std;
     
    vector<vector<pair<int, int>> > conns;
     
    int main(){
      int nodes, edges, targets;
      cin >> nodes >> edges >> targets;
      conns.resize(nodes);
      ios_base::sync_with_stdio(0);
      cin.tie(0);
      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());
      }
      
      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;
        trg.push_back(a);
      }
      vector<long long> best(nodes, 1000000000000000000LL);
      priority_queue<pair<long long, int>> pq;
      pq.push({-1000000000000000000LL,0});
      while (true){
        int pos, cost;
        do{
          pos = pq.top().second;
          cost = -pq.top().first;
          pq.pop();
        }while(cost > best[pos]);
        if (needed[pos]) remaining --;
        if (remaining == 0) break;
        for (int i = 0; i < conns[pos].size(); i++){
          int c = max(cost, conns[pos][i].first);
          if (c < best[conns[pos][i].second]){
    	best[conns[pos][i].second] = c;
    	pq.push({-c, conns[pos][i].second});
          }
        }
      }
      for (int i = 0; i < targets; i++){
        cout << -best[trg[i]] << endl;
      }
    }

Compilation message

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:47:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < conns[pos].size(); i++){
                         ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 3576 KB Output is correct
2 Correct 52 ms 3960 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3538 ms 114080 KB Time limit exceeded
2 Halted 0 ms 0 KB -