Submission #263366

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
263366	2020-08-13T16:10:34 Z	amoo_safar	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	152 ms	3448 KB

merchant

// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define Se second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef __int128 ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 1e2 + 10;
const int K = 1e3 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

int n, m, k;
int B[N][K], S[N][K];
ll dis[N][N], d[N][N];
int pro[N][N];

ll mul(ll A, ll B){
	if((Inf + A - 1) / A <= B){
		//assert(false);
		return Inf;
	}
	return A * B;
}

bool Check(ll x){
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			d[i][j] = (i == j ? Inf : mul(x, dis[i][j]) - pro[i][j]);

	for(int z = 1; z <= n; z++)
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++)
				d[i][j] = min(d[i][j], d[i][z] + d[z][j]);
			if(d[i][i] <= 0) return true;
		}

	return false;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	memset(dis, 31, sizeof dis);

	cin >> n >> m >> k;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= k; j++)
			cin >> B[i][j] >> S[i][j];

	int u, v, w;
	for(int i = 1; i <= m; i++){
		cin >> u >> v >> w;
		dis[u][v] = min(dis[u][v], (ll) w);
	}

	// Floyd
	for(int i = 1; i <= n; i++) dis[i][i] = 0;
	for(int z = 1; z <= n; z++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				dis[i][j] = min(dis[i][j], dis[i][z] + dis[z][j]);

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			for(int obj = 1; obj <= k; obj ++)
				if((S[j][obj] != -1) && (B[i][obj] != -1))
					pro[i][j] = max(pro[i][j], S[j][obj] - B[i][obj]);

	int L = 0, R = 1e9 + 1, mid;
	while(L + 1 < R){
		mid = (L + R) >> 1;
		if(Check(mid)) L = mid;
		else R = mid;
	}
	cout << L << '\n';
	return 0;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	106 ms	1532 KB	Output is correct
2	Correct	76 ms	1536 KB	Output is correct
3	Correct	48 ms	1664 KB	Output is correct
4	Correct	10 ms	1024 KB	Output is correct
5	Correct	9 ms	1024 KB	Output is correct
6	Correct	11 ms	1024 KB	Output is correct
7	Correct	10 ms	1024 KB	Output is correct
8	Correct	0 ms	512 KB	Output is correct
9	Correct	7 ms	1024 KB	Output is correct
10	Correct	7 ms	1024 KB	Output is correct
11	Correct	8 ms	1152 KB	Output is correct
12	Correct	1 ms	640 KB	Output is correct
13	Correct	12 ms	1076 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	1024 KB	Output is correct
2	Correct	10 ms	1024 KB	Output is correct
3	Correct	15 ms	1024 KB	Output is correct
4	Correct	12 ms	1024 KB	Output is correct
5	Correct	12 ms	1024 KB	Output is correct
6	Correct	1 ms	640 KB	Output is correct
7	Correct	11 ms	1024 KB	Output is correct
8	Correct	10 ms	1024 KB	Output is correct
9	Correct	8 ms	1024 KB	Output is correct
10	Correct	9 ms	1024 KB	Output is correct
11	Correct	11 ms	1152 KB	Output is correct
12	Correct	10 ms	1152 KB	Output is correct
13	Correct	9 ms	1024 KB	Output is correct
14	Correct	10 ms	1024 KB	Output is correct
15	Correct	10 ms	1152 KB	Output is correct
16	Correct	10 ms	1024 KB	Output is correct
17	Correct	12 ms	1024 KB	Output is correct
18	Correct	1 ms	564 KB	Output is correct
19	Correct	12 ms	1024 KB	Output is correct
20	Correct	10 ms	1024 KB	Output is correct
21	Correct	12 ms	1024 KB	Output is correct
22	Correct	9 ms	1024 KB	Output is correct
23	Correct	10 ms	1024 KB	Output is correct
24	Correct	11 ms	1024 KB	Output is correct
25	Correct	10 ms	1024 KB	Output is correct
26	Correct	0 ms	512 KB	Output is correct
27	Correct	7 ms	1024 KB	Output is correct
28	Correct	7 ms	1024 KB	Output is correct
29	Correct	8 ms	1152 KB	Output is correct
30	Correct	1 ms	640 KB	Output is correct
31	Correct	12 ms	1076 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	73 ms	1536 KB	Output is correct
2	Correct	151 ms	1592 KB	Output is correct
3	Correct	99 ms	1536 KB	Output is correct
4	Correct	91 ms	1656 KB	Output is correct
5	Correct	81 ms	1656 KB	Output is correct
6	Correct	73 ms	1536 KB	Output is correct
7	Correct	12 ms	1024 KB	Output is correct
8	Correct	1 ms	564 KB	Output is correct
9	Correct	12 ms	1024 KB	Output is correct
10	Correct	10 ms	1024 KB	Output is correct
11	Correct	12 ms	1024 KB	Output is correct
12	Correct	9 ms	1024 KB	Output is correct
13	Correct	10 ms	1024 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	1024 KB	Output is correct
2	Correct	10 ms	1024 KB	Output is correct
3	Correct	15 ms	1024 KB	Output is correct
4	Correct	12 ms	1024 KB	Output is correct
5	Correct	12 ms	1024 KB	Output is correct
6	Correct	1 ms	640 KB	Output is correct
7	Correct	11 ms	1024 KB	Output is correct
8	Correct	10 ms	1024 KB	Output is correct
9	Correct	8 ms	1024 KB	Output is correct
10	Correct	9 ms	1024 KB	Output is correct
11	Correct	11 ms	1152 KB	Output is correct
12	Correct	10 ms	1152 KB	Output is correct
13	Correct	9 ms	1024 KB	Output is correct
14	Correct	10 ms	1024 KB	Output is correct
15	Correct	10 ms	1152 KB	Output is correct
16	Correct	10 ms	1024 KB	Output is correct
17	Correct	73 ms	1536 KB	Output is correct
18	Correct	151 ms	1592 KB	Output is correct
19	Correct	99 ms	1536 KB	Output is correct
20	Correct	91 ms	1656 KB	Output is correct
21	Correct	81 ms	1656 KB	Output is correct
22	Correct	73 ms	1536 KB	Output is correct
23	Correct	12 ms	1024 KB	Output is correct
24	Correct	1 ms	564 KB	Output is correct
25	Correct	12 ms	1024 KB	Output is correct
26	Correct	10 ms	1024 KB	Output is correct
27	Correct	12 ms	1024 KB	Output is correct
28	Correct	9 ms	1024 KB	Output is correct
29	Correct	10 ms	1024 KB	Output is correct
30	Correct	70 ms	1536 KB	Output is correct
31	Correct	81 ms	1636 KB	Output is correct
32	Correct	82 ms	2040 KB	Output is correct
33	Correct	81 ms	1684 KB	Output is correct
34	Correct	76 ms	1700 KB	Output is correct
35	Correct	78 ms	1664 KB	Output is correct
36	Correct	152 ms	3448 KB	Output is correct
37	Correct	1 ms	640 KB	Output is correct
38	Correct	1 ms	640 KB	Output is correct
39	Correct	68 ms	1536 KB	Output is correct
40	Correct	80 ms	1664 KB	Output is correct
41	Correct	75 ms	1536 KB	Output is correct
42	Correct	73 ms	1660 KB	Output is correct
43	Correct	75 ms	1536 KB	Output is correct
44	Correct	1 ms	640 KB	Output is correct
45	Correct	13 ms	1152 KB	Output is correct
46	Correct	13 ms	1152 KB	Output is correct
47	Correct	12 ms	1152 KB	Output is correct
48	Correct	143 ms	3448 KB	Output is correct
49	Correct	134 ms	3448 KB	Output is correct
50	Correct	1 ms	512 KB	Output is correct
51	Correct	106 ms	1532 KB	Output is correct
52	Correct	76 ms	1536 KB	Output is correct
53	Correct	48 ms	1664 KB	Output is correct
54	Correct	10 ms	1024 KB	Output is correct
55	Correct	9 ms	1024 KB	Output is correct
56	Correct	11 ms	1024 KB	Output is correct
57	Correct	10 ms	1024 KB	Output is correct
58	Correct	0 ms	512 KB	Output is correct
59	Correct	7 ms	1024 KB	Output is correct
60	Correct	7 ms	1024 KB	Output is correct
61	Correct	8 ms	1152 KB	Output is correct
62	Correct	1 ms	640 KB	Output is correct
63	Correct	12 ms	1076 KB	Output is correct

Submission #263366

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