oj.uz

Submission #488117

# Submission time Handle Problem Language Result Execution time Memory
488117 2021-11-17T20:28:49 Z S2speed Travelling Merchant (APIO17_merchant) C++17
100 / 100
 60 ms 2428 KB 
#include<bits/stdc++.h>

using namespace std;

#pragma GCC optimize ("Ofast")

#define all(x) x.begin() , x.end()
#define sze(x) (ll)(x.size())
#define mp(x , y) make_pair(x , y)
#define wall cerr<<"--------------------------------------"<<endl
typedef long long int ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double db;
typedef pair<pll , ll> plll;
typedef pair<int , pii> piii;
typedef pair<pll , pll> pllll;

const ll maxn = 1e2 + 16 , maxk = 1e3 + 16 , md = 1e9 + 7 , inf = 1e10;

ll gcd(ll a , ll b){
	if(a < b) swap(a , b);
	if(b == 0) return a;
	return gcd(b , a % b);
}

ll tav(ll n , ll k){
	ll res = 1;
	while(k > 0){
		if(k & 1){
			res *= n; res %= md;
		}
		n *= n; n %= md;
		k >>= 1;
	}
	return res;
}

ll n , m , k;
ll w[maxn][maxn] , dis[maxn][maxn] , a[maxn][maxk] ,  b[maxn][maxk] , f[maxn][maxn];
vector<pll> adj[maxn];
priority_queue<pll , vector<pll> , greater<pll>> pq;

void dij(ll r){
	pq.push({dis[r][r] = 0 , r});
	while(!pq.empty()){
		pll q = pq.top(); pq.pop();
		if(dis[r][q.second] != q.first) continue;
		ll v = q.second;
		for(auto p : adj[v]){
			ll i = p.first , w = p.second;
			if(dis[r][i] > dis[r][v] + w){
				dis[r][i] = dis[r][v] + w;
				pq.push({dis[r][i] , i});
			}
		}
	}
	return;
}

