Submission #774474

# Submission time Handle Problem Language Result Execution time Memory
774474 2023-07-05T18:32:02 Z vjudge1 Travelling Merchant (APIO17_merchant) C++17
100 / 100
62 ms 2148 KB
#include <bits/stdc++.h>

		using namespace std;
		using ll = long long;

		#define int ll

		int N, M, K;
		int S[101][1001], B[101][1001];
		int D[101][101], G[101][101];
		int DP[101][101];

		int32_t main() {
            ios_base::sync_with_stdio(0);
            cin.tie(0); cout.tie(0);
            cin >> N >> M >> K;
            for(int l = 1; l <= N; l++)
                for(int i = 1; i <= N; i++)
                    D[l][i] = 1e9 + 7;
            for(int l = 1; l <= N; l++)
                for(int i = 1; i <= K; i++)
                    cin >> B[l][i] >> S[l][i];
            for(int l = 0; l < M; l++) {
                int V, W, T; cin >> V >> W >> T;
                D[V][W] = T;
            }

            for(int l = 1; l <= N; l++)
                for(int i = 1; i <= N; i++)
                    for(int j = 1; j <= K; j++)
                        if(B[l][j] != -1 && S[i][j] != -1)
                            G[l][i] = max(G[l][i], S[i][j] - B[l][j]);
            for(int l = 1; l <= N; l++)
                for(int i = 1; i <= N; i++)
                    for(int j = 1; j <= N; j++)
                        D[i][j] = min(D[i][j], D[i][l] + D[l][j]);

            int lo = 1, hi = 1e9 + 7, res = 0;
            while(lo <= hi) {
                int md = (lo + hi) / 2;
                for(int l = 1; l <= N; l++)
                    for(int i = 1; i <= N; i++)
                        DP[l][i] = md * D[l][i] - G[l][i];

                for(int l = 1; l <= N; l++)
                    for(int i = 1; i <= N; i++)
                        for(int j = 1; j <= N; j++)
                            DP[i][j] = min(DP[i][j], DP[i][l] + DP[l][j]);

                bool can = false;
                for(int l = 1; l <= N; l++)
                    can |= (DP[l][l] <= 0);
                if(can) res = md, lo = md + 1;
                else hi = md - 1;
            }
            cout << res << "\n";
            return 0;
		}






# Verdict Execution time Memory Grader output
1 Correct 49 ms 2004 KB Output is correct
2 Correct 30 ms 1288 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 5 ms 856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 872 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 5 ms 852 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 4 ms 852 KB Output is correct
23 Correct 5 ms 900 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 34 ms 1504 KB Output is correct
9 Correct 61 ms 2148 KB Output is correct
10 Correct 32 ms 1364 KB Output is correct
11 Correct 34 ms 1432 KB Output is correct
12 Correct 34 ms 1516 KB Output is correct
13 Correct 33 ms 1408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 4 ms 872 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 5 ms 900 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 34 ms 1504 KB Output is correct
18 Correct 61 ms 2148 KB Output is correct
19 Correct 32 ms 1364 KB Output is correct
20 Correct 34 ms 1432 KB Output is correct
21 Correct 34 ms 1516 KB Output is correct
22 Correct 33 ms 1408 KB Output is correct
23 Correct 5 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 49 ms 2004 KB Output is correct
31 Correct 30 ms 1288 KB Output is correct
32 Correct 31 ms 1236 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 4 ms 724 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 5 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 4 ms 724 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 5 ms 856 KB Output is correct
43 Correct 37 ms 1364 KB Output is correct
44 Correct 33 ms 1492 KB Output is correct
45 Correct 45 ms 2120 KB Output is correct
46 Correct 33 ms 1500 KB Output is correct
47 Correct 33 ms 1492 KB Output is correct
48 Correct 33 ms 1508 KB Output is correct
49 Correct 56 ms 2112 KB Output is correct
50 Correct 0 ms 296 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 32 ms 1236 KB Output is correct
53 Correct 33 ms 1236 KB Output is correct
54 Correct 33 ms 1412 KB Output is correct
55 Correct 32 ms 1364 KB Output is correct
56 Correct 32 ms 1236 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 5 ms 936 KB Output is correct
59 Correct 5 ms 852 KB Output is correct
60 Correct 5 ms 852 KB Output is correct
61 Correct 57 ms 2068 KB Output is correct
62 Correct 62 ms 2120 KB Output is correct
63 Correct 0 ms 340 KB Output is correct