oj.uz

답안 #50094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50094 2018-06-07T13:57:49 Z mohammad_kilani 여행하는 상인 (APIO17_merchant) C++17
12 / 100
 51 ms 1464 KB 
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 1000000000
const int N = 150 , K = 1100;
int dist[N][N] ; 
int b[N][K] , s[N][K];
int n , m , k , u , v , w;
int main() {
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i != j)
                dist[i][j] = oo;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            scanf("%d%d",&b[i][j],&s[i][j]);
        }
    }
    for(int i=0;i<m;i++){
        scanf("%d%d%d",&u,&v,&w);
        dist[u][v] = min(dist[u][v],w);
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
            }
        }
    }
    long long ans = 0;
    for(int i=2;i<=n;i++){
        for(int j=1;j<=k;j++){
            if(s[i][j] != -1 && b[1][j] != -1 && dist[1][i] != oo && dist[i][1] != oo){
                ans = max(ans, (long long)(s[i][j] - b[1][j]) / (dist[1][i] + dist[i][1]));
            }
        }
    }
    cout << ans << endl;
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:19:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d",&b[i][j],&s[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&u,&v,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 1272 KB Output is correct
2 Correct 4 ms 1336 KB Output is correct
3 Correct 5 ms 1336 KB Output is correct
4 Correct 3 ms 1336 KB Output is correct
5 Correct 2 ms 1336 KB Output is correct
6 Correct 2 ms 1336 KB Output is correct
7 Correct 3 ms 1336 KB Output is correct
8 Correct 2 ms 1336 KB Output is correct
9 Correct 3 ms 1336 KB Output is correct
10 Correct 3 ms 1336 KB Output is correct
11 Correct 3 ms 1336 KB Output is correct
12 Correct 2 ms 1336 KB Output is correct
13 Correct 3 ms 1336 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 1464 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1336 KB Output isn't correct
2 Halted 0 ms 0 KB -