oj.uz

Submission #266347

# Submission time Handle Problem Language Result Execution time Memory
266347 2020-08-15T08:08:54 Z _7_7_ Travelling Merchant (APIO17_merchant) C++14
100 / 100
 129 ms 5112 KB 
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 112;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
 
int n, m, k, b[N][N*N], s[N][N*N], d[N][N], c[N][N], v, u, w, C[N][N], D[N][N];
int d1[N][N], d2[N][N];


bool check (int x) {
	for (int i = 1; i <= n; ++i)	
		for (int j = 1; j <= n; ++j) 
			if (i != j){
			    if (d[i][j] < INF)
					d1[i][j] = d[i][j]*x - c[i][j]; 
				else
					d1[i][j] = INF;
			} else
				d1[i][j] = INF;


	for (int k = 1; k <= n; ++k)
 		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				if (d1[i][k] < INF && d1[k][j] < INF)
					d1[i][j] = min(d1[i][j], d1[i][k] + d1[k][j]);

	for (int i = 1; i <= n; ++i)
		if (d1[i][i] <= 0)
			return 1;


	return 0;	    	
}

main () {
	scanf("%lld%lld%lld", &n, &m, &k);
	for (int i = 1; i <= n; ++i) 
		for (int j = 1; j <= k; ++j) 
			scanf("%lld%lld", &b[i][j], &s[i][j]);		
 
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			if (i != j)
				d[i][j] = INF;
 
	
	while (m--) {
		scanf("%lld%lld%lld", &v, &u, &w);
		d[v][u] = min(d[v][u], w);
	}
 
	for (int k = 1; k <= n; ++k)
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
 
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			for (int x = 1; x <= k; ++x)
				if (b[i][x] != -1 && s[j][x] != -1)
					c[i][j] = max(c[i][j], s[j][x] - b[i][x]);


	int l = 1, r = inf;
	while (l <= r) {
		int mid = (l + r) / 2;
		if (check(mid)) 
			l = mid + 1;
		else 
			r = mid - 1;		 
		
	}				    

	cout << l - 1 << endl;
}

Compilation message

merchant.cpp:74:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 | main () {
      |       ^
merchant.cpp: In function 'int main()':
merchant.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |  scanf("%lld%lld%lld", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:78:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   78 |    scanf("%lld%lld", &b[i][j], &s[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   87 |   scanf("%lld%lld%lld", &v, &u, &w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 2936 KB Output is correct
2 Correct 51 ms 1528 KB Output is correct
3 Correct 46 ms 1408 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 7 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1884 KB Output is correct
2 Correct 111 ms 3068 KB Output is correct
3 Correct 61 ms 1408 KB Output is correct
4 Correct 61 ms 1792 KB Output is correct
5 Correct 53 ms 2048 KB Output is correct
6 Correct 49 ms 1536 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 7 ms 896 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 11 ms 896 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 53 ms 1884 KB Output is correct
18 Correct 111 ms 3068 KB Output is correct
19 Correct 61 ms 1408 KB Output is correct
20 Correct 61 ms 1792 KB Output is correct
21 Correct 53 ms 2048 KB Output is correct
22 Correct 49 ms 1536 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 8 ms 896 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 61 ms 1408 KB Output is correct
31 Correct 50 ms 1920 KB Output is correct
32 Correct 90 ms 3064 KB Output is correct
33 Correct 51 ms 1944 KB Output is correct
34 Correct 59 ms 1920 KB Output is correct
35 Correct 56 ms 1920 KB Output is correct
36 Correct 124 ms 4932 KB Output is correct
37 Correct 1 ms 488 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 51 ms 1528 KB Output is correct
40 Correct 69 ms 1540 KB Output is correct
41 Correct 50 ms 1440 KB Output is correct
42 Correct 55 ms 1488 KB Output is correct
43 Correct 49 ms 1408 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 10 ms 1152 KB Output is correct
46 Correct 9 ms 1152 KB Output is correct
47 Correct 9 ms 1152 KB Output is correct
48 Correct 126 ms 5112 KB Output is correct
49 Correct 129 ms 5016 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 84 ms 2936 KB Output is correct
52 Correct 51 ms 1528 KB Output is correct
53 Correct 46 ms 1408 KB Output is correct
54 Correct 7 ms 896 KB Output is correct
55 Correct 7 ms 896 KB Output is correct
56 Correct 7 ms 896 KB Output is correct
57 Correct 8 ms 896 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 9 ms 896 KB Output is correct
60 Correct 7 ms 896 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 7 ms 896 KB Output is correct