bool check(ll x){
	for(ll i = 0 ; i < n ; i++){
		for(ll j = 0 ; j < n ; j++){
			f[i][j] = 1ll * x * dis[i][j] - w[i][j];
		}
		f[i][i] = inf;
	}
	for(ll k = 0 ; k < n ; k++){
		for(ll i = 0 ; i < n ; i++){
			for(ll j = 0 ; j < n ; j++){
				if(f[i][k] < inf) f[i][j] = min(f[i][j] , f[i][k] + f[k][j]);
			}
		}
	}
	for(ll i = 0 ; i < n ; i++){
		if(f[i][i] <= 0) return true;
	}
	return false;
}

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	cin>>n>>m>>k;
	for(ll i = 0 ; i < n ; i++){
		for(ll j = 0 ; j < k ; j++){
			cin>>a[i][j]>>b[i][j];
		}
	}
	for(ll i = 0 ; i < n ; i++){
		for(ll j = 0 ; j < n ; j++){
			ll h = 0;
			for(ll q = 0 ; q < k ; q++){
				if(b[j][q] != -1 && a[i][q] != -1) h = max(h , b[j][q] - a[i][q]);
			}
			w[i][j] = h;
			dis[i][j] = inf;
		}
	}
	for(ll i = 0 ; i < m ; i++){
		ll v , u , w;
		cin>>v>>u>>w; v--; u--;
		adj[v].push_back({u , w});
	}
	for(ll i = 0 ; i < n ; i++){
		dij(i);
	}
	ll l = 0 , r = 1e9 + 112;
	while(l < r - 1){
		ll m = (r + l) >> 1;
		if(check(m)){
			l = m;
		} else {
			r = m;
		}
	}
	cout<<l<<'\n';
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2124 KB Output is correct
2 Correct 8 ms 1408 KB Output is correct
3 Correct 32 ms 1356 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 4 ms 844 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 5 ms 880 KB Output is correct
11 Correct 5 ms 844 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 4 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 844 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 844 KB Output is correct
5 Correct 5 ms 880 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 4 ms 844 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 5 ms 800 KB Output is correct
11 Correct 6 ms 844 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 6 ms 844 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 2 ms 844 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 2 ms 844 KB Output is correct
18 Correct 3 ms 844 KB Output is correct
19 Correct 5 ms 820 KB Output is correct
20 Correct 4 ms 884 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 7 ms 896 KB Output is correct
23 Correct 8 ms 972 KB Output is correct
24 Correct 5 ms 904 KB Output is correct
25 Correct 5 ms 844 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 4 ms 844 KB Output is correct
28 Correct 5 ms 928 KB Output is correct
29 Correct 4 ms 844 KB Output is correct
30 Correct 10 ms 844 KB Output is correct
31 Correct 5 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 844 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 5 ms 928 KB Output is correct
5 Correct 4 ms 844 KB Output is correct
6 Correct 10 ms 844 KB Output is correct
7 Correct 5 ms 844 KB Output is correct
8 Correct 32 ms 1472 KB Output is correct
9 Correct 40 ms 2180 KB Output is correct
10 Correct 27 ms 1356 KB Output is correct
11 Correct 9 ms 1484 KB Output is correct
12 Correct 17 ms 1560 KB Output is correct
13 Correct 26 ms 1476 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 844 KB Output is correct
2 Correct 5 ms 800 KB Output is correct
3 Correct 6 ms 844 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 2 ms 844 KB Output is correct
8 Correct 4 ms 844 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 3 ms 844 KB Output is correct
11 Correct 5 ms 820 KB Output is correct
12 Correct 4 ms 884 KB Output is correct
13 Correct 5 ms 844 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 8 ms 972 KB Output is correct
16 Correct 5 ms 904 KB Output is correct
17 Correct 32 ms 1472 KB Output is correct
18 Correct 40 ms 2180 KB Output is correct
19 Correct 27 ms 1356 KB Output is correct
20 Correct 9 ms 1484 KB Output is correct
21 Correct 17 ms 1560 KB Output is correct
22 Correct 26 ms 1476 KB Output is correct
23 Correct 5 ms 844 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 4 ms 844 KB Output is correct
26 Correct 5 ms 928 KB Output is correct
27 Correct 4 ms 844 KB Output is correct
28 Correct 10 ms 844 KB Output is correct
29 Correct 5 ms 844 KB Output is correct
30 Correct 31 ms 2124 KB Output is correct
31 Correct 8 ms 1408 KB Output is correct
32 Correct 32 ms 1356 KB Output is correct
33 Correct 3 ms 844 KB Output is correct
34 Correct 4 ms 844 KB Output is correct
35 Correct 5 ms 844 KB Output is correct
36 Correct 7 ms 844 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 5 ms 844 KB Output is correct
39 Correct 5 ms 880 KB Output is correct
40 Correct 5 ms 844 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 4 ms 844 KB Output is correct
43 Correct 22 ms 1356 KB Output is correct
44 Correct 24 ms 1556 KB Output is correct
45 Correct 36 ms 2180 KB Output is correct
46 Correct 23 ms 1484 KB Output is correct
47 Correct 25 ms 1504 KB Output is correct
48 Correct 24 ms 1592 KB Output is correct
49 Correct 37 ms 2068 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 27 ms 1452 KB Output is correct
53 Correct 23 ms 1640 KB Output is correct
54 Correct 23 ms 1472 KB Output is correct
55 Correct 26 ms 1356 KB Output is correct
56 Correct 29 ms 1452 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 5 ms 972 KB Output is correct
59 Correct 4 ms 844 KB Output is correct
60 Correct 3 ms 972 KB Output is correct
61 Correct 50 ms 2376 KB Output is correct
62 Correct 60 ms 2428 KB Output is correct
63 Correct 0 ms 332 KB Output is correct