oj.uz

Submission #391568

# Submission time Handle Problem Language Result Execution time Memory
391568 2021-04-19T11:38:22 Z BorisBarca Travelling Merchant (APIO17_merchant) C++14
100 / 100
 103 ms 4316 KB 
/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline int ccw(pii a, pii b, pii c) {
   return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}


inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 105;
const int K = 1005;

ll n, m, k, b[N][K], s[N][K], dist[N][N], profit[N][N], ans[N][N];

bool ok(ll x){
	REP(i, n){
		REP(j, n)
			ans[i][j] = -INFL;
	}

	REP(i, n){
		REP(j, n){
			if (dist[i][j] == INFL)
				continue;
			ans[i][j] = profit[i][j] - x * dist[i][j];
			//cout << ans[i][j] << ' ';
		}
		//cout << '\n';
		ans[i][i] = -INFL;
	}

	REP(l, n)
		REP(i, n)
			REP(j, n)
				ans[i][j] = max(ans[i][j], ans[i][l] + ans[l][j]);

	/*REP(i, n){
		REP(j, n)
			cout << ans[i][j] << ' ';
		cout << '\n';
	}*/

	REP(i, n){
		//cout << ans[i][i] << '\n';
		if (ans[i][i] >= 0)
			return true;
	}
	return false;
}

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

	cin >> n >> m >> k;
	REP(i, n){
		REP(j, k)
			cin >> b[i][j] >> s[i][j];
	}

	REP(i, n){
		REP(j, n)
			dist[i][j] = INFL;
		dist[i][i] = 0;
	}	

	REP(i, m){
		ll x, y, t; cin >> x >> y >> t;
		x--, y--;
		dist[x][y] = t;
	}

	REP(k, n)
		REP(i, n)
			REP(j, n)
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);

	REP(i, n){
		REP(j, n){
			REP(l, k)
				if (~b[i][l] && ~s[j][l])
					profit[i][j] = max(profit[i][j], -b[i][l] + s[j][l]);
			//cout << profit[i][j] << ' ';
		}
		//cout << '\n';
	}

	ll lo = 0, hi = 1e9;
	while (lo < hi){
		ll mid = (lo + hi + 1) / 2;
		//cout << mid _ ok(mid) << '\n';
		if (ok(mid))
			lo = mid;
		else
			hi = mid - 1;
	}

	cout << lo << '\n';

	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 3308 KB Output is correct
2 Correct 38 ms 1228 KB Output is correct
3 Correct 46 ms 1228 KB Output is correct
4 Correct 8 ms 812 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 6 ms 820 KB Output is correct
7 Correct 7 ms 848 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 6 ms 844 KB Output is correct
11 Correct 7 ms 824 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 7 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 820 KB Output is correct
2 Correct 7 ms 848 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 7 ms 824 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 6 ms 832 KB Output is correct
11 Correct 7 ms 844 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 10 ms 844 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 820 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 8 ms 844 KB Output is correct
18 Correct 8 ms 844 KB Output is correct
19 Correct 7 ms 844 KB Output is correct
20 Correct 7 ms 956 KB Output is correct
21 Correct 7 ms 844 KB Output is correct
22 Correct 7 ms 900 KB Output is correct
23 Correct 8 ms 972 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 7 ms 844 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 7 ms 880 KB Output is correct
31 Correct 6 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 7 ms 880 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 45 ms 1612 KB Output is correct
9 Correct 94 ms 3896 KB Output is correct
10 Correct 41 ms 1484 KB Output is correct
11 Correct 46 ms 1740 KB Output is correct
12 Correct 45 ms 1740 KB Output is correct
13 Correct 41 ms 1484 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 844 KB Output is correct
2 Correct 6 ms 832 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 6 ms 844 KB Output is correct
5 Correct 10 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 820 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 7 ms 844 KB Output is correct
12 Correct 7 ms 956 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 7 ms 900 KB Output is correct
15 Correct 8 ms 972 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 45 ms 1612 KB Output is correct
18 Correct 94 ms 3896 KB Output is correct
19 Correct 41 ms 1484 KB Output is correct
20 Correct 46 ms 1740 KB Output is correct
21 Correct 45 ms 1740 KB Output is correct
22 Correct 41 ms 1484 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 7 ms 844 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 7 ms 880 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 67 ms 3308 KB Output is correct
31 Correct 38 ms 1228 KB Output is correct
32 Correct 46 ms 1228 KB Output is correct
33 Correct 8 ms 812 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 6 ms 820 KB Output is correct
36 Correct 7 ms 848 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 6 ms 844 KB Output is correct
40 Correct 7 ms 824 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 43 ms 1356 KB Output is correct
44 Correct 42 ms 1484 KB Output is correct
45 Correct 60 ms 2528 KB Output is correct
46 Correct 41 ms 1484 KB Output is correct
47 Correct 50 ms 1484 KB Output is correct
48 Correct 44 ms 1488 KB Output is correct
49 Correct 101 ms 3984 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 40 ms 1356 KB Output is correct
53 Correct 41 ms 1488 KB Output is correct
54 Correct 40 ms 1484 KB Output is correct
55 Correct 40 ms 1368 KB Output is correct
56 Correct 39 ms 1344 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 9 ms 1108 KB Output is correct
59 Correct 8 ms 980 KB Output is correct
60 Correct 8 ms 976 KB Output is correct
61 Correct 103 ms 4316 KB Output is correct
62 Correct 102 ms 4300 KB Output is correct
63 Correct 1 ms 344 KB Output is correct