oj.uz

답안 #135324

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135324 2019-07-24T03:03:35 Z emaborevkovic 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 155 ms 5240 KB 
#include <iostream>
#include <vector>
#include <cstring>

using namespace std;

#define pb push_back
#define mp make_pair
#define TRACE(x) cerr << #x << " " << x << endl
typedef long long ll;

ll n,m,k;
pair <ll, ll> c[105][10005];
vector <pair <int, ll> > ceste[105];
ll floyd[105][105];
vector <pair <ll, pair<ll, ll> > > ls[105];
ll pink[105][105];

bool func (ll x) {
	for (int i=0;i<n;i++) {
		for (int j=0;j<n;j++) {
			pink[i][j] = 1e13;
		}
	}
	for (int i=0;i<n;i++) {
		for (int j=0;j<ls[i].size();j++) {
			pink[i][ls[i][j].first] = ls[i][j].second.second;
			ll oduzmi = ls[i][j].second.first*x;
			pink[i][ls[i][j].first] -= oduzmi;
			pink[i][ls[i][j].first] *= -1;
		}
		pink[i][i] = 1;
	}
	for (int l=0;l<n;l++) {
		for (int i=0;i<n;i++) {
			for (int j=0;j<n;j++) {
				if (pink[i][j] > pink[i][l] + pink[l][j]) {
					pink[i][j] = pink[i][l] + pink[l][j];
				}
			}
		}
	}
	for (int i=0;i<n;i++) {
		if (pink[i][i] <= 0) return 1;
	}
	return 0;
}

int main() {
	cin >> n >> m >> k;
	for (int i=0;i<n;i++) {
		for (int j=0;j<k;j++) {
			scanf("%lld%lld", &c[i][j].first, &c[i][j].second);
		}
	}
	for (int i=0;i<m;i++) {
		ll a1,a2,a3;
		scanf("%lld%lld%lld", &a1, &a2, &a3);
		a1--;
		a2--;
		ceste[a1].pb(mp(a2, a3));
	}
	for (int i=0;i<n;i++) {
		for (int j=0;j<n;j++) floyd[i][j] = 1e9+5;
	}
	for (int i=0;i<n;i++) {
		for (int j=0;j<ceste[i].size();j++) {
			floyd[i][ceste[i][j].first] = ceste[i][j].second;
		}
		floyd[i][i] = 0;
	}
	for (int l=0;l<n;l++) {
		for (int i=0;i<n;i++) {
			for (int j=0;j<n;j++) {
				if (floyd[i][j] > floyd[i][l] + floyd[l][j]) {
					floyd[i][j] = floyd[i][l] + floyd[l][j];
				}
			}
		}
	}
	for (int i=0;i<n;i++) {
		for (int j=0;j<n;j++) {
			if (i == j) continue;
			if (floyd[i][j] == 1e9+5) continue;
			ll zarada = 0;
			for (int l=0;l<k;l++) {
				if (c[j][l].second == -1) continue;
				if (c[i][l].first == -1) continue;
				zarada = max(zarada, c[j][l].second - c[i][l].first);
			}
			ls[i].pb(mp(j, mp(floyd[i][j], zarada)));
		}
	}
	ll lo, hi, mid;
	lo = 0;
	hi = 1e9;
	while (lo < hi) {
		ll suma = lo+hi;
		mid = suma/2;
		if (suma % 2 == 1) mid++;
		if (func(mid)) lo = mid;
		else hi = mid-1;
	}
	cout << lo;
	return 0;
}

Compilation message

