oj.uz

Submission #232210

# Submission time Handle Problem Language Result Execution time Memory
232210 2020-05-16T11:29:18 Z BamiTorabi Travelling Merchant (APIO17_merchant) C++14
100 / 100
 120 ms 4344 KB 
//Sasayego! Sasayego! Shinzou wo Sasageyo!

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include <bitset>
#include <ctime>
#define debug(x)  cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;

const int maxN = 1e2 + 5;
const int maxK = 1e3 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;

ll S[maxN][maxK], B[maxN][maxK];
ll G[maxN][maxN], C[maxN][maxN];
int n, k, D[maxN][maxN];

bool isVal(ll X){
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			G[i][j] = X * D[i][j] - C[i][j];
	for (int x = 1; x <= n; x++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (i != j)
					G[i][j] = min(G[i][j], G[i][x] + G[x][j]);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j < i; j++)
			if (G[i][j] + G[j][i] <= 0)
				return true;
	return false;
}

int main(){
	time_t START = clock();
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	memset(D, 63, sizeof D);
	int m; scanf("%d%d%d", &n, &m, &k);
	for (int i = 1; i <= n; i++)
		for (int j = 0; 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++)
			for (int x = 0; x < k; x++)
				if (S[j][x] != -1 && B[i][x] != -1)
					C[i][j] = max(C[i][j], S[j][x] - B[i][x]);
	for (int i = 1; i <= n; i++)
		D[i][i] = 0;
	while (m--){
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		D[u][v] = min(D[u][v], w);
	}
	for (int x = 1; x <= n; x++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				D[i][j] = min(D[i][x] + D[x][j], D[i][j]);
	int lt = 0, rt = MOD;
	while (rt - lt > 1){
		int md = (lt + rt) >> 1;
		(isVal(md) ? lt : rt) = md;
	}
	printf("%d\n", lt);
	time_t FINISH = clock();
	cerr << "Execution time: " << (ld)(FINISH - START) / CLOCKS_PER_SEC * 1000.0 << " milliseconds.\n";
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int m; scanf("%d%d%d", &n, &m, &k);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:57: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:67:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 3320 KB Output is correct
2 Correct 43 ms 1280 KB Output is correct
3 Correct 45 ms 1280 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1664 KB Output is correct
2 Correct 108 ms 3832 KB Output is correct
3 Correct 46 ms 1536 KB Output is correct
4 Correct 53 ms 1664 KB Output is correct
5 Correct 51 ms 1664 KB Output is correct
6 Correct 47 ms 1536 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 12 ms 1024 KB Output is correct
10 Correct 12 ms 1024 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 12 ms 1024 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 11 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 12 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 11 ms 896 KB Output is correct
15 Correct 12 ms 1024 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 53 ms 1664 KB Output is correct
18 Correct 108 ms 3832 KB Output is correct
19 Correct 46 ms 1536 KB Output is correct
20 Correct 53 ms 1664 KB Output is correct
21 Correct 51 ms 1664 KB Output is correct
22 Correct 47 ms 1536 KB Output is correct
23 Correct 12 ms 1024 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 12 ms 1024 KB Output is correct
27 Correct 12 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 45 ms 1408 KB Output is correct
31 Correct 48 ms 1536 KB Output is correct
32 Correct 70 ms 2680 KB Output is correct
33 Correct 50 ms 1536 KB Output is correct
34 Correct 50 ms 1536 KB Output is correct
35 Correct 48 ms 1536 KB Output is correct
36 Correct 120 ms 4088 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 45 ms 1400 KB Output is correct
40 Correct 46 ms 1536 KB Output is correct
41 Correct 46 ms 1408 KB Output is correct
42 Correct 49 ms 1408 KB Output is correct
43 Correct 44 ms 1280 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 14 ms 1024 KB Output is correct
46 Correct 13 ms 1024 KB Output is correct
47 Correct 13 ms 1024 KB Output is correct
48 Correct 120 ms 4344 KB Output is correct
49 Correct 118 ms 4252 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 79 ms 3320 KB Output is correct
52 Correct 43 ms 1280 KB Output is correct
53 Correct 45 ms 1280 KB Output is correct
54 Correct 10 ms 896 KB Output is correct
55 Correct 10 ms 896 KB Output is correct
56 Correct 10 ms 896 KB Output is correct
57 Correct 11 ms 896 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 11 ms 896 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 11 ms 896 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 11 ms 896 KB Output is correct