oj.uz

Submission #59364

# Submission time Handle Problem Language Result Execution time Memory
59364 2018-07-21T19:35:41 Z duality Travelling Merchant (APIO17_merchant) C++11
12 / 100
 47 ms 1524 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;

int B[100][1000],S[100][1000];
int dist[100][100],profit[100][100];
LLI dist2[100][100];
int main() {
    int i,j;
    int N,M,K;
    int u,v,t;
    scanf("%d %d %d",&N,&M,&K);
    for (i = 0; i < N; i++) {
        for (j = 0; j < K; j++) scanf("%d %d",&B[i][j],&S[i][j]);
    }
    for (i = 0; i < N; i++) fill(dist[i],dist[i]+N,1e9);
    for (i = 0; i < M; i++) {
        scanf("%d %d %d",&u,&v,&t);
        u--,v--;
        dist[u][v] = min(dist[u][v],t);
    }

    int k;
    for (k = 0; k < N; k++) {
        for (i = 0; i < N; i++) {
            for (j = 0; j < N; j++) dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
        }
    }
    for (i = 0; i < N; i++) {
        for (j = 0; j < N; j++) {
            int m = 0;
            for (k = 0; k < K; k++) {
                if ((B[i][k] != -1) && (S[j][k] != -1)) m = max(m,S[j][k]-B[i][k]);
            }
            profit[i][j] = m;
        }
    }
    LLI ans = 0;
    for (i = 0; i < N; i++) ans = max(ans,(LLI) profit[0][i]/(dist[0][i]+dist[i][0]));
    /*LLI l = 0,r = 1e10;
    while (l < r) {
        LLI m = (l+r+1) / 2;

        for (i = 0; i < N; i++) {
            for (j = 0; j < N; j++) dist2[i][j] = profit[i][j]-m*dist[i][j];
        }
        for (k = 0; k < N; k++) {
            for (i = 0; i < N; i++) {
                for (j = 0; j < N; j++) dist2[i][j] = max(dist2[i][j],dist2[i][k]+dist2[k][j]);
            }
        }
        for (i = 0; i < N; i++) {
            if (dist2[i][i] >= 0) break;
        }
        if (i < N) l = m;
        else r = m-1;
    }
    printf("%lld\n",l);*/
    printf("%lld\n",ans);

    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:17: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:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for (j = 0; j < K; j++) 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,&t);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1144 KB Output is correct
2 Correct 5 ms 1384 KB Output is correct
3 Correct 5 ms 1384 KB Output is correct
4 Correct 3 ms 1384 KB Output is correct
5 Correct 3 ms 1384 KB Output is correct
6 Correct 2 ms 1384 KB Output is correct
7 Correct 6 ms 1384 KB Output is correct
8 Correct 3 ms 1384 KB Output is correct
9 Correct 4 ms 1384 KB Output is correct
10 Correct 4 ms 1384 KB Output is correct
11 Correct 4 ms 1384 KB Output is correct
12 Correct 3 ms 1384 KB Output is correct
13 Correct 5 ms 1384 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 1524 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1384 KB Output isn't correct
2 Halted 0 ms 0 KB -