oj.uz

답안 #404271

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404271 2021-05-14T04:45:55 Z saarang123 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 108 ms 3956 KB 
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e16;

int n, m, items;
vector<vector<long long>> g, best, buy, sell;

bool check(long long x) {
	vector<vector<long long>> dist(n, vector<long long>(n, -inf));
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++) 
			if(g[i][j] < inf)
				dist[i][j] = best[i][j] - g[i][j] * x;

	for(int k = 0; k < n; k++)
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				dist[i][j] = max(dist[i][j], dist[i][k] + dist[k][j]);

	for(int i = 0; i < n; i++)
		if(dist[i][i] >= 0)
			return true;
	return false;
}

signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    #ifdef saarang
    freopen("/home/saarang/Documents/code/input.txt", "r", stdin);
    freopen("/home/saarang/Documents/code/output.txt", "w", stdout);
    #endif
    cin >> n >> m >> items;
    g.assign(n, vector<long long>(n, inf));
    best.assign(n, vector<long long>(n));
    buy.resize(n, vector<long long>(items));
    sell.resize(n, vector<long long>(items));

    for(int i = 0; i < n; i++) 
    	for(int j = 0; j < items; j++)
    		cin >> buy[i][j] >> sell[i][j];

    while(m--) {
    	int u, v, w;
    	cin >> u >> v >> w;
    	g[--u][--v] = w;
    }

    for(int k = 0; k < n; k++)
    	for(int i = 0; i < n; i++)
    		for(int j = 0; j < n; j++)
    			g[i][j] = min(g[i][j], g[i][k] + g[k][j]);

    for(int i = 0; i < n; i++)
    	for(int j = 0; j < n; j++) if(g[i][j] < inf)
    		for(int k = 0; k < items; k++) 
    			if(~buy[i][k] && ~sell[j][k])
    				best[i][j] = max(best[i][j], sell[j][k] - buy[i][k]);

    long long l = 0, r = 1000 * 1000 * 1000 + 3;
    while(l < r) {
    	long long mid = (l + r + 1) >> 1;
    	if(check(mid))
    		l = mid;
    	else
    		r = mid - 1;
    }

    cout << l << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 3308 KB Output is correct
2 Correct 51 ms 572 KB Output is correct
3 Correct 42 ms 580 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 6 ms 312 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 7 ms 460 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 7 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 6 ms 332 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 332 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 8 ms 472 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 6 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 7 ms 332 KB Output is correct
19 Correct 7 ms 456 KB Output is correct
20 Correct 7 ms 460 KB Output is correct
21 Correct 7 ms 380 KB Output is correct
22 Correct 7 ms 332 KB Output is correct
23 Correct 8 ms 484 KB Output is correct
24 Correct 6 ms 332 KB Output is correct
25 Correct 7 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 8 ms 460 KB Output is correct
28 Correct 7 ms 460 KB Output is correct
29 Correct 7 ms 472 KB Output is correct
30 Correct 7 ms 332 KB Output is correct
31 Correct 6 ms 312 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 8 ms 460 KB Output is correct
4 Correct 7 ms 460 KB Output is correct
5 Correct 7 ms 472 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 6 ms 312 KB Output is correct
8 Correct 44 ms 844 KB Output is correct
9 Correct 95 ms 3672 KB Output is correct
10 Correct 41 ms 692 KB Output is correct
11 Correct 45 ms 852 KB Output is correct
12 Correct 46 ms 932 KB Output is correct
13 Correct 41 ms 588 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 7 ms 332 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 6 ms 332 KB Output is correct
8 Correct 7 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 7 ms 332 KB Output is correct
11 Correct 7 ms 456 KB Output is correct
12 Correct 7 ms 460 KB Output is correct
13 Correct 7 ms 380 KB Output is correct
14 Correct 7 ms 332 KB Output is correct
15 Correct 8 ms 484 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 44 ms 844 KB Output is correct
18 Correct 95 ms 3672 KB Output is correct
19 Correct 41 ms 692 KB Output is correct
20 Correct 45 ms 852 KB Output is correct
21 Correct 46 ms 932 KB Output is correct
22 Correct 41 ms 588 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 8 ms 460 KB Output is correct
26 Correct 7 ms 460 KB Output is correct
27 Correct 7 ms 472 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 6 ms 312 KB Output is correct
30 Correct 68 ms 3308 KB Output is correct
31 Correct 51 ms 572 KB Output is correct
32 Correct 42 ms 580 KB Output is correct
33 Correct 6 ms 332 KB Output is correct
34 Correct 6 ms 312 KB Output is correct
35 Correct 6 ms 332 KB Output is correct
36 Correct 7 ms 332 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 6 ms 332 KB Output is correct
39 Correct 6 ms 332 KB Output is correct
40 Correct 6 ms 332 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 7 ms 460 KB Output is correct
43 Correct 39 ms 616 KB Output is correct
44 Correct 43 ms 780 KB Output is correct
45 Correct 61 ms 2252 KB Output is correct
46 Correct 43 ms 776 KB Output is correct
47 Correct 47 ms 792 KB Output is correct
48 Correct 42 ms 800 KB Output is correct
49 Correct 104 ms 3908 KB Output is correct
50 Correct 1 ms 284 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 39 ms 588 KB Output is correct
53 Correct 42 ms 588 KB Output is correct
54 Correct 40 ms 588 KB Output is correct
55 Correct 39 ms 620 KB Output is correct
56 Correct 48 ms 588 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 9 ms 560 KB Output is correct
59 Correct 8 ms 568 KB Output is correct
60 Correct 8 ms 560 KB Output is correct
61 Correct 104 ms 3956 KB Output is correct
62 Correct 108 ms 3900 KB Output is correct
63 Correct 1 ms 320 KB Output is correct