답안 #391041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391041	2021-04-17T16:02:24 Z	amirmohammad_nezami	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	110 ms	4196 KB

merchant

//                                                          In the name of God 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define lc 2 * v
#define rc 2 * v + 1
#define mid (s + e) / 2
#define _sz(e) (int)e.size()
#define _all(e) e.begin() , e.end()
#define ll long long
#define int long long
#define ld long double
#define pii pair <int , int>
#define pll pair <long long , long long>
#define piii pair <int , pair <int , int> >
#define FAST ios::sync_with_stdio(0);cin.tie(0)
#define Unique(e) e.resize(unique(_all(e)) - e.begin())
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")

const int maxn = 100 + 5 , N = 10000 + 5 , SQ = 500 , base = 800287 , mod = 1e9 + 7 , INF = 1e18 + 5 , lg = 20;
const ld eps = 1e-4;

int n , m , k , mx[maxn][maxn];
int dist[maxn][maxn] , dp[maxn][maxn];
vector <pll> item[maxn] , edges[maxn];

inline bool calc(int x) {
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			if(dist[i][j] == INF) {
				dp[i][j] = -INF;
			}
			else {
				dp[i][j] = mx[i][j] - x * dist[i][j];
			}
		}
	}

	for (int t = 0; t < n; ++t) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				dp[i][j] = max(dp[i][j] , dp[i][t] + dp[t][j]);
			}
		}
	}

	for (int i = 0; i < n; ++i) {
		if(dp[i][i] >= 0) {
			return 1;
		}
	}
	return 0;
}

int32_t main() {
	FAST;
	cin >> n >> m >> k;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < k; ++j) {
			int x , y; cin >> x >> y;
			item[i].PB({x , y});
		}
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			for (int t = 0; t < k; ++t) {

				if(item[j][t].S == -1 || item[i][t].F == -1) {
					continue;
				}
				int val = item[j][t].S - item[i][t].F;
				mx[i][j] = max(mx[i][j] , val);
			}
		}
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			dist[i][j] = INF;
		}
	}
	for (int i = 0; i < m; ++i) {
		int x , y , z; cin >> x >> y >> z;
		x-- , y--; dist[x][y] = z;
	}
	for (int t = 0; t < n; ++t) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				dist[i][j] = min(dist[i][j] , dist[i][t] + dist[t][j]);
			}
		}
	}
	
	int s = 0 , e = 1e9 + 1;
	while(s < e - 1) {
		if(calc(mid)) {
			s = mid;
		}
		else {
			e = mid;
		}
	}
	cout << s << '\n';
}
// Mistakes:
//  * Read the problem carefully.
//  * Check maxn.
//  * Overflows.

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	62 ms	3268 KB	Output is correct
2	Correct	35 ms	460 KB	Output is correct
3	Correct	34 ms	580 KB	Output is correct
4	Correct	5 ms	332 KB	Output is correct
5	Correct	5 ms	332 KB	Output is correct
6	Correct	5 ms	332 KB	Output is correct
7	Correct	6 ms	460 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	5 ms	332 KB	Output is correct
10	Correct	5 ms	332 KB	Output is correct
11	Correct	5 ms	424 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	6 ms	468 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	468 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	9 ms	460 KB	Output is correct
4	Correct	6 ms	460 KB	Output is correct
5	Correct	6 ms	460 KB	Output is correct
6	Correct	7 ms	460 KB	Output is correct
7	Correct	5 ms	456 KB	Output is correct
8	Correct	40 ms	844 KB	Output is correct
9	Correct	91 ms	3908 KB	Output is correct
10	Correct	36 ms	716 KB	Output is correct
11	Correct	48 ms	972 KB	Output is correct
12	Correct	40 ms	992 KB	Output is correct
13	Correct	36 ms	716 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	500 KB	Output is correct
2	Correct	7 ms	464 KB	Output is correct
3	Correct	7 ms	460 KB	Output is correct
4	Correct	7 ms	464 KB	Output is correct
5	Correct	6 ms	460 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	5 ms	460 KB	Output is correct
8	Correct	6 ms	532 KB	Output is correct
9	Correct	6 ms	488 KB	Output is correct
10	Correct	5 ms	460 KB	Output is correct
11	Correct	6 ms	564 KB	Output is correct
12	Correct	6 ms	460 KB	Output is correct
13	Correct	6 ms	460 KB	Output is correct
14	Correct	6 ms	468 KB	Output is correct
15	Correct	9 ms	460 KB	Output is correct
16	Correct	5 ms	460 KB	Output is correct
17	Correct	40 ms	844 KB	Output is correct
18	Correct	91 ms	3908 KB	Output is correct
19	Correct	36 ms	716 KB	Output is correct
20	Correct	48 ms	972 KB	Output is correct
21	Correct	40 ms	992 KB	Output is correct
22	Correct	36 ms	716 KB	Output is correct
23	Correct	6 ms	468 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	9 ms	460 KB	Output is correct
26	Correct	6 ms	460 KB	Output is correct
27	Correct	6 ms	460 KB	Output is correct
28	Correct	7 ms	460 KB	Output is correct
29	Correct	5 ms	456 KB	Output is correct
30	Correct	62 ms	3268 KB	Output is correct
31	Correct	35 ms	460 KB	Output is correct
32	Correct	34 ms	580 KB	Output is correct
33	Correct	5 ms	332 KB	Output is correct
34	Correct	5 ms	332 KB	Output is correct
35	Correct	5 ms	332 KB	Output is correct
36	Correct	6 ms	460 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	5 ms	332 KB	Output is correct
39	Correct	5 ms	332 KB	Output is correct
40	Correct	5 ms	424 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	6 ms	468 KB	Output is correct
43	Correct	34 ms	620 KB	Output is correct
44	Correct	36 ms	844 KB	Output is correct
45	Correct	52 ms	2600 KB	Output is correct
46	Correct	38 ms	844 KB	Output is correct
47	Correct	37 ms	844 KB	Output is correct
48	Correct	38 ms	844 KB	Output is correct
49	Correct	96 ms	3996 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	34 ms	588 KB	Output is correct
53	Correct	48 ms	588 KB	Output is correct
54	Correct	36 ms	704 KB	Output is correct
55	Correct	34 ms	588 KB	Output is correct
56	Correct	34 ms	460 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	7 ms	588 KB	Output is correct
59	Correct	7 ms	576 KB	Output is correct
60	Correct	7 ms	660 KB	Output is correct
61	Correct	102 ms	4164 KB	Output is correct
62	Correct	110 ms	4196 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct

답안 #391041

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0