merchant.cpp: In function 'bool func(ll)':
merchant.cpp:26:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j=0;j<ls[i].size();j++) {
                ~^~~~~~~~~~~~~
merchant.cpp: In function 'int main()':
merchant.cpp:67:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j=0;j<ceste[i].size();j++) {
                ~^~~~~~~~~~~~~~~~
merchant.cpp:53:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%lld", &c[i][j].first, &c[i][j].second);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &a1, &a2, &a3);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 2988 KB Output is correct
2 Correct 38 ms 1272 KB Output is correct
3 Correct 38 ms 1272 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 8 ms 760 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 9 ms 760 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 8 ms 760 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 8 ms 796 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 760 KB Output is correct
2 Correct 9 ms 760 KB Output is correct
3 Correct 8 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 15 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 7 ms 632 KB Output is correct
8 Correct 8 ms 760 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 11 ms 760 KB Output is correct
12 Correct 10 ms 760 KB Output is correct
13 Correct 8 ms 760 KB Output is correct
14 Correct 10 ms 760 KB Output is correct
15 Correct 11 ms 760 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 17 ms 760 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 17 ms 764 KB Output is correct
20 Correct 12 ms 760 KB Output is correct
21 Correct 11 ms 760 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 9 ms 760 KB Output is correct
24 Correct 8 ms 760 KB Output is correct
25 Correct 9 ms 760 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 760 KB Output is correct
28 Correct 8 ms 760 KB Output is correct
29 Correct 8 ms 760 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 8 ms 796 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 1400 KB Output is correct
2 Correct 155 ms 2688 KB Output is correct
3 Correct 85 ms 1348 KB Output is correct
4 Correct 115 ms 1400 KB Output is correct
5 Correct 107 ms 1644 KB Output is correct
6 Correct 53 ms 1400 KB Output is correct
7 Correct 17 ms 760 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 17 ms 764 KB Output is correct
10 Correct 12 ms 760 KB Output is correct
11 Correct 11 ms 760 KB Output is correct
12 Correct 8 ms 760 KB Output is correct
13 Correct 9 ms 760 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 760 KB Output is correct
2 Correct 9 ms 760 KB Output is correct
3 Correct 8 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 15 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 7 ms 632 KB Output is correct
8 Correct 8 ms 760 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 11 ms 760 KB Output is correct
12 Correct 10 ms 760 KB Output is correct
13 Correct 8 ms 760 KB Output is correct
14 Correct 10 ms 760 KB Output is correct
15 Correct 11 ms 760 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 105 ms 1400 KB Output is correct
18 Correct 155 ms 2688 KB Output is correct
19 Correct 85 ms 1348 KB Output is correct
20 Correct 115 ms 1400 KB Output is correct
21 Correct 107 ms 1644 KB Output is correct
22 Correct 53 ms 1400 KB Output is correct
23 Correct 17 ms 760 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 17 ms 764 KB Output is correct
26 Correct 12 ms 760 KB Output is correct
27 Correct 11 ms 760 KB Output is correct
28 Correct 8 ms 760 KB Output is correct
29 Correct 9 ms 760 KB Output is correct
30 Correct 44 ms 1272 KB Output is correct
31 Correct 45 ms 1528 KB Output is correct
32 Correct 61 ms 3080 KB Output is correct
33 Correct 41 ms 1400 KB Output is correct
34 Correct 42 ms 1572 KB Output is correct
35 Correct 41 ms 1532 KB Output is correct
36 Correct 119 ms 4700 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 40 ms 1400 KB Output is correct
40 Correct 41 ms 1656 KB Output is correct
41 Correct 39 ms 1296 KB Output is correct
42 Correct 39 ms 1272 KB Output is correct
43 Correct 39 ms 1272 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 11 ms 1016 KB Output is correct
46 Correct 11 ms 892 KB Output is correct
47 Correct 10 ms 988 KB Output is correct
48 Correct 101 ms 5116 KB Output is correct
49 Correct 103 ms 5240 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 98 ms 2988 KB Output is correct
52 Correct 38 ms 1272 KB Output is correct
53 Correct 38 ms 1272 KB Output is correct
54 Correct 8 ms 760 KB Output is correct
55 Correct 8 ms 760 KB Output is correct
56 Correct 8 ms 760 KB Output is correct
57 Correct 9 ms 760 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 8 ms 760 KB Output is correct
60 Correct 8 ms 760 KB Output is correct
61 Correct 8 ms 760 KB Output is correct
62 Correct 2 ms 380 KB Output is correct
63 Correct 8 ms 796 KB Output is correct