제출 #1306280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306280		ladnoooo	Toll (BOI17_toll)	C++20	8 / 100	3093 ms	4560 KiB

toll

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast") 
#pragma comment(linker, "/stack:200000000") 
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native" ) 
#pragma GCC optimize("unroll-loops") 
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer") 
#pragma GCC optimize("vpt") 
#define pb push_back
//#define int long long

const int maxN = 4e5 + 7;

vector<pair<int, int>> g[maxN];

int dp[maxN];

void solve() {
    int k, n, m, o;
    cin >> k >> n >> m >> o;
    for(int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].pb({v, w});
    }
    while(o--) {
        int a, b;
        cin >> a >> b;
        for(int i = 0; i < n; i++) dp[i] = 1e9;
        queue<int> q;
        q.push(a);
        dp[a] = 0;
        while(!q.empty()) {
            int v = q.front();
            q.pop();
            for(auto [u, w] : g[v]) {
                if(dp[u] > dp[v] + w) {
                    dp[u] = dp[v] + w;
                    q.push(u);
                }
            }
        }
        if(dp[b] == 1e9) cout << -1 << '\n';
        else cout << dp[b] << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("input.txt", "r", stdin);
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

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

toll.cpp:7:71: warning: bad option '-fprofile-values' to pragma 'optimize' [-Wpragmas]
    7 | #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
      |                                                                       ^
toll.cpp:18:12: warning: bad option '-fprofile-values' to attribute 'optimize' [-Wattributes]
   18 | void solve() {
      |            ^
toll.cpp:48:13: warning: bad option '-fprofile-values' to attribute 'optimize' [-Wattributes]
   48 | signed main() {
      |             ^

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