oj.uz

Submission #727219

# Submission time Handle Problem Language Result Execution time Memory
727219 2023-04-20T08:31:19 Z josanneo22 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 54 ms 1364 KB 
#pragma GCC optimize(Ofast)
#pragma GCC optimization (unroll-loops)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
 
const int maxn = int(1e2) + 11;
const int maxk = int(1e3) + 11;
const ll inf = 0x3f3f3f3f * ((1ll<<32)+1);
 
int n, m, knd;
int buy[maxn][maxk], sell[maxn][maxk];
ll de[maxn][maxn];
int mxsell[maxn][maxn];
 
#define Floyd(d) { \
	for (int j=1; j<=n; ++j) { \
		for (int i=1; i<=n; ++i) for (int k=1; k<=n; ++k) \
			d[i][k] = min(d[i][k], d[i][j] + d[j][k]); \
	} \
}
 
inline int rd(){
	int x=0,w=1;
	char ch=getchar();
	for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') w=-1;
	for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1) +(x<<3) +ch-'0';
	return x*w;
}
int main() {
	cin.tie(0)->sync_with_stdio(0); cout.tie(0);
	n=rd(),m=rd(),knd=rd();
	for (int i=1; i<=n; ++i) for (int j=1; j<=knd; ++j) {
		buy[i][j]=rd();sell[i][j]=rd();
	}
	memset(de, 0x3f, sizeof(de));
	for (int i=1; i<=m; ++i) {
		int f=rd(), t=rd(), v=rd();
		de[f][t] = min(de[f][t], ll(v));
	}
	Floyd(de);
	
	for (int t=1; t<=knd; ++t) {
		for (int i=1; i<=n; ++i) if (buy[i][t] != -1)
		for (int j=1; j<=n; ++j) if (sell[j][t] != -1) {
			mxsell[i][j] = max(mxsell[i][j], sell[j][t]-buy[i][t]);
		}
	}
	//compare profit/time>=some value
	//profit>=some value *time
	//profit-some_value*time>=0
	int ql=-1, qr=int(1e9)+10;
	while (ql+1 < qr) {
		int c = (ql+qr)>>1;
		static ll dc[maxn][maxn];
		for (int i=1; i<=n; ++i) for (int j=1; j<=n; ++j) {
			if (de[i][j] == inf) dc[i][j] = inf;
			else dc[i][j] = c*1ll*de[i][j]-mxsell[i][j];
		}
		Floyd(dc);
		bool loop = false;
		for (int i=1; i<=n; ++i) if (dc[i][i] <= 0) { loop = true; break; }
		//if i to go i is negative,meaning there is a negative loop
		(loop ? ql : qr) = c;
	}
	printf("%d",ql);
 
	return 0;
}

Compilation message

merchant.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization (unroll-loops)
      | 
merchant.cpp:2:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
    2 | #pragma GCC optimize(Ofast)
      |                      ^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1236 KB Output is correct
2 Correct 35 ms 1236 KB Output is correct
3 Correct 41 ms 1356 KB Output is correct
4 Correct 8 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 9 ms 876 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 5 ms 816 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 6 ms 892 KB Output is correct
4 Correct 6 ms 884 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 5 ms 892 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 37 ms 1236 KB Output is correct
9 Correct 54 ms 1276 KB Output is correct
10 Correct 36 ms 1348 KB Output is correct
11 Correct 35 ms 1236 KB Output is correct
12 Correct 35 ms 1236 KB Output is correct
13 Correct 35 ms 1332 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 980 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 896 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 6 ms 888 KB Output is correct
15 Correct 7 ms 852 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 37 ms 1236 KB Output is correct
18 Correct 54 ms 1276 KB Output is correct
19 Correct 36 ms 1348 KB Output is correct
20 Correct 35 ms 1236 KB Output is correct
21 Correct 35 ms 1236 KB Output is correct
22 Correct 35 ms 1332 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 6 ms 892 KB Output is correct
26 Correct 6 ms 884 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 5 ms 892 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 36 ms 1236 KB Output is correct
31 Correct 35 ms 1236 KB Output is correct
32 Correct 41 ms 1356 KB Output is correct
33 Correct 8 ms 852 KB Output is correct
34 Correct 6 ms 852 KB Output is correct
35 Correct 5 ms 852 KB Output is correct
36 Correct 9 ms 876 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 5 ms 816 KB Output is correct
39 Correct 4 ms 852 KB Output is correct
40 Correct 5 ms 852 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 32 ms 1236 KB Output is correct
44 Correct 32 ms 1236 KB Output is correct
45 Correct 36 ms 1236 KB Output is correct
46 Correct 32 ms 1236 KB Output is correct
47 Correct 33 ms 1356 KB Output is correct
48 Correct 33 ms 1236 KB Output is correct
49 Correct 50 ms 1344 KB Output is correct
50 Correct 0 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 37 ms 1324 KB Output is correct
53 Correct 35 ms 1236 KB Output is correct
54 Correct 32 ms 1236 KB Output is correct
55 Correct 33 ms 1236 KB Output is correct
56 Correct 33 ms 1236 KB Output is correct
57 Correct 0 ms 468 KB Output is correct
58 Correct 7 ms 852 KB Output is correct
59 Correct 6 ms 852 KB Output is correct
60 Correct 7 ms 896 KB Output is correct
61 Correct 54 ms 1340 KB Output is correct
62 Correct 52 ms 1364 KB Output is correct
63 Correct 1 ms 468 KB Output is correct