Submission #411687

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
411687	2021-05-25T18:04:33 Z	soroush	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	194 ms	4612 KB

merchant

//叫んで 藻掻もがいて 瞼まぶたを腫らしても
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 110;
const int maxk = 1010;
const ll mod = 1e9+7;

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m , k;
int b[maxn][maxk] , s[maxn][maxk];
vector < pii > adj[maxn];

int dist[maxn][maxn] , mx[maxn][maxn];

ll w[maxn][maxn];
ll f[maxn][maxn];
ll d[maxn];

bool chk(ll x){
	for(int i = 1 ; i <= n ; i ++)
		for(int j = 1 ; j <= n ; j ++)if(dist[i][j] != dist[0][0])
			w[i][j] = -(mx[i][j] - dist[i][j] * x);
		else
			w[i][j] = 1e15;
	ms(d , 63);
	d[1] = 0;
	if(0){
		for(int i = 1 ; i <= n ; i ++ , cout << endl)
			for(int j = 1 ; j <= n ; j ++)
				cout << w[i][j] << ' ' ;
	}
	for(int i = 1 ; i < n ; i ++)
		for(int j = 1 ; j <= n ; j ++)
			for(int k = 1 ; k <= n ; k ++)
				if(d[j] < 1e18 - w[j][k])
					d[k] = min(d[k] , d[j] + w[j][k]); 
	for(int j = 1 ; j <= n ; j ++)
		for(int k = 1 ; k <= n ; k ++)if(k ^ j)
			if(d[j] < 1e18 - w[j][k] and d[k] > d[j] + w[j][k])
				return 1;
	ms(f , 63);
	for(int i = 1 ; i <= n ; i ++)f[i][i] = 0;
	for(int i = 1 ; i <= n ; i ++)
		for(int j = 1 ; j <= n ; j ++)
			f[i][j] = min(f[i][j] , w[i][j]);
	for(int k = 1 ; k <= n ; k ++)
		for(int i = 1 ; i <= n ; i ++)
			for(int j = 1 ; j <= n ; j ++)
				if(f[i][k] != f[0][0] and f[k][j] != f[0][0])
					f[i][j] = min(f[i][j] , f[i][k] + f[k][j]);
	for(int i = 1 ; i <= n ; i ++)
		for(int j = i+1 ; j <= n; j ++)
			if(f[i][j] + f[j][i] == 0)
				return  1;
	return 0;
}

int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	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];
	ms(dist , 63);
	for(int i = 1 ; i <= n ; i ++) dist[i][i] = 0;
	for(int i = 1 ; i <= m ; i ++){
		int u, v, w;
		cin >> u >> v >> w;
		adj[u].pb({v , w});
		dist[u][v] = min(dist[u][v] , w);
	}
	for(int k = 1 ; k <= n ; k ++)
		for(int i = 1 ; i <= n ; i ++)
			for(int j = 1 ; j <= n ; j ++)
				if(dist[i][k] != dist[0][0] and dist[k][j] != dist[0][0])
					dist[i][j] = min(dist[i][j] , dist[i][k] + dist[k][j]);
	for(int i = 1 ; i <= n ; i ++)
		for(int j = 1 ; j <= n ; j ++) if(j ^ i)
			for(int l = 1 ; l <= k ; l ++) if(s[j][l] != -1 and b[i][l] != -1)
				mx[i][j] = max(mx[i][j] , s[j][l] - b[i][l]);
	ll l = 0 , r = 1e10;
	while(r - l > 1){
		ll mid = (l + r) / 2;
		if(chk(mid))l = mid;
		else r = mid;
	}
	cout << l;
	return(0);
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	164 ms	2244 KB	Output is correct
2	Correct	137 ms	1400 KB	Output is correct
3	Correct	122 ms	1356 KB	Output is correct
4	Correct	18 ms	972 KB	Output is correct
5	Correct	17 ms	984 KB	Output is correct
6	Correct	20 ms	968 KB	Output is correct
7	Correct	17 ms	1008 KB	Output is correct
8	Correct	1 ms	460 KB	Output is correct
9	Correct	18 ms	972 KB	Output is correct
10	Correct	18 ms	872 KB	Output is correct
11	Correct	17 ms	980 KB	Output is correct
12	Correct	1 ms	588 KB	Output is correct
13	Correct	20 ms	972 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	968 KB	Output is correct
2	Correct	17 ms	1008 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	18 ms	972 KB	Output is correct
5	Correct	18 ms	872 KB	Output is correct
6	Correct	17 ms	980 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	20 ms	972 KB	Output is correct
9	Correct	18 ms	972 KB	Output is correct
10	Correct	16 ms	972 KB	Output is correct
11	Correct	19 ms	972 KB	Output is correct
12	Correct	17 ms	972 KB	Output is correct
13	Correct	18 ms	1092 KB	Output is correct
14	Correct	1 ms	460 KB	Output is correct
15	Correct	18 ms	1024 KB	Output is correct
16	Correct	19 ms	1064 KB	Output is correct
17	Correct	17 ms	972 KB	Output is correct
18	Correct	17 ms	972 KB	Output is correct
19	Correct	18 ms	1100 KB	Output is correct
20	Correct	18 ms	1100 KB	Output is correct
21	Correct	18 ms	1112 KB	Output is correct
22	Correct	18 ms	1052 KB	Output is correct
23	Correct	19 ms	1100 KB	Output is correct
24	Correct	17 ms	1000 KB	Output is correct
25	Correct	19 ms	972 KB	Output is correct
26	Correct	1 ms	460 KB	Output is correct
27	Correct	17 ms	1044 KB	Output is correct
28	Correct	18 ms	1048 KB	Output is correct
29	Correct	18 ms	1044 KB	Output is correct
30	Correct	17 ms	972 KB	Output is correct
31	Correct	16 ms	972 KB	Output is correct

