oj.uz

Submission #937757

# Submission time Handle Problem Language Result Execution time Memory
937757 2024-03-04T12:40:40 Z Baizho Travelling Merchant (APIO17_merchant) C++14
100 / 100
 61 ms 3532 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, m, k1, b[105][1005], s[105][1005];
long long dis[105][105], profit[105][105], dis1[105][105];
void Baizho() {
	cin>>n>>m>>k1;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= k1; j ++) {
			cin>>b[i][j]>>s[i][j];
		}
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++) {
			dis[i][j] = inf;
		}
	}
	for(int i = 1; i <= m; i ++) {
		int a, b, w; cin>>a>>b>>w;
		dis[a][b] = w;
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++) {
			for(int k = 1; k <= k1; k ++) {
				if(b[i][k] != -1 && s[j][k] != -1) profit[i][j] = max(profit[i][j], 1LL * s[j][k] - b[i][k]);
			}
		}
	}
	for(int k = 1; k <= n; k ++) {
		for(int i = 1; i <= n; i ++) {
			for(int j = 1; j <= n; j ++) {
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
			}
		}
	}
	ll l = 1, r = 2e9;
	while(l <= r) {
		ll x = (l + r) / 2;
		for(int i = 1; i <= n; i ++) {
			for(int j = 1; j <= n; j ++) {
				dis1[i][j] = x * min(dis[i][j], inf / x) - profit[i][j];
			}
		}
		for(int i = 1; i <= n; i ++) {
			for(int j = 1; j <= n; j ++) {
				for(int k = 1; k <= n; k ++) {
					dis1[j][k] = min(dis1[j][k], dis1[j][i] + dis1[i][k]);
				}
			}
		}
		bool ok = 0;
		for(int i = 1; i <= n; i ++) ok |= (dis1[i][i] <= 0);
		if(ok) l = x + 1;
		else r = x - 1;
	}
	cout<<l - 1<<"\n";
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

merchant.cpp: In function 'void Freopen(std::string)':
merchant.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1372 KB Output is correct
2 Correct 29 ms 1372 KB Output is correct
3 Correct 33 ms 1400 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 952 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 856 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 856 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 856 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 988 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 4 ms 1112 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 6 ms 860 KB Output is correct
19 Correct 6 ms 1040 KB Output is correct
20 Correct 5 ms 860 KB Output is correct
21 Correct 7 ms 1116 KB Output is correct
22 Correct 4 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 4 ms 860 KB Output is correct
31 Correct 4 ms 856 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 33 ms 1372 KB Output is correct
9 Correct 61 ms 1492 KB Output is correct
10 Correct 29 ms 1372 KB Output is correct
11 Correct 33 ms 1372 KB Output is correct
12 Correct 31 ms 1372 KB Output is correct
13 Correct 35 ms 1368 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 988 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 1112 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 6 ms 1040 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 33 ms 1372 KB Output is correct
18 Correct 61 ms 1492 KB Output is correct
19 Correct 29 ms 1372 KB Output is correct
20 Correct 33 ms 1372 KB Output is correct
21 Correct 31 ms 1372 KB Output is correct
22 Correct 35 ms 1368 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 856 KB Output is correct
30 Correct 46 ms 1372 KB Output is correct
31 Correct 29 ms 1372 KB Output is correct
32 Correct 33 ms 1400 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 4 ms 952 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 4 ms 976 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 4 ms 856 KB Output is correct
40 Correct 4 ms 856 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 856 KB Output is correct
43 Correct 28 ms 1372 KB Output is correct
44 Correct 37 ms 1372 KB Output is correct
45 Correct 49 ms 1988 KB Output is correct
46 Correct 30 ms 1372 KB Output is correct
47 Correct 30 ms 1368 KB Output is correct
48 Correct 33 ms 1372 KB Output is correct
49 Correct 57 ms 3260 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 29 ms 1372 KB Output is correct
53 Correct 34 ms 1708 KB Output is correct
54 Correct 29 ms 1372 KB Output is correct
55 Correct 29 ms 1372 KB Output is correct
56 Correct 28 ms 1372 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 5 ms 860 KB Output is correct
59 Correct 5 ms 860 KB Output is correct
60 Correct 5 ms 860 KB Output is correct
61 Correct 54 ms 3340 KB Output is correct
62 Correct 59 ms 3532 KB Output is correct
63 Correct 1 ms 348 KB Output is correct