oj.uz

Submission #210713

# Submission time Handle Problem Language Result Execution time Memory
210713 2020-03-18T06:41:55 Z anonymous Travelling Merchant (APIO17_merchant) C++14
100 / 100
 121 ms 3452 KB 
#include<iostream>
#define MAXN 105
#define MAXK 1005
#define LL long long
using namespace std;
int N, M, K, ui, vi, wi;
int buy[MAXN][MAXK], sell[MAXN][MAXK];
LL dist[MAXN][MAXN], best[MAXN][MAXN];
LL adj[MAXN][MAXN];
bool can(LL k) {
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=N; j++) {
            adj[i][j] = best[i][j] - k*dist[i][j];
        }
    } //is there a non-negative cycle?
    for (int m=1; m<=N; m++) {
        for (int i=1; i<=N; i++) {
            for (int j=1; j<=N; j++) {
                adj[i][j]=max(adj[i][j], adj[i][m] + adj[m][j]);
            }
        }
    }
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=N; j++) {
            if (i != j && adj[i][j] + best[j][i] - k*dist[j][i] >= 0) {return(true);}
        }
    }
    return(false);
}
int main() {
    //freopen("merchin.txt","r",stdin);
    scanf("%d %d %d",&N,&M,&K);
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=K; j++) {
            scanf("%d %d", &buy[i][j], &sell[i][j]);
        }
    }
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=N; j++) {
            if (i != j) {dist[i][j] = 1LL << 31;}
        }
    }
    for (int i=0; i<M; i++) {
        scanf("%d %d %d",&ui,&vi,&wi);
        dist[ui][vi]=wi;
    }
    for (int k=1; k<=N; k++) {
        for (int i=1; i<=N; i++) {
            for (int j=1; j<=N; j++) {
                dist[i][j]=min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=N; j++) {
            for (int k=1; k<=K; k++) {
                if (sell[j][k] == -1 || buy[i][k] == -1) {continue;}
                best[i][j] = max(best[i][j], (LL) sell[j][k]-buy[i][k]);
            }
        }
    }
    int lo = 0, hi = (int) 1e9 + 5;
    while (lo + 1 != hi) {
        int mid = (lo + hi) >> 1;
        if (can(mid)) {lo = mid;}
        else {hi = mid;}
    }
    printf("%d\n", lo);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:32: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:35:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d", &buy[i][j], &sell[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&ui,&vi,&wi);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 2552 KB Output is correct
2 Correct 41 ms 1272 KB Output is correct
3 Correct 42 ms 1268 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 10 ms 760 KB Output is correct
7 Correct 11 ms 760 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 10 ms 760 KB Output is correct
10 Correct 11 ms 760 KB Output is correct
11 Correct 10 ms 760 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 11 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 1528 KB Output is correct
2 Correct 111 ms 3192 KB Output is correct
3 Correct 48 ms 1400 KB Output is correct
4 Correct 49 ms 1528 KB Output is correct
5 Correct 49 ms 1528 KB Output is correct
6 Correct 47 ms 1400 KB Output is correct
7 Correct 12 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 11 ms 888 KB Output is correct
10 Correct 11 ms 920 KB Output is correct
11 Correct 11 ms 888 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 10 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 888 KB Output is correct
2 Correct 11 ms 888 KB Output is correct
3 Correct 11 ms 888 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 12 ms 888 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 10 ms 760 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 12 ms 888 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 11 ms 888 KB Output is correct
15 Correct 12 ms 888 KB Output is correct
16 Correct 10 ms 760 KB Output is correct
17 Correct 49 ms 1528 KB Output is correct
18 Correct 111 ms 3192 KB Output is correct
19 Correct 48 ms 1400 KB Output is correct
20 Correct 49 ms 1528 KB Output is correct
21 Correct 49 ms 1528 KB Output is correct
22 Correct 47 ms 1400 KB Output is correct
23 Correct 12 ms 888 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 11 ms 888 KB Output is correct
26 Correct 11 ms 920 KB Output is correct
27 Correct 11 ms 888 KB Output is correct
28 Correct 11 ms 888 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 54 ms 1400 KB Output is correct
31 Correct 46 ms 1400 KB Output is correct
32 Correct 66 ms 1912 KB Output is correct
33 Correct 46 ms 1400 KB Output is correct
34 Correct 46 ms 1400 KB Output is correct
35 Correct 46 ms 1400 KB Output is correct
36 Correct 118 ms 3320 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 44 ms 1272 KB Output is correct
40 Correct 46 ms 1400 KB Output is correct
41 Correct 45 ms 1400 KB Output is correct
42 Correct 45 ms 1400 KB Output is correct
43 Correct 43 ms 1364 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 13 ms 888 KB Output is correct
46 Correct 13 ms 888 KB Output is correct
47 Correct 14 ms 1016 KB Output is correct
48 Correct 121 ms 3448 KB Output is correct
49 Correct 120 ms 3452 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 75 ms 2552 KB Output is correct
52 Correct 41 ms 1272 KB Output is correct
53 Correct 42 ms 1268 KB Output is correct
54 Correct 10 ms 760 KB Output is correct
55 Correct 10 ms 760 KB Output is correct
56 Correct 10 ms 760 KB Output is correct
57 Correct 11 ms 760 KB Output is correct
58 Correct 5 ms 248 KB Output is correct
59 Correct 10 ms 760 KB Output is correct
60 Correct 11 ms 760 KB Output is correct
61 Correct 10 ms 760 KB Output is correct
62 Correct 5 ms 504 KB Output is correct
63 Correct 11 ms 888 KB Output is correct