제출 #823722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
823722		Sandarach151	Autobus (COCI22_autobus)	C++17	70 / 70	139 ms	8012 KiB

Main

#include<iostream>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
 
const int MAXN=72, INF=1000000010;
int n, m, k, q, adj[MAXN][MAXN], dis[MAXN][MAXN][MAXN];
 
int main(){
    scanf("%d %d", &n, &m);
    forn(i, n) forn(j, n) adj[i][j]=INF;
    forn(i, n) adj[i][i]=0;
    forn(i, m){
        int a, b, t; scanf("%d %d %d", &a, &b, &t); --a, --b;
        adj[a][b]=min(adj[a][b], t);
    }
    scanf("%d %d", &k, &q);
    k = min(k, n-1);
    forn(it, k+1) forn(i, n) forn(j, n) dis[it][i][j]=INF;
    forn(it, k+1) forn(i, n) dis[it][i][i]=0;
    forn(it, k){
        forn(v, n) forn(i, n) forn(j, n){
            dis[it+1][v][j]=min(dis[it+1][v][j], dis[it][v][i] + adj[i][j]);
        }
    }
    forn(i, q){
        int a, b; scanf("%d %d", &a, &b), --a, --b;
        int d = dis[k][a][b];
        printf("%d\n", d==INF? -1 : d);
    }
}

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

Main.cpp: In function 'int main()':
Main.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:13:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         int a, b, t; scanf("%d %d %d", &a, &b, &t); --a, --b;
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d %d", &k, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:26:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         int a, b; scanf("%d %d", &a, &b), --a, --b;
      |                   ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25
• Subtask 4: 15 / 15