oj.uz

Submission #59365

# Submission time Handle Problem Language Result Execution time Memory
59365 2018-07-21T19:37:15 Z duality Travelling Merchant (APIO17_merchant) C++11
100 / 100
 121 ms 9796 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 l = 0,r = 1e9;
    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);

    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 97 ms 1404 KB Output is correct
2 Correct 50 ms 1404 KB Output is correct
3 Correct 52 ms 1404 KB Output is correct
4 Correct 11 ms 1404 KB Output is correct
5 Correct 10 ms 1404 KB Output is correct
6 Correct 10 ms 1404 KB Output is correct
7 Correct 14 ms 1404 KB Output is correct
8 Correct 3 ms 1404 KB Output is correct
9 Correct 10 ms 1404 KB Output is correct
10 Correct 11 ms 1404 KB Output is correct
11 Correct 10 ms 1404 KB Output is correct
12 Correct 2 ms 1404 KB Output is correct
13 Correct 12 ms 1404 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1404 KB Output is correct
2 Correct 12 ms 1404 KB Output is correct
3 Correct 13 ms 1404 KB Output is correct
4 Correct 15 ms 1404 KB Output is correct
5 Correct 12 ms 1404 KB Output is correct
6 Correct 2 ms 1404 KB Output is correct
7 Correct 15 ms 1404 KB Output is correct
8 Correct 12 ms 1404 KB Output is correct
9 Correct 9 ms 1404 KB Output is correct
10 Correct 13 ms 1404 KB Output is correct
11 Correct 12 ms 1416 KB Output is correct
12 Correct 12 ms 1416 KB Output is correct
13 Correct 12 ms 1416 KB Output is correct
14 Correct 11 ms 1428 KB Output is correct
15 Correct 12 ms 1484 KB Output is correct
16 Correct 9 ms 1484 KB Output is correct
17 Correct 9 ms 1556 KB Output is correct
18 Correct 3 ms 1556 KB Output is correct
19 Correct 14 ms 1736 KB Output is correct
20 Correct 10 ms 1736 KB Output is correct
21 Correct 16 ms 1736 KB Output is correct
22 Correct 9 ms 1736 KB Output is correct
23 Correct 14 ms 1736 KB Output is correct
24 Correct 10 ms 1404 KB Output is correct
25 Correct 14 ms 1404 KB Output is correct
26 Correct 3 ms 1404 KB Output is correct
27 Correct 10 ms 1404 KB Output is correct
28 Correct 11 ms 1404 KB Output is correct
29 Correct 10 ms 1404 KB Output is correct
30 Correct 2 ms 1404 KB Output is correct
31 Correct 12 ms 1404 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 2204 KB Output is correct
2 Correct 102 ms 2204 KB Output is correct
3 Correct 60 ms 2204 KB Output is correct
4 Correct 66 ms 2204 KB Output is correct
5 Correct 60 ms 2308 KB Output is correct
6 Correct 48 ms 2396 KB Output is correct
7 Correct 9 ms 1556 KB Output is correct
8 Correct 3 ms 1556 KB Output is correct
9 Correct 14 ms 1736 KB Output is correct
10 Correct 10 ms 1736 KB Output is correct
11 Correct 16 ms 1736 KB Output is correct
12 Correct 9 ms 1736 KB Output is correct
13 Correct 14 ms 1736 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1404 KB Output is correct
2 Correct 12 ms 1404 KB Output is correct
3 Correct 13 ms 1404 KB Output is correct
4 Correct 15 ms 1404 KB Output is correct
5 Correct 12 ms 1404 KB Output is correct
6 Correct 2 ms 1404 KB Output is correct
7 Correct 15 ms 1404 KB Output is correct
8 Correct 12 ms 1404 KB Output is correct
9 Correct 9 ms 1404 KB Output is correct
10 Correct 13 ms 1404 KB Output is correct
11 Correct 12 ms 1416 KB Output is correct
12 Correct 12 ms 1416 KB Output is correct
13 Correct 12 ms 1416 KB Output is correct
14 Correct 11 ms 1428 KB Output is correct
15 Correct 12 ms 1484 KB Output is correct
16 Correct 9 ms 1484 KB Output is correct
17 Correct 68 ms 2204 KB Output is correct
18 Correct 102 ms 2204 KB Output is correct
19 Correct 60 ms 2204 KB Output is correct
20 Correct 66 ms 2204 KB Output is correct
21 Correct 60 ms 2308 KB Output is correct
22 Correct 48 ms 2396 KB Output is correct
23 Correct 9 ms 1556 KB Output is correct
24 Correct 3 ms 1556 KB Output is correct
25 Correct 14 ms 1736 KB Output is correct
26 Correct 10 ms 1736 KB Output is correct
27 Correct 16 ms 1736 KB Output is correct
28 Correct 9 ms 1736 KB Output is correct
29 Correct 14 ms 1736 KB Output is correct
30 Correct 63 ms 2528 KB Output is correct
31 Correct 87 ms 2628 KB Output is correct
32 Correct 82 ms 3088 KB Output is correct
33 Correct 63 ms 3192 KB Output is correct
34 Correct 52 ms 3192 KB Output is correct
35 Correct 48 ms 3204 KB Output is correct
36 Correct 100 ms 5372 KB Output is correct
37 Correct 3 ms 5372 KB Output is correct
38 Correct 2 ms 5372 KB Output is correct
39 Correct 78 ms 5372 KB Output is correct
40 Correct 61 ms 5372 KB Output is correct
41 Correct 54 ms 5372 KB Output is correct
42 Correct 50 ms 5408 KB Output is correct
43 Correct 50 ms 5560 KB Output is correct
44 Correct 3 ms 5560 KB Output is correct
45 Correct 20 ms 5560 KB Output is correct
46 Correct 17 ms 5560 KB Output is correct
47 Correct 15 ms 5560 KB Output is correct
48 Correct 121 ms 7800 KB Output is correct
49 Correct 116 ms 9796 KB Output is correct
50 Correct 2 ms 9796 KB Output is correct
51 Correct 97 ms 1404 KB Output is correct
52 Correct 50 ms 1404 KB Output is correct
53 Correct 52 ms 1404 KB Output is correct
54 Correct 11 ms 1404 KB Output is correct
55 Correct 10 ms 1404 KB Output is correct
56 Correct 10 ms 1404 KB Output is correct
57 Correct 14 ms 1404 KB Output is correct
58 Correct 3 ms 1404 KB Output is correct
59 Correct 10 ms 1404 KB Output is correct
60 Correct 11 ms 1404 KB Output is correct
61 Correct 10 ms 1404 KB Output is correct
62 Correct 2 ms 1404 KB Output is correct
63 Correct 12 ms 1404 KB Output is correct