oj.uz

Submission #59132

# Submission time Handle Problem Language Result Execution time Memory
59132 2018-07-20T15:47:55 Z wilwxk Travelling Merchant (APIO17_merchant) C++11
100 / 100
 188 ms 13148 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=105;
const int MAXK=1005;
const long long INF=1e15+9;
long long v[MAXN][MAXK][2];
long long dist[MAXN][MAXN], prof[MAXN][MAXN];
long long g[MAXN][MAXN];
bool chega[MAXN][MAXN];
int n, m, k;

void floyd() {
    for(int kk=1; kk<=n; kk++) {
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=n; j++) {
                if(chega[i][kk]==0||chega[kk][j]==0) continue;
                dist[i][j]=min(dist[i][j], dist[i][kk]+dist[kk][j]);
                chega[i][j]=1;
            }
        }
    }
}

bool testa(long long x) {
    for(int i=1; i<=n; i++) {
        for(int j=1; j<=n; j++) {
            if(chega[i][j]==0) continue;
            g[i][j]=(x*dist[i][j])-prof[i][j];
        }
    }

    for(int kk=1; kk<=n; kk++) {
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=n; j++) {
                if(chega[i][kk]==0||chega[kk][j]==0) continue;
                g[i][j]=min(g[i][j], g[i][kk]+g[kk][j]);
            }
        }
    }

    //printf("%lld::: ", x); for(int i=1; i<=n; i++) printf("%lld ", g[i][i]); printf("\n");
    for(int i=1; i<=n; i++) if(chega[i][i]&&g[i][i]<=0) return 1;
    return 0;
}

int main() {
    scanf("%d %d %d", &n, &m, &k);
    for(int i=1; i<=n; i++) for(int j=1; j<=k; j++) scanf("%lld %lld", &v[i][j][0], &v[i][j][1]);
    for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) dist[i][j]=INF;
    while(m--) { int a, b, c; scanf("%d %d %d", &a, &b, &c); dist[a][b]=c; chega[a][b]=1; }

    floyd();

    for(int i=1; i<=n; i++) {
        for(int j=1; j<=n; j++) {
            for(int kk=1; kk<=k; kk++) {
                if(!chega[i][j]) continue;
                if(v[i][kk][0]==-1||v[j][kk][1]==-1) continue;
                prof[i][j]=max(prof[i][j], v[j][kk][1]-v[i][kk][0]);
            }
        }
    }

    long long resp=0;
    for(long long i=1e9+1; i>0; i/=2) while(testa(resp+i)) resp+=i;

    printf("%lld\n", resp);

}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:48: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:49:58: 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", &v[i][j][0], &v[i][j][1]);
                                                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:51:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     while(m--) { int a, b, c; scanf("%d %d %d", &a, &b, &c); dist[a][b]=c; chega[a][b]=1; }
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 2200 KB Output is correct
2 Correct 65 ms 2200 KB Output is correct
3 Correct 93 ms 2200 KB Output is correct
4 Correct 13 ms 2200 KB Output is correct
5 Correct 13 ms 2200 KB Output is correct
6 Correct 10 ms 2200 KB Output is correct
7 Correct 14 ms 2200 KB Output is correct
8 Correct 3 ms 2200 KB Output is correct
9 Correct 15 ms 2200 KB Output is correct
10 Correct 14 ms 2200 KB Output is correct
11 Correct 19 ms 2200 KB Output is correct
12 Correct 3 ms 2200 KB Output is correct
13 Correct 12 ms 2200 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 2200 KB Output is correct
2 Correct 175 ms 4912 KB Output is correct
3 Correct 127 ms 4912 KB Output is correct
4 Correct 81 ms 4912 KB Output is correct
5 Correct 89 ms 4912 KB Output is correct
6 Correct 109 ms 4912 KB Output is correct
7 Correct 14 ms 2200 KB Output is correct
8 Correct 2 ms 2200 KB Output is correct
9 Correct 15 ms 2200 KB Output is correct
10 Correct 17 ms 2200 KB Output is correct
11 Correct 17 ms 2200 KB Output is correct
12 Correct 17 ms 2200 KB Output is correct
13 Correct 16 ms 2200 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2200 KB Output is correct
2 Correct 14 ms 2200 KB Output is correct
3 Correct 15 ms 2200 KB Output is correct
4 Correct 14 ms 2200 KB Output is correct
5 Correct 17 ms 2200 KB Output is correct
6 Correct 2 ms 2200 KB Output is correct
7 Correct 11 ms 2200 KB Output is correct
8 Correct 12 ms 2200 KB Output is correct
9 Correct 12 ms 2200 KB Output is correct
10 Correct 15 ms 2200 KB Output is correct
11 Correct 16 ms 2200 KB Output is correct
12 Correct 18 ms 2200 KB Output is correct
13 Correct 24 ms 2200 KB Output is correct
14 Correct 19 ms 2200 KB Output is correct
15 Correct 15 ms 2200 KB Output is correct
16 Correct 15 ms 2200 KB Output is correct
17 Correct 79 ms 2200 KB Output is correct
18 Correct 175 ms 4912 KB Output is correct
19 Correct 127 ms 4912 KB Output is correct
20 Correct 81 ms 4912 KB Output is correct
21 Correct 89 ms 4912 KB Output is correct
22 Correct 109 ms 4912 KB Output is correct
23 Correct 14 ms 2200 KB Output is correct
24 Correct 2 ms 2200 KB Output is correct
25 Correct 15 ms 2200 KB Output is correct
26 Correct 17 ms 2200 KB Output is correct
27 Correct 17 ms 2200 KB Output is correct
28 Correct 17 ms 2200 KB Output is correct
29 Correct 16 ms 2200 KB Output is correct
30 Correct 70 ms 4912 KB Output is correct
31 Correct 72 ms 4912 KB Output is correct
32 Correct 119 ms 6012 KB Output is correct
33 Correct 94 ms 6012 KB Output is correct
34 Correct 84 ms 6012 KB Output is correct
35 Correct 76 ms 6012 KB Output is correct
36 Correct 154 ms 8276 KB Output is correct
37 Correct 3 ms 8276 KB Output is correct
38 Correct 2 ms 8276 KB Output is correct
39 Correct 85 ms 8276 KB Output is correct
40 Correct 69 ms 8276 KB Output is correct
41 Correct 81 ms 8276 KB Output is correct
42 Correct 87 ms 8276 KB Output is correct
43 Correct 85 ms 8276 KB Output is correct
44 Correct 3 ms 8276 KB Output is correct
45 Correct 14 ms 8276 KB Output is correct
46 Correct 15 ms 8276 KB Output is correct
47 Correct 16 ms 8276 KB Output is correct
48 Correct 158 ms 10804 KB Output is correct
49 Correct 188 ms 13148 KB Output is correct
50 Correct 3 ms 13148 KB Output is correct
51 Correct 173 ms 2200 KB Output is correct
52 Correct 65 ms 2200 KB Output is correct
53 Correct 93 ms 2200 KB Output is correct
54 Correct 13 ms 2200 KB Output is correct
55 Correct 13 ms 2200 KB Output is correct
56 Correct 10 ms 2200 KB Output is correct
57 Correct 14 ms 2200 KB Output is correct
58 Correct 3 ms 2200 KB Output is correct
59 Correct 15 ms 2200 KB Output is correct
60 Correct 14 ms 2200 KB Output is correct
61 Correct 19 ms 2200 KB Output is correct
62 Correct 3 ms 2200 KB Output is correct
63 Correct 12 ms 2200 KB Output is correct