oj.uz

Submission #57279

# Submission time Handle Problem Language Result Execution time Memory
57279 2018-07-14T13:04:49 Z IvanC Travelling Merchant (APIO17_merchant) C++17
100 / 100
 155 ms 10244 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN = 110;
const int MAXM = 1010;
const ll INF = 1e17;

ll compra[MAXN][MAXM],venda[MAXN][MAXM];
ll matriz[MAXN][MAXN],lucro[MAXN][MAXN];
int chega[MAXN][MAXN],existe[MAXN][MAXN];
ll shortest_path[MAXN][MAXN];
int N,M,K;

int FloydWarshall(ll X){
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<=N;j++){
			shortest_path[i][j] = INF;
			existe[i][j] = 0;
		}
	}
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<=N;j++){
			if(!chega[i][j]) continue;
			shortest_path[i][j] = X*matriz[i][j] - lucro[i][j];
			existe[i][j] = 1;
		}	
	}
	
	for(int k = 1;k<=N;k++){
		for(int i = 1;i<=N;i++){
			for(int j = 1;j<=N;j++){
				if(!existe[i][k] || !existe[k][j]) continue;
				existe[i][j] |= 1;
				shortest_path[i][j] = min(shortest_path[i][j], shortest_path[i][k] + shortest_path[k][j] );
			}
		}
	}
	
	for(int i = 1;i<=N;i++){
		if(shortest_path[i][i] <= 0) return 1;
	}
	
	return 0;
	
}

ll bruta_par(int u,int v){
	ll best = 0;
	for(int i = 1;i<=K;i++){
		if(compra[u][i] != -1 && venda[v][i] != -1) best = max(best, venda[v][i] - compra[u][i] );
	}
	return best;
}

void calcula_lucro(int v){
	for(int i = 1;i<=N;i++){
		lucro[v][i] = bruta_par(v,i);
	}
}

