제출 #659888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659888		four_specks	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	1 ms	320 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;

inline namespace
{
} // namespace

void solve()
{
    int n, m;
    cin >> n >> m;

    int s, t;
    vector<vector<int>> doges(n);

    for (int i = 0; i < m; i++)
    {
        int b, p;
        cin >> b >> p;

        if (i == 0)
            s = b;
        else if (i == 1)
            t = b;

        doges[b].push_back(p);
    }

    for (auto &jumps : doges)
    {
        sort(jumps.begin(), jumps.end());
        jumps.erase(unique(jumps.begin(), jumps.end()), jumps.end());
    }

    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < n; i++)
    {
        for (int x : doges[i])
        {
            for (int c = 1; i + c * x < n; c++)
            {
                int j = i + c * x;
                adj[i].emplace_back(j, c);
                if (binary_search(doges[j].begin(), doges[j].end(), x))
                    break;
            }
            for (int c = 1; i - c * x >= 0; c++)
            {
                int j = i - c * x;
                adj[i].emplace_back(j, c);
                if (binary_search(doges[j].begin(), doges[j].end(), x))
                    break;
            }
        }
    }

    vector<int> dist(n, INT_MAX);
    priority_queue<pair<int, int>> pq;
    for (dist[s] = 0, pq.emplace(-dist[s], s); !pq.empty();)
    {
        auto [d, u] = pq.top();
        pq.pop();

        if (-d != dist[u])
            continue;

        for (auto [v, x] : adj[u])
        {
            if (dist[u] + x < dist[v])
                dist[v] = dist[u] + x, pq.emplace(-dist[v], v);
        }
    }

    cout << dist[t] << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(NULL);

    solve();

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:75:19: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |     cout << dist[t] << '\n';
      |                   ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43