oj.uz

Submission #485663

# Submission time Handle Problem Language Result Execution time Memory
485663 2021-11-08T22:37:47 Z MilosMilutinovic Travelling Merchant (APIO17_merchant) C++14
100 / 100
 84 ms 4484 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
const ll mod2=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010;
int n,m,k,b[N][N],s[N][N],a[N][N];
ll d[N][N];
db dis[N][N];

bool check(ll x) {
	rep(i,1,n+1) rep(j,1,n+1) dis[i][j]=x*min((ll)d[i][j],(ll)1e18/x)-a[i][j];
	rep(p,1,n+1) rep(i,1,n+1) rep(j,1,n+1) dis[i][j]=min(dis[i][j],dis[i][p]+dis[p][j]);
	rep(i,1,n+1) if (dis[i][i]<=0) return 1;
	return 0;
}

int main() {
	scanf("%d%d%d",&n,&m,&k);
	rep(i,1,n+1) rep(j,1,k+1) scanf("%d%d",&b[i][j],&s[i][j]);
	rep(i,1,n+1) rep(j,1,n+1) d[i][j]=(ll)1e18;
	rep(i,1,m+1) {
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		d[u][v]=min(d[u][v],(ll)w);
	}
	rep(p,1,n+1) rep(i,1,n+1) rep(j,1,n+1) d[i][j]=min(d[i][j],d[i][p]+d[p][j]);
	rep(i,1,n+1) rep(j,1,n+1) rep(p,1,k+1) {
		if (b[i][p]!=-1&&s[j][p]!=-1) a[i][j]=max(a[i][j],s[j][p]-b[i][p]);
	}
	ll l=1,r=1e9,ans=0;
	while (l<=r) {
		ll md=l+r>>1;
		if (check(md)) ans=md,l=md+1;
		else r=md-1;
	}
	printf("%lld",ans);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:50:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |   ll md=l+r>>1;
      |         ~^~
merchant.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  scanf("%d%d%d",&n,&m,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:37:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  rep(i,1,n+1) rep(j,1,k+1) scanf("%d%d",&b[i][j],&s[i][j]);
      |                            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   scanf("%d%d%d",&u,&v,&w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1996 KB Output is correct
2 Correct 28 ms 2060 KB Output is correct
3 Correct 30 ms 2044 KB Output is correct
4 Correct 4 ms 1228 KB Output is correct
5 Correct 4 ms 1100 KB Output is correct
6 Correct 4 ms 1100 KB Output is correct
7 Correct 6 ms 1100 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 4 ms 1148 KB Output is correct
10 Correct 4 ms 1100 KB Output is correct
11 Correct 5 ms 1148 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 5 ms 1100 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1100 KB Output is correct
2 Correct 6 ms 1100 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 4 ms 1148 KB Output is correct
5 Correct 4 ms 1100 KB Output is correct
6 Correct 5 ms 1148 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 5 ms 1100 KB Output is correct
9 Correct 4 ms 1228 KB Output is correct
10 Correct 4 ms 1100 KB Output is correct
11 Correct 5 ms 1356 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 6 ms 1340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 5 ms 1356 KB Output is correct
16 Correct 5 ms 1360 KB Output is correct
17 Correct 5 ms 1164 KB Output is correct
18 Correct 7 ms 1228 KB Output is correct
19 Correct 5 ms 1356 KB Output is correct
20 Correct 5 ms 1344 KB Output is correct
21 Correct 5 ms 1356 KB Output is correct
22 Correct 5 ms 1356 KB Output is correct
23 Correct 6 ms 1408 KB Output is correct
24 Correct 5 ms 1080 KB Output is correct
25 Correct 5 ms 1356 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 5 ms 1356 KB Output is correct
28 Correct 5 ms 1356 KB Output is correct
29 Correct 5 ms 1356 KB Output is correct
30 Correct 6 ms 1356 KB Output is correct
31 Correct 4 ms 1228 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1356 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 5 ms 1356 KB Output is correct
4 Correct 5 ms 1356 KB Output is correct
5 Correct 5 ms 1356 KB Output is correct
6 Correct 6 ms 1356 KB Output is correct
7 Correct 4 ms 1228 KB Output is correct
8 Correct 34 ms 2352 KB Output is correct
9 Correct 81 ms 4080 KB Output is correct
10 Correct 31 ms 2532 KB Output is correct
11 Correct 34 ms 2648 KB Output is correct
12 Correct 33 ms 2648 KB Output is correct
13 Correct 30 ms 2508 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1228 KB Output is correct
2 Correct 4 ms 1100 KB Output is correct
3 Correct 5 ms 1356 KB Output is correct
4 Correct 7 ms 1228 KB Output is correct
5 Correct 6 ms 1340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 5 ms 1356 KB Output is correct
8 Correct 5 ms 1360 KB Output is correct
9 Correct 5 ms 1164 KB Output is correct
10 Correct 7 ms 1228 KB Output is correct
11 Correct 5 ms 1356 KB Output is correct
12 Correct 5 ms 1344 KB Output is correct
13 Correct 5 ms 1356 KB Output is correct
14 Correct 5 ms 1356 KB Output is correct
15 Correct 6 ms 1408 KB Output is correct
16 Correct 5 ms 1080 KB Output is correct
17 Correct 34 ms 2352 KB Output is correct
18 Correct 81 ms 4080 KB Output is correct
19 Correct 31 ms 2532 KB Output is correct
20 Correct 34 ms 2648 KB Output is correct
21 Correct 33 ms 2648 KB Output is correct
22 Correct 30 ms 2508 KB Output is correct
23 Correct 5 ms 1356 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 5 ms 1356 KB Output is correct
26 Correct 5 ms 1356 KB Output is correct
27 Correct 5 ms 1356 KB Output is correct
28 Correct 6 ms 1356 KB Output is correct
29 Correct 4 ms 1228 KB Output is correct
30 Correct 51 ms 1996 KB Output is correct
31 Correct 28 ms 2060 KB Output is correct
32 Correct 30 ms 2044 KB Output is correct
33 Correct 4 ms 1228 KB Output is correct
34 Correct 4 ms 1100 KB Output is correct
35 Correct 4 ms 1100 KB Output is correct
36 Correct 6 ms 1100 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 4 ms 1148 KB Output is correct
39 Correct 4 ms 1100 KB Output is correct
40 Correct 5 ms 1148 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 5 ms 1100 KB Output is correct
43 Correct 30 ms 2108 KB Output is correct
44 Correct 31 ms 2508 KB Output is correct
45 Correct 45 ms 2876 KB Output is correct
46 Correct 31 ms 2508 KB Output is correct
47 Correct 31 ms 2524 KB Output is correct
48 Correct 31 ms 2508 KB Output is correct
49 Correct 82 ms 4292 KB Output is correct
50 Correct 1 ms 436 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 30 ms 2124 KB Output is correct
53 Correct 33 ms 2252 KB Output is correct
54 Correct 31 ms 2252 KB Output is correct
55 Correct 29 ms 2124 KB Output is correct
56 Correct 32 ms 1996 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 6 ms 1356 KB Output is correct
59 Correct 6 ms 1440 KB Output is correct
60 Correct 6 ms 1356 KB Output is correct
61 Correct 84 ms 4484 KB Output is correct
62 Correct 82 ms 4420 KB Output is correct
63 Correct 1 ms 332 KB Output is correct