Submission #52355

# Submission time Handle Problem Language Result Execution time Memory
52355 2018-06-25T14:26:06 Z imeimi2000 Travelling Merchant (APIO17_merchant) C++17
100 / 100
107 ms 9544 KB
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;

int n, k;
const int inf = 1e9 + 7;
const llong linf = (llong)inf * inf;
int buy[101][1001], sell[101][1001];
int t[101][101];
int c[101][101];
llong d[101][101];

int main() {
    int m;
    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);
            if (buy[i][j] != -1 && buy[i][j] < sell[i][j]) exit(1);
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            t[i][j] = inf;
        }
    }
    for (int i = 0; i < m; ++i) {
        int v, w, p;
        scanf("%d%d%d", &v, &w, &p);
        t[v][w] = p;
    }
    for (int p = 1; p <= n; ++p) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                t[i][j] = min(t[i][j], t[i][p] + t[p][j]);
            }
        }
    }
    for (int i = 1; i <= k; ++i) {
        for (int j = 1; j <= n; ++j) {
            for (int p = 1; p <= n; ++p) {
                if (buy[j][i] != -1 && sell[p][i] != -1) {
                    c[j][p] = max(c[j][p], sell[p][i] - buy[j][i]);
                }
            }
        }
    }
    
    int s = 0, e = inf;
    while (s < e) {
        m = (s + e + 1) / 2;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                if (t[i][j] == inf) d[i][j] = linf;
                else d[i][j] = (llong)m * t[i][j] - c[i][j];
            }
        }
        for (int p = 1; p <= n; ++p) {
            for (int i = 1; i <= n; ++i) {
                for (int j = 1; j <= n; ++j) {
                    d[i][j] = min(d[i][j], d[i][p] + d[p][j]);
                }
            }
        }
        int ch = 0;
        for (int i = 1; i <= n; ++i) {
            if (d[i][i] <= 0) {
                ch = 1;
                break;
            }
        }
        if (ch) s = m;
        else e = m - 1;
    }
    printf("%d\n", s);
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:31: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:34: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:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &v, &w, &p);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 81 ms 1148 KB Output is correct
2 Correct 42 ms 1508 KB Output is correct
3 Correct 44 ms 1508 KB Output is correct
4 Correct 10 ms 1508 KB Output is correct
5 Correct 10 ms 1508 KB Output is correct
6 Correct 8 ms 1508 KB Output is correct
7 Correct 10 ms 1508 KB Output is correct
8 Correct 2 ms 1508 KB Output is correct
9 Correct 8 ms 1508 KB Output is correct
10 Correct 9 ms 1508 KB Output is correct
11 Correct 10 ms 1508 KB Output is correct
12 Correct 2 ms 1508 KB Output is correct
13 Correct 9 ms 1508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 1508 KB Output is correct
2 Correct 9 ms 1508 KB Output is correct
3 Correct 9 ms 1508 KB Output is correct
4 Correct 8 ms 1508 KB Output is correct
5 Correct 11 ms 1508 KB Output is correct
6 Correct 3 ms 1508 KB Output is correct
7 Correct 8 ms 1508 KB Output is correct
8 Correct 8 ms 1508 KB Output is correct
9 Correct 12 ms 1508 KB Output is correct
10 Correct 9 ms 1508 KB Output is correct
11 Correct 10 ms 1508 KB Output is correct
12 Correct 10 ms 1508 KB Output is correct
13 Correct 9 ms 1508 KB Output is correct
14 Correct 9 ms 1516 KB Output is correct
15 Correct 10 ms 1760 KB Output is correct
16 Correct 8 ms 1760 KB Output is correct
17 Correct 9 ms 1760 KB Output is correct
18 Correct 2 ms 1760 KB Output is correct
19 Correct 8 ms 1760 KB Output is correct
20 Correct 9 ms 1760 KB Output is correct
21 Correct 9 ms 1760 KB Output is correct
22 Correct 10 ms 1760 KB Output is correct
23 Correct 8 ms 1760 KB Output is correct
24 Correct 8 ms 1508 KB Output is correct
25 Correct 10 ms 1508 KB Output is correct
26 Correct 2 ms 1508 KB Output is correct
27 Correct 8 ms 1508 KB Output is correct
28 Correct 9 ms 1508 KB Output is correct
29 Correct 10 ms 1508 KB Output is correct
30 Correct 2 ms 1508 KB Output is correct
31 Correct 9 ms 1508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 53 ms 2168 KB Output is correct
2 Correct 107 ms 2168 KB Output is correct
3 Correct 44 ms 2224 KB Output is correct
4 Correct 47 ms 2224 KB Output is correct
5 Correct 47 ms 2272 KB Output is correct
6 Correct 44 ms 2272 KB Output is correct
7 Correct 9 ms 1760 KB Output is correct
8 Correct 2 ms 1760 KB Output is correct
9 Correct 8 ms 1760 KB Output is correct
10 Correct 9 ms 1760 KB Output is correct
11 Correct 9 ms 1760 KB Output is correct
12 Correct 10 ms 1760 KB Output is correct
13 Correct 8 ms 1760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 1508 KB Output is correct
2 Correct 9 ms 1508 KB Output is correct
3 Correct 9 ms 1508 KB Output is correct
4 Correct 8 ms 1508 KB Output is correct
5 Correct 11 ms 1508 KB Output is correct
6 Correct 3 ms 1508 KB Output is correct
7 Correct 8 ms 1508 KB Output is correct
8 Correct 8 ms 1508 KB Output is correct
9 Correct 12 ms 1508 KB Output is correct
10 Correct 9 ms 1508 KB Output is correct
11 Correct 10 ms 1508 KB Output is correct
12 Correct 10 ms 1508 KB Output is correct
13 Correct 9 ms 1508 KB Output is correct
14 Correct 9 ms 1516 KB Output is correct
15 Correct 10 ms 1760 KB Output is correct
16 Correct 8 ms 1760 KB Output is correct
17 Correct 53 ms 2168 KB Output is correct
18 Correct 107 ms 2168 KB Output is correct
19 Correct 44 ms 2224 KB Output is correct
20 Correct 47 ms 2224 KB Output is correct
21 Correct 47 ms 2272 KB Output is correct
22 Correct 44 ms 2272 KB Output is correct
23 Correct 9 ms 1760 KB Output is correct
24 Correct 2 ms 1760 KB Output is correct
25 Correct 8 ms 1760 KB Output is correct
26 Correct 9 ms 1760 KB Output is correct
27 Correct 9 ms 1760 KB Output is correct
28 Correct 10 ms 1760 KB Output is correct
29 Correct 8 ms 1760 KB Output is correct
30 Correct 43 ms 2272 KB Output is correct
31 Correct 46 ms 2292 KB Output is correct
32 Correct 65 ms 2764 KB Output is correct
33 Correct 45 ms 2844 KB Output is correct
34 Correct 49 ms 2920 KB Output is correct
35 Correct 45 ms 2920 KB Output is correct
36 Correct 97 ms 4876 KB Output is correct
37 Correct 2 ms 4876 KB Output is correct
38 Correct 2 ms 4876 KB Output is correct
39 Correct 87 ms 5032 KB Output is correct
40 Correct 47 ms 5132 KB Output is correct
41 Correct 47 ms 5132 KB Output is correct
42 Correct 44 ms 5132 KB Output is correct
43 Correct 46 ms 5132 KB Output is correct
44 Correct 2 ms 5132 KB Output is correct
45 Correct 11 ms 5132 KB Output is correct
46 Correct 10 ms 5132 KB Output is correct
47 Correct 11 ms 5132 KB Output is correct
48 Correct 104 ms 7660 KB Output is correct
49 Correct 98 ms 9544 KB Output is correct
50 Correct 2 ms 9544 KB Output is correct
51 Correct 81 ms 1148 KB Output is correct
52 Correct 42 ms 1508 KB Output is correct
53 Correct 44 ms 1508 KB Output is correct
54 Correct 10 ms 1508 KB Output is correct
55 Correct 10 ms 1508 KB Output is correct
56 Correct 8 ms 1508 KB Output is correct
57 Correct 10 ms 1508 KB Output is correct
58 Correct 2 ms 1508 KB Output is correct
59 Correct 8 ms 1508 KB Output is correct
60 Correct 9 ms 1508 KB Output is correct
61 Correct 10 ms 1508 KB Output is correct
62 Correct 2 ms 1508 KB Output is correct
63 Correct 9 ms 1508 KB Output is correct