제출 #392810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
392810		Victor	Toll (BOI17_toll)	C++17	100 / 100	359 ms	6192 KiB

toll

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {
    vii graph[50001], group_jump[50001];
    int n, dist[50001], y, m, o;
    scanf("%d %d %d %d", &y, &n, &m, &o);
    const int lim = 100, k = y;

    rep(i, 0, m) {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        graph[u].emplace_back(v, w);
    }

    for (int group = 0; (group + lim + 1) * k <= n; group += lim) {
        int start = group * k, stop = start + k, next_group = group + lim, next_start = next_group * k, next_stop = next_start + k;

        rep(region, start, stop) {
            fill(dist + start, dist + next_stop, INF);

            dist[region] = 0;

            rep(i, start, next_stop) {
                if (INF <= dist[i]) continue;

                trav(edge, graph[i]) {
                    int v, w;
                    tie(v, w) = edge;
                    dist[v] = min(dist[v], dist[i] + w);
                }
            }

            rep(i, next_start, next_stop) group_jump[region].emplace_back(i, dist[i]);
        }
    }

    rep(x, 0, o) {
        int a, b;
        scanf("%d %d", &a, &b);
        fill(dist + a, dist + b + 1, INF);

        dist[a] = 0;
        rep(i, a, b) {
            if (sz(group_jump[i]) && group_jump[i][0].first <= b) {
                while (sz(group_jump[i])) {
                    trav(edge, group_jump[i]) {
                        int v, w;
                        tie(v, w) = edge;
                        dist[v] = min(dist[v], dist[i] + w);
                    }
                    ++i;
                }
                i = group_jump[i - 1][0].first - 1;
            }

            if (INF <= dist[i]) continue;

            trav(edge, graph[i]) {
                int v, w;
                tie(v, w) = edge;
                dist[v] = min(dist[v], dist[i] + w);
            }
        }

        printf("%d\n", dist[b] < INF ? dist[b] : -1);
    }
    return 0;
}

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

toll.cpp: In function 'int main()':
toll.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d %d %d %d", &y, &n, &m, &o);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d %d %d", &u, &v, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |         scanf("%d %d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44