oj.uz

Submission #232065

# Submission time Handle Problem Language Result Execution time Memory
232065 2020-05-15T22:45:06 Z ChrisT Travelling Merchant (APIO17_merchant) C++17
100 / 100
 120 ms 2552 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pib = pair<int,bool>;
using ll = long long;
using ld = long double;
#define all(x) (x).begin(),(x).end()
#ifdef fread_unlocked
#define fread fread_unlocked
#define fwrite fwrite_unlocked
#endif
#define lc ind<<1
#define rc ind<<1|1
const int MN = 103, MOD = 1e9+7, BASE = 31;
vector<pii> adj[MN];
ll dp[MN][MN], dist[MN][MN], d[MN][MN];//start, end
ll buy[MN][MN*10], sell[MN][MN*10], go[MN][MN];
void uin (ll &a, ll b) {if(b<a)a=b;}
int main () { 
	int n,m,K;
	scanf ("%d %d %d",&n,&m,&K);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= K; j++) {
			scanf ("%lld %lld",&buy[i][j],&sell[i][j]);
		}
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			dist[i][j] = i==j?0:1e9;
	while (m--) {
		int a,b,c; scanf ("%d %d %d",&a,&b,&c);
		uin(dist[a][b],c);
	}
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				uin(dist[i][j],dist[i][k]+dist[k][j]);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= K; k++) if (~buy[i][k] && ~sell[j][k]){
				go[i][j] = max(go[i][j],sell[j][k]-buy[i][k]);
			}
		}
	}
	auto check = [&] (int mid) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				d[i][j] = go[i][j] - dist[i][j] * mid;
			}
		}
		for (int k = 1; k <= n; k++)
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= n; j++)
					d[i][j] = max(d[i][j],d[i][k]+d[k][j]);
		for (int start = 1; start <= n; start++) {
			for (int lst = 1; lst <= n; lst++) if (lst != start && d[start][lst] + go[lst][start] - dist[lst][start] * mid >= 0) return 1;
		}
		return 0;
	};
	int low = 1, high = 1e9, mid, ans = 0;
	while (low <= high) {
		mid = (low+high)/2;
		if (check(mid)) low = (ans = mid) + 1;
		else high = mid - 1;
	}
	printf ("%d\n",ans);
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d %d %d",&n,&m,&K);
  ~~~~~~^~~~~~~~~~~~~~~~~~~~~
merchant.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf ("%lld %lld",&buy[i][j],&sell[i][j]);
    ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:32:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a,b,c; scanf ("%d %d %d",&a,&b,&c);
              ~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 2176 KB Output is correct
2 Correct 40 ms 1400 KB Output is correct
3 Correct 41 ms 1400 KB Output is correct
4 Correct 11 ms 768 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 10 ms 768 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 13 ms 896 KB Output is correct
11 Correct 10 ms 768 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 1664 KB Output is correct
2 Correct 108 ms 2296 KB Output is correct
3 Correct 45 ms 1536 KB Output is correct
4 Correct 50 ms 1664 KB Output is correct
5 Correct 48 ms 1788 KB Output is correct
6 Correct 44 ms 1536 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 11 ms 1024 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 11 ms 896 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 11 ms 1024 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 12 ms 1024 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 52 ms 1664 KB Output is correct
18 Correct 108 ms 2296 KB Output is correct
19 Correct 45 ms 1536 KB Output is correct
20 Correct 50 ms 1664 KB Output is correct
21 Correct 48 ms 1788 KB Output is correct
22 Correct 44 ms 1536 KB Output is correct
23 Correct 11 ms 896 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 11 ms 1024 KB Output is correct
26 Correct 11 ms 1024 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 10 ms 896 KB Output is correct
30 Correct 42 ms 1408 KB Output is correct
31 Correct 47 ms 1664 KB Output is correct
32 Correct 65 ms 2552 KB Output is correct
33 Correct 45 ms 1664 KB Output is correct
34 Correct 45 ms 1664 KB Output is correct
35 Correct 46 ms 1664 KB Output is correct
36 Correct 118 ms 2424 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 45 ms 1528 KB Output is correct
40 Correct 45 ms 1536 KB Output is correct
41 Correct 43 ms 1408 KB Output is correct
42 Correct 44 ms 1408 KB Output is correct
43 Correct 54 ms 1400 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 15 ms 1024 KB Output is correct
46 Correct 13 ms 1024 KB Output is correct
47 Correct 13 ms 1024 KB Output is correct
48 Correct 120 ms 2424 KB Output is correct
49 Correct 119 ms 2424 KB Output is correct
50 Correct 4 ms 384 KB Output is correct
51 Correct 75 ms 2176 KB Output is correct
52 Correct 40 ms 1400 KB Output is correct
53 Correct 41 ms 1400 KB Output is correct
54 Correct 11 ms 768 KB Output is correct
55 Correct 10 ms 896 KB Output is correct
56 Correct 10 ms 768 KB Output is correct
57 Correct 10 ms 896 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 10 ms 768 KB Output is correct
60 Correct 13 ms 896 KB Output is correct
61 Correct 10 ms 768 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 11 ms 896 KB Output is correct