Subtask #3

33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	972 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	17 ms	1044 KB	Output is correct
4	Correct	18 ms	1048 KB	Output is correct
5	Correct	18 ms	1044 KB	Output is correct
6	Correct	17 ms	972 KB	Output is correct
7	Correct	16 ms	972 KB	Output is correct
8	Correct	133 ms	1488 KB	Output is correct
9	Correct	166 ms	2236 KB	Output is correct
10	Correct	117 ms	1484 KB	Output is correct
11	Correct	138 ms	1512 KB	Output is correct
12	Correct	118 ms	1696 KB	Output is correct
13	Correct	120 ms	1540 KB	Output is correct

Subtask #4

34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	972 KB	Output is correct
2	Correct	16 ms	972 KB	Output is correct
3	Correct	19 ms	972 KB	Output is correct
4	Correct	17 ms	972 KB	Output is correct
5	Correct	18 ms	1092 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	18 ms	1024 KB	Output is correct
8	Correct	19 ms	1064 KB	Output is correct
9	Correct	17 ms	972 KB	Output is correct
10	Correct	17 ms	972 KB	Output is correct
11	Correct	18 ms	1100 KB	Output is correct
12	Correct	18 ms	1100 KB	Output is correct
13	Correct	18 ms	1112 KB	Output is correct
14	Correct	18 ms	1052 KB	Output is correct
15	Correct	19 ms	1100 KB	Output is correct
16	Correct	17 ms	1000 KB	Output is correct
17	Correct	133 ms	1488 KB	Output is correct
18	Correct	166 ms	2236 KB	Output is correct
19	Correct	117 ms	1484 KB	Output is correct
20	Correct	138 ms	1512 KB	Output is correct
21	Correct	118 ms	1696 KB	Output is correct
22	Correct	120 ms	1540 KB	Output is correct
23	Correct	19 ms	972 KB	Output is correct
24	Correct	1 ms	460 KB	Output is correct
25	Correct	17 ms	1044 KB	Output is correct
26	Correct	18 ms	1048 KB	Output is correct
27	Correct	18 ms	1044 KB	Output is correct
28	Correct	17 ms	972 KB	Output is correct
29	Correct	16 ms	972 KB	Output is correct
30	Correct	164 ms	2244 KB	Output is correct
31	Correct	137 ms	1400 KB	Output is correct
32	Correct	122 ms	1356 KB	Output is correct
33	Correct	18 ms	972 KB	Output is correct
34	Correct	17 ms	984 KB	Output is correct
35	Correct	20 ms	968 KB	Output is correct
36	Correct	17 ms	1008 KB	Output is correct
37	Correct	1 ms	460 KB	Output is correct
38	Correct	18 ms	972 KB	Output is correct
39	Correct	18 ms	872 KB	Output is correct
40	Correct	17 ms	980 KB	Output is correct
41	Correct	1 ms	588 KB	Output is correct
42	Correct	20 ms	972 KB	Output is correct
43	Correct	130 ms	1484 KB	Output is correct
44	Correct	131 ms	1680 KB	Output is correct
45	Correct	146 ms	2756 KB	Output is correct
46	Correct	130 ms	1612 KB	Output is correct
47	Correct	131 ms	1612 KB	Output is correct
48	Correct	128 ms	1704 KB	Output is correct
49	Correct	194 ms	4292 KB	Output is correct
50	Correct	1 ms	588 KB	Output is correct
51	Correct	1 ms	588 KB	Output is correct
52	Correct	130 ms	1484 KB	Output is correct
53	Correct	134 ms	1740 KB	Output is correct
54	Correct	138 ms	1572 KB	Output is correct
55	Correct	127 ms	1484 KB	Output is correct
56	Correct	118 ms	1356 KB	Output is correct
57	Correct	1 ms	460 KB	Output is correct
58	Correct	20 ms	1136 KB	Output is correct
59	Correct	21 ms	1100 KB	Output is correct
60	Correct	20 ms	1084 KB	Output is correct
61	Correct	194 ms	4612 KB	Output is correct
62	Correct	186 ms	4584 KB	Output is correct
63	Correct	1 ms	460 KB	Output is correct