oj.uz

Submission #172836

# Submission time Handle Problem Language Result Execution time Memory
172836 2020-01-02T16:37:12 Z dndhk Travelling Merchant (APIO17_merchant) C++14
100 / 100
 479 ms 4344 KB 
#include <bits/stdc++.h>

#define all(v) (v).begin(), (v).end()
#define sortv(v) sort(all(v))
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define pb push_back
#define FI first
#define SE second
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define test 0
#define TEST if(test)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int MOD = 1000000007; // 998244353
const int INF = 2e9;
const ll INFLL = 1e16;
const int MAX_N = 100;
const int MAX_K = 1000;

int N, M, K;
ll B[MAX_N+1][MAX_K+1], S[MAX_N+1][MAX_K+1];
ll dist[MAX_N+1][MAX_N+1];

struct Edge{
	int x, y;
	ll c;
};
vector<Edge> edge;

bool chk(ll x){
	for(int i=1; i<=N; i++){
		for(int j=1; j<=N; j++)	dist[i][j] = INFLL;
	}
	for(Edge e : edge){
		dist[e.x][e.y] = min(dist[e.x][e.y], x * e.c);
	}
	for(int k=1; k<=N; k++){
		for(int i=1; i<=N; i++){
			for(int j=1; j<=N; j++){
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}
	TEST{
		cout<<x<<endl;
		for(int i=1; i<=N; i++){
			for(int j=1; j<=N; j++){
				cout<<i<<" "<<j<<" "<<dist[i][j]<<endl;
			}
		}cout<<endl;
	}
	for(int i=1; i<=N; i++){
		for(int j=1; j<=N; j++){
			ll r = dist[i][j];
			for(int k=1; k<=K; k++){
				if(B[i][k]!=-1 && S[j][k]!=-1){
					r = min(r, dist[i][j] + B[i][k] - S[j][k]);
				}
			}
			dist[i][j] = r;
		}
	}
	TEST{
		for(int i=1; i<=N; i++){
			for(int j=1; j<=N; j++){
				cout<<i<<" "<<j<<" "<<dist[i][j]<<endl;
			}
		}cout<<endl;
	}
	for(int k=1; k<=N; k++){
		for(int i=1; i<=N; i++){
			for(int j=1; j<=N; j++){
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}
	for(int i=1; i<=N; i++){
		if(dist[i][i]<=0)	return true;
	}
	return false;
}

int main(){
	scanf("%d%d%d", &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<=M; i++){
		int a, b; ll t;
		scanf("%d%d%lld", &a, &b, &t);
		edge.pb({a, b, t});
	}
	ll s = 0, e = 1000000000LL, m;
	while(s<e){
		m = (s+e)/2+1;
		if(chk(m)){
			s = m;
		}else{
			e = m-1;
		}
	}
	cout<<s;
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:92:7: 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:95:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%lld", &B[i][j], &S[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%lld", &a, &b, &t);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 3184 KB Output is correct
2 Correct 75 ms 1272 KB Output is correct
3 Correct 75 ms 1248 KB Output is correct
4 Correct 12 ms 760 KB Output is correct
5 Correct 13 ms 764 KB Output is correct
6 Correct 13 ms 760 KB Output is correct
7 Correct 17 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 12 ms 760 KB Output is correct
10 Correct 13 ms 760 KB Output is correct
11 Correct 13 ms 760 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 17 ms 760 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 1544 KB Output is correct
2 Correct 436 ms 3788 KB Output is correct
3 Correct 95 ms 1404 KB Output is correct
4 Correct 118 ms 1624 KB Output is correct
5 Correct 118 ms 1624 KB Output is correct
6 Correct 92 ms 1416 KB Output is correct
7 Correct 18 ms 760 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 18 ms 888 KB Output is correct
10 Correct 19 ms 888 KB Output is correct
11 Correct 19 ms 888 KB Output is correct
12 Correct 14 ms 888 KB Output is correct
13 Correct 13 ms 760 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 760 KB Output is correct
2 Correct 13 ms 812 KB Output is correct
3 Correct 17 ms 760 KB Output is correct
4 Correct 16 ms 760 KB Output is correct
5 Correct 19 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 13 ms 820 KB Output is correct
8 Correct 18 ms 760 KB Output is correct
9 Correct 15 ms 760 KB Output is correct
10 Correct 16 ms 760 KB Output is correct
11 Correct 19 ms 888 KB Output is correct
12 Correct 18 ms 888 KB Output is correct
13 Correct 13 ms 888 KB Output is correct
14 Correct 15 ms 760 KB Output is correct
15 Correct 20 ms 1016 KB Output is correct
16 Correct 13 ms 760 KB Output is correct
17 Correct 117 ms 1544 KB Output is correct
18 Correct 436 ms 3788 KB Output is correct
19 Correct 95 ms 1404 KB Output is correct
20 Correct 118 ms 1624 KB Output is correct
21 Correct 118 ms 1624 KB Output is correct
22 Correct 92 ms 1416 KB Output is correct
23 Correct 18 ms 760 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 18 ms 888 KB Output is correct
26 Correct 19 ms 888 KB Output is correct
27 Correct 19 ms 888 KB Output is correct
28 Correct 14 ms 888 KB Output is correct
29 Correct 13 ms 760 KB Output is correct
30 Correct 84 ms 1272 KB Output is correct
31 Correct 118 ms 1448 KB Output is correct
32 Correct 361 ms 2504 KB Output is correct
33 Correct 111 ms 1464 KB Output is correct
34 Correct 113 ms 1512 KB Output is correct
35 Correct 109 ms 1512 KB Output is correct
36 Correct 479 ms 3956 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 79 ms 1304 KB Output is correct
40 Correct 83 ms 1656 KB Output is correct
41 Correct 95 ms 1348 KB Output is correct
42 Correct 86 ms 1272 KB Output is correct
43 Correct 78 ms 1300 KB Output is correct
44 Correct 0 ms 376 KB Output is correct
45 Correct 24 ms 1008 KB Output is correct
46 Correct 24 ms 976 KB Output is correct
47 Correct 24 ms 972 KB Output is correct
48 Correct 473 ms 4344 KB Output is correct
49 Correct 479 ms 4344 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 370 ms 3184 KB Output is correct
52 Correct 75 ms 1272 KB Output is correct
53 Correct 75 ms 1248 KB Output is correct
54 Correct 12 ms 760 KB Output is correct
55 Correct 13 ms 764 KB Output is correct
56 Correct 13 ms 760 KB Output is correct
57 Correct 17 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 12 ms 760 KB Output is correct
60 Correct 13 ms 760 KB Output is correct
61 Correct 13 ms 760 KB Output is correct
62 Correct 2 ms 380 KB Output is correct
63 Correct 17 ms 760 KB Output is correct