oj.uz

답안 #422767

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422767 2021-06-10T12:00:08 Z QCFium 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 633 ms 4484 KB 
#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

template<typename T> using pqueue_inv = std::priority_queue<T, std::vector<T>, std::greater<T> >;


int main() {
	int n = ri();
	int m = ri();
	int k = ri();
	int val[n][k][2];
	for (auto &i : val) for (auto &j : i) for (auto &k : j) k = ri();
	
	struct Hen {
		int a;
		int b;
		int64_t c;
	};
	std::vector<Hen> hens(m);
	for (auto &i : hens) i.a = ri() - 1, i.b = ri() - 1, i.c = ri();
	
	std::vector<std::vector<int64_t> > dist_base;
	for (int i = 0; i < n; i++) {
		std::vector<std::pair<int, int> > hen[n];
		for (auto i : hens) hen[i.a].push_back({i.b, i.c});
		std::vector<int64_t> dist(n, 1000000000000000000);
		pqueue_inv<std::pair<int64_t, int> > que;
		que.push({dist[i] = 0, i});
		while (que.size()) {
			auto j = que.top();
			que.pop();
			if (j.first != dist[j.second]) continue;
			for (auto k : hen[j.second]) if (dist[k.first] > j.first + k.second)
				que.push({dist[k.first] = j.first + k.second, k.first});
		}
		dist_base.push_back(dist);
	}
	
	int l = 0;
	int r = 1000000001;
	while (r - l > 1) {
		int mid = l + ((r - l) >> 1);
		
		std::vector<Hen> hens_cur;
		for (auto i : hens) hens_cur.push_back({i.a, i.b, i.c * mid});
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				int max = -1;
				for (int l = 0; l < k; l++) if (val[i][l][0] != -1 && val[j][l][1] != -1) max = std::max(max, val[j][l][1] - val[i][l][0]);
				if (max > 0) hens_cur.push_back({i, j, (int64_t) dist_base[i][j] * mid - max});
			}
		}
		
		std::vector<std::pair<int64_t, int> > dist(n, {1000000000000000000, 1000000000});
		bool loop = false;
		for (int i = 0; i <= n; i++) {
			for (auto j : hens_cur) {
				std::pair<int64_t, int> cur_dist;
				if (i) cur_dist = dist[j.a];
				else cur_dist = {0, 1000000000};
				if (cur_dist.first == 1000000000000000000) continue;
				cur_dist.first += j.c;
				cur_dist.second--;
				if (dist[j.b] > cur_dist) {
					dist[j.b] = cur_dist;
					if (i == n) loop = true;
				}
			}
		}
		if (loop) l = mid;
		else r = mid;
	}
	printf("%d\n", l);
	
	
	return 0;
}

Compilation message

merchant.cpp: In function 'int ri()':
merchant.cpp:5:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 316 ms 2372 KB Output is correct
2 Correct 3 ms 288 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 6 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 7 ms 372 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 7 ms 372 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 7 ms 332 KB Output is correct
12 Correct 9 ms 352 KB Output is correct
13 Correct 12 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 8 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 6 ms 332 KB Output is correct
19 Correct 13 ms 448 KB Output is correct
20 Correct 14 ms 332 KB Output is correct
21 Correct 14 ms 524 KB Output is correct
22 Correct 8 ms 332 KB Output is correct
23 Correct 29 ms 672 KB Output is correct
24 Correct 3 ms 204 KB Output is correct
25 Correct 15 ms 476 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 16 ms 460 KB Output is correct
28 Correct 21 ms 432 KB Output is correct
29 Correct 19 ms 492 KB Output is correct
30 Correct 21 ms 636 KB Output is correct
31 Correct 12 ms 332 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 476 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 16 ms 460 KB Output is correct
4 Correct 21 ms 432 KB Output is correct
5 Correct 19 ms 492 KB Output is correct
6 Correct 21 ms 636 KB Output is correct
7 Correct 12 ms 332 KB Output is correct
8 Correct 119 ms 988 KB Output is correct
9 Correct 436 ms 3272 KB Output is correct
10 Correct 97 ms 932 KB Output is correct
11 Correct 130 ms 1128 KB Output is correct
12 Correct 118 ms 1096 KB Output is correct
13 Correct 102 ms 964 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 9 ms 352 KB Output is correct
5 Correct 12 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 4 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 13 ms 448 KB Output is correct
12 Correct 14 ms 332 KB Output is correct
13 Correct 14 ms 524 KB Output is correct
14 Correct 8 ms 332 KB Output is correct
15 Correct 29 ms 672 KB Output is correct
16 Correct 3 ms 204 KB Output is correct
17 Correct 119 ms 988 KB Output is correct
18 Correct 436 ms 3272 KB Output is correct
19 Correct 97 ms 932 KB Output is correct
20 Correct 130 ms 1128 KB Output is correct
21 Correct 118 ms 1096 KB Output is correct
22 Correct 102 ms 964 KB Output is correct
23 Correct 15 ms 476 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 16 ms 460 KB Output is correct
26 Correct 21 ms 432 KB Output is correct
27 Correct 19 ms 492 KB Output is correct
28 Correct 21 ms 636 KB Output is correct
29 Correct 12 ms 332 KB Output is correct
30 Correct 316 ms 2372 KB Output is correct
31 Correct 3 ms 288 KB Output is correct
32 Correct 4 ms 332 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 6 ms 332 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 3 ms 332 KB Output is correct
40 Correct 3 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 7 ms 372 KB Output is correct
43 Correct 13 ms 332 KB Output is correct
44 Correct 53 ms 560 KB Output is correct
45 Correct 396 ms 1528 KB Output is correct
46 Correct 42 ms 460 KB Output is correct
47 Correct 59 ms 588 KB Output is correct
48 Correct 55 ms 648 KB Output is correct
49 Correct 454 ms 3504 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 296 KB Output is correct
52 Correct 19 ms 560 KB Output is correct
53 Correct 118 ms 1216 KB Output is correct
54 Correct 32 ms 460 KB Output is correct
55 Correct 18 ms 528 KB Output is correct
56 Correct 19 ms 464 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 21 ms 516 KB Output is correct
59 Correct 23 ms 460 KB Output is correct
60 Correct 21 ms 460 KB Output is correct
61 Correct 588 ms 4484 KB Output is correct
62 Correct 633 ms 4464 KB Output is correct
63 Correct 1 ms 204 KB Output is correct