oj.uz

답안 #51214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
51214 2018-06-17T08:57:54 Z Kubalionzzale 관광 (NOI14_sightseeing) C++14
15 / 25
 3500 ms 126376 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <functional>

std::vector< std::vector< std::pair<int, int> > > g(500010);
int ans[500010] = { 0 };

void bfs()
{
    std::set<std::pair<int, int> , std::greater<std::pair<int, int> > > set;
    set.insert(std::make_pair(2e5, 0));
    bool visited[500010] = { 0 };

    while (set.empty() == false)
    {
        std::pair<int, int> top = *set.begin();
        int curNode = top.second;
        int curVal = top.first;
        set.erase(set.begin());

  //      std::cout << curNode << " " << curVal << "\n";

        if (visited[curNode])
            continue;
        else
            visited[curNode] = 1;

        for (int i = 0; i < g[curNode].size(); ++i)
        {
            std::pair<int, int> next = g[curNode][i];
            int nextVal = next.first;
            int nextNode = next.second;
            if (!visited[nextNode])
            {
                ans[nextNode] = std::max(ans[nextNode], std::min(nextVal, curVal));
                set.insert(std::make_pair(std::min(nextVal, curVal), nextNode));
            }
        }
    }
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    int n, m, q;
    std::cin >> n >> m >> q;

    while (m--)
    {
        int x, y, quality;
        std::cin >> x >> y >> quality;
        --x,
        --y;

        g[x].push_back(std::make_pair(quality, y));
        g[y].push_back(std::make_pair(quality, x));
    }

    bfs();

    int node[500010];
    for (int i = 0; i < q; ++i)
    {
        std::cin >> node[i];
    }

    for (int i = 0; i < q; ++i)
    {
        std::cout << ans[node[i] - 1] << "\n";
    }
}

Compilation message

sightseeing.cpp: In function 'void bfs()':
sightseeing.cpp:31:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < g[curNode].size(); ++i)
                         ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
6.0 / 6.0

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

Subtask #4
0 / 10.0

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