oj.uz

답안 #109312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109312 2019-05-06T06:45:58 Z PeppaPig 여행하는 상인 (APIO17_merchant) C++14
0 / 100
 112 ms 3448 KB 
#include <bits/stdc++.h>

#define long long long
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 105;

int n, m, K;
long B[N][1005], S[N][1005];
long d[N][N], profit[N][N], dp[N][N];

bool chk(long mid) {
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
        dp[i][j] = profit[i][j] - d[i][j] * mid;
    for(int i = 1; i <= n; i++) dp[i][i] = -1e18;
    for(int k = 1; k <= n; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
        dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
    for(int i = 1; i <= n; i++) if(dp[i][i] >= 0) return true;
    return false;
}

int main() {
    fill_n(d[0], N*N, 1e18);
    scanf("%d %d %d", &n, &m, &K);
    for(int i = 1; i <= n; i++) for(int j = 1; j <= K; j++) scanf("%lld %lld", &B[i][j], &S[i][j]);
    for(int i = 1, a, b, c; i <= m; i++) {
        scanf("%d %d %d", &a, &b, &c);
        d[a][b] = c;
    }
    for(int i = 1; i <= n; i++) d[i][i] = 0;
    for(int k = 1; k <= n; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) for(int k = 1; k <= K; k++)
        if(~S[j][k] && ~B[i][k]) profit[i][j] = max(profit[i][j], S[j][k] - B[i][k]);
    
    long l = 0, r = 1e18;
    while(l < r) {
        long mid = (l + r + 1) >> 1;
        if(chk(mid)) l = mid;
        else r = mid-1;
    }
    printf("%lld\n", l);

    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:28: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:29:66: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; i++) for(int j = 1; j <= K; j++) scanf("%lld %lld", &B[i][j], &S[i][j]);
                                                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 33.0

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

Subtask #4
0 / 34.0

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