oj.uz

Submission #51227

# Submission time Handle Problem Language Result Execution time Memory
51227 2018-06-17T09:18:06 Z Kubalionzzale Sightseeing (NOI14_sightseeing) C++
15 / 25
 3500 ms 118840 KB 
#include <iostream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <functional>

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

void bfs()
{
//    std::set<std::pair<int, int> , std::greater<std::pair<int, int> > > set;
//    set.insert(std::make_pair(2e8, 0));

    std::priority_queue<std::pair<int, int> > set;
    set.push(std::make_pair(2e8, 0));
    bool visited[1000010] = { 0 };

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

  //      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 (std::min(nextVal, curVal) > ans[nextNode] && !visited[nextNode])
            {
                ans[nextNode] = std::max(ans[nextNode], std::min(nextVal, curVal));
                set.push(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;
    scanf("%d%d%d", &n, &m, &q);
//    std::cin >> n >> m >> q;

    while (m--)
    {
        int x, y, quality;
        scanf("%d%d%d", &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[1000010];
    for (int i = 0; i < q; ++i)
    {
        scanf("%d", &node[i]);
//        std::cin >> node[i];
    }

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

Compilation message

sightseeing.cpp: In function 'void bfs()':
sightseeing.cpp:35:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < g[curNode].size(); ++i)
                         ~~^~~~~~~~~~~~~~~~~~~
sightseeing.cpp: In function 'int main()':
sightseeing.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
sightseeing.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &x, &y, &quality);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
sightseeing.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &node[i]);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24824 KB Output is correct
2 Correct 29 ms 24932 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 25004 KB Output is correct
2 Correct 27 ms 25004 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 27100 KB Output is correct
2 Correct 60 ms 27100 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3535 ms 118840 KB Time limit exceeded
2 Halted 0 ms 0 KB -