제출 #1103554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103554		KasymK	Commuter Pass (JOI18_commuter_pass)	C++17	24 / 100	28 ms	1872 KiB

commuter_pass

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 305;
const ll INF = 1e18;
ll d[N][N];

int main(){
    int n, m, s, t, u, v;
    scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            d[i][j] = INF;
    for(int i = 1; i <= n; ++i)
        d[i][i] = 0;
    for(int i = 1; i <= m; ++i){
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        d[a][b] = c, d[b][a] = c;
    }
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                umin(d[i][j], d[i][k]+d[k][j]);
    ll answer = d[u][v];
    for(int x = 1; x <= n; ++x)
        for(int y = 1; y <= n; ++y)
            if(d[s][x]+d[x][y]+d[y][t] == d[s][t] or d[s][y]+d[y][x]+d[x][t] == d[s][t])
                umin(answer, min(d[u][y]+d[x][v], d[u][x]+d[y][v]));
    printf("%lld\n", answer);
    return 0;
}

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

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         scanf("%d%d%d", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 16
• Subtask 2: 0 / 15
• Subtask 3: 24 / 24
• Subtask 4: 0 / 45