int main(){
	
	scanf("%d %d %d",&N,&M,&K);
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<=N;j++){
			matriz[i][j]  = INF;
		}
	}
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<=K;j++){
			scanf("%lld %lld",&compra[i][j],&venda[i][j]);
		}
	}
	//printf("Custos\n");
	for(int i = 1;i<=N;i++) calcula_lucro(i);
	for(int i = 1;i<=M;i++){
		int u,v;
		ll w;
		scanf("%d %d %lld",&u,&v,&w);
		matriz[u][v] = w;
		chega[u][v] = 1;
	}
	//printf("Leu\n");
	
	for(int k = 1;k<=N;k++){
		for(int i = 1;i<=N;i++){
			for(int j = 1;j<=N;j++){
				if(!chega[i][k] || !chega[k][j]) continue;
				chega[i][j] |= 1;
				matriz[i][j] = min(matriz[i][j],matriz[i][k] + matriz[k][j]);
			}
		}
	}
	
	//printf("Floyd\n");
	//for(int i = 1;i<=N;i++){
	//	printf("%d :",i);
	//	for(int j = 1;j<=N;j++){
	//		printf(" (%lld,%lld)", chega[i][j] ? (matriz[i][j]) : (-1), lucro[i][j] );
	//	}
	//	printf("\n");
	//}
	
	ll resposta = 0,ini = 1,fim = lucro[1][1],meio;
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<=N;j++){
			fim = max(fim,lucro[i][j]);
		}
	}
	while(ini <= fim){
		meio = ini + (fim - ini)/2;
		if(FloydWarshall(meio)){
			resposta = meio;
			ini = meio + 1;
		}
		else{
			fim = meio - 1;
		}
	}
	printf("%lld\n",resposta);
	
	return 0;	
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:65: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:73:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld %lld",&compra[i][j],&venda[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:81:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %lld",&u,&v,&w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 2296 KB Output is correct
2 Correct 73 ms 2296 KB Output is correct
3 Correct 126 ms 2296 KB Output is correct
4 Correct 17 ms 2296 KB Output is correct
5 Correct 12 ms 2296 KB Output is correct
6 Correct 3 ms 2296 KB Output is correct
7 Correct 12 ms 2296 KB Output is correct
8 Correct 2 ms 2296 KB Output is correct
9 Correct 12 ms 2296 KB Output is correct
10 Correct 12 ms 2296 KB Output is correct
11 Correct 14 ms 2296 KB Output is correct
12 Correct 3 ms 2296 KB Output is correct
13 Correct 13 ms 2296 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2296 KB Output is correct
2 Correct 146 ms 2736 KB Output is correct
3 Correct 71 ms 2736 KB Output is correct
4 Correct 124 ms 2736 KB Output is correct
5 Correct 77 ms 2736 KB Output is correct
6 Correct 71 ms 2736 KB Output is correct
7 Correct 13 ms 2296 KB Output is correct
8 Correct 2 ms 2296 KB Output is correct
9 Correct 14 ms 2296 KB Output is correct
10 Correct 13 ms 2296 KB Output is correct
11 Correct 13 ms 2296 KB Output is correct
12 Correct 22 ms 2296 KB Output is correct
13 Correct 9 ms 2296 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2296 KB Output is correct
2 Correct 14 ms 2296 KB Output is correct
3 Correct 9 ms 2296 KB Output is correct
4 Correct 8 ms 2296 KB Output is correct
5 Correct 14 ms 2296 KB Output is correct
6 Correct 3 ms 2296 KB Output is correct
7 Correct 6 ms 2296 KB Output is correct
8 Correct 8 ms 2296 KB Output is correct
9 Correct 11 ms 2296 KB Output is correct
10 Correct 10 ms 2296 KB Output is correct
11 Correct 13 ms 2296 KB Output is correct
12 Correct 10 ms 2296 KB Output is correct
13 Correct 13 ms 2296 KB Output is correct
14 Correct 11 ms 2296 KB Output is correct
15 Correct 14 ms 2296 KB Output is correct
16 Correct 14 ms 2296 KB Output is correct
17 Correct 52 ms 2296 KB Output is correct
18 Correct 146 ms 2736 KB Output is correct
19 Correct 71 ms 2736 KB Output is correct
20 Correct 124 ms 2736 KB Output is correct
21 Correct 77 ms 2736 KB Output is correct
22 Correct 71 ms 2736 KB Output is correct
23 Correct 13 ms 2296 KB Output is correct
24 Correct 2 ms 2296 KB Output is correct
25 Correct 14 ms 2296 KB Output is correct
26 Correct 13 ms 2296 KB Output is correct
27 Correct 13 ms 2296 KB Output is correct
28 Correct 22 ms 2296 KB Output is correct
29 Correct 9 ms 2296 KB Output is correct
30 Correct 74 ms 2736 KB Output is correct
31 Correct 87 ms 2736 KB Output is correct
32 Correct 99 ms 3448 KB Output is correct
33 Correct 126 ms 3448 KB Output is correct
34 Correct 86 ms 3448 KB Output is correct
35 Correct 98 ms 3448 KB Output is correct
36 Correct 153 ms 5688 KB Output is correct
37 Correct 3 ms 5688 KB Output is correct
38 Correct 2 ms 5688 KB Output is correct
39 Correct 74 ms 5688 KB Output is correct
40 Correct 81 ms 5688 KB Output is correct
41 Correct 27 ms 5688 KB Output is correct
42 Correct 70 ms 5688 KB Output is correct
43 Correct 84 ms 5688 KB Output is correct
44 Correct 3 ms 5688 KB Output is correct
45 Correct 13 ms 5688 KB Output is correct
46 Correct 13 ms 5688 KB Output is correct
47 Correct 15 ms 5688 KB Output is correct
48 Correct 155 ms 8268 KB Output is correct
49 Correct 146 ms 10244 KB Output is correct
50 Correct 2 ms 10244 KB Output is correct
51 Correct 120 ms 2296 KB Output is correct
52 Correct 73 ms 2296 KB Output is correct
53 Correct 126 ms 2296 KB Output is correct
54 Correct 17 ms 2296 KB Output is correct
55 Correct 12 ms 2296 KB Output is correct
56 Correct 3 ms 2296 KB Output is correct
57 Correct 12 ms 2296 KB Output is correct
58 Correct 2 ms 2296 KB Output is correct
59 Correct 12 ms 2296 KB Output is correct
60 Correct 12 ms 2296 KB Output is correct
61 Correct 14 ms 2296 KB Output is correct
62 Correct 3 ms 2296 KB Output is correct
63 Correct 13 ms 2296 KB Output is correct