oj.uz

Submission #101122

# Submission time Handle Problem Language Result Execution time Memory
101122 2019-03-16T17:27:35 Z ae04071 Travelling Merchant (APIO17_merchant) C++11
100 / 100
 132 ms 3320 KB 
#include <bits/stdc++.h>
using namespace std;
using lli=long long;

int n,m,k;
lli adj[101][101], car[101][101], dist[100];
int s[100][1000],b[100][1000];

bool check(int C, int f=-1) {
    if(f==-1)fill(dist, dist+n, 0);
    else fill(dist,dist+n,1000000000000000ll), dist[f]=0;
    
    for(int t=0;t<n;t++) {
        int chg=0;
        for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(adj[i][j]) {
            if(dist[j] > dist[i] + C*adj[i][j] - car[i][j]) {
                chg=1;
                dist[j] = dist[i] + C*adj[i][j] - car[i][j];
            }
        }
        if(!chg) break;
        if(t==n-1) return true;
    }
    if(f!=-1) {
        for(int i=0;i<n;i++) if(adj[i][f] && dist[i] + C*adj[i][f] - car[i][f] ==0) return true;
        return false;
    } else return false;
}
int main() {
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<n;i++) {
        for(int j=0;j<k;j++) scanf("%d%d",&b[i][j], &s[i][j]);
    }
    for(int i=0;i<m;i++) {
        int a,b;
        lli c;
        scanf("%d%d%lld",&a,&b,&c);
        a--;b--; adj[a][b] = c;
    }

    for(int k=0;k<n;k++) for(int i=0;i<n;i++) for(int j=0;j<n;j++) {
        if(adj[i][k] && adj[k][j] && (!adj[i][j] || adj[i][j] > adj[i][k]+adj[k][j])) {
            adj[i][j] = adj[i][k]+adj[k][j];
        }
    }
    
    for(int i=0;i<n;i++)for(int j=0;j<n;j++) if(adj[i][j]) {
        int ad=0;
        for(int t=0;t<k;t++) if(s[j][t]!=-1 && b[i][t]!=-1) {
            ad=max(ad,s[j][t]-b[i][t]);
        }
        car[i][j] = ad;
    }

    int lo=-1,up=1000000000;
    while(up-lo>1) {
        int md=(lo+up)>>1;
        if(check(md)) lo=md;
        else up=md;
    }
    for(int i=0;i<n;i++)  {
        if(check(lo+1, i)) {
            lo++; break;
        }
    }
    printf("%d\n",lo);
    
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:30: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:32:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int j=0;j<k;j++) scanf("%d%d",&b[i][j], &s[i][j]);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%lld",&a,&b,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 1528 KB Output is correct
2 Correct 9 ms 1280 KB Output is correct
3 Correct 23 ms 1280 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 6 ms 844 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 1400 KB Output is correct
2 Correct 132 ms 1548 KB Output is correct
3 Correct 63 ms 1352 KB Output is correct
4 Correct 94 ms 1488 KB Output is correct
5 Correct 44 ms 1408 KB Output is correct
6 Correct 43 ms 1280 KB Output is correct
7 Correct 13 ms 768 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 14 ms 868 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 9 ms 868 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 7 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 788 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 8 ms 768 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 7 ms 764 KB Output is correct
13 Correct 5 ms 768 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 9 ms 868 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 97 ms 1400 KB Output is correct
18 Correct 132 ms 1548 KB Output is correct
19 Correct 63 ms 1352 KB Output is correct
20 Correct 94 ms 1488 KB Output is correct
21 Correct 44 ms 1408 KB Output is correct
22 Correct 43 ms 1280 KB Output is correct
23 Correct 13 ms 768 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 14 ms 868 KB Output is correct
26 Correct 7 ms 768 KB Output is correct
27 Correct 9 ms 868 KB Output is correct
28 Correct 7 ms 768 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 22 ms 1280 KB Output is correct
31 Correct 19 ms 1280 KB Output is correct
32 Correct 41 ms 1792 KB Output is correct
33 Correct 103 ms 1344 KB Output is correct
34 Correct 84 ms 1280 KB Output is correct
35 Correct 81 ms 1280 KB Output is correct
36 Correct 96 ms 3192 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 22 ms 1280 KB Output is correct
40 Correct 16 ms 1408 KB Output is correct
41 Correct 13 ms 1280 KB Output is correct
42 Correct 23 ms 1280 KB Output is correct
43 Correct 21 ms 1308 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 9 ms 896 KB Output is correct
46 Correct 10 ms 896 KB Output is correct
47 Correct 8 ms 868 KB Output is correct
48 Correct 67 ms 3280 KB Output is correct
49 Correct 79 ms 3320 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 55 ms 1528 KB Output is correct
52 Correct 9 ms 1280 KB Output is correct
53 Correct 23 ms 1280 KB Output is correct
54 Correct 4 ms 768 KB Output is correct
55 Correct 4 ms 768 KB Output is correct
56 Correct 3 ms 768 KB Output is correct
57 Correct 5 ms 768 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 7 ms 768 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 6 ms 844 KB Output is correct
62 Correct 3 ms 384 KB Output is correct
63 Correct 4 ms 768 KB Output is correct