oj.uz

답안 #265361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
265361 2020-08-14T16:25:02 Z abacaba 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 160 ms 4344 KB 
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
 
// typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define emb emplace_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
template <typename T> inline T range(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
 
template <typename T> void Min(T &a, T b) {
    a = min(a, b);
}
 
template <typename T> void Max(T &a, T b) {
    a = max(a, b);
}
 
#define int long long

const int mod = 1e9 + 7;
const int inf = 2e15;
const int N = 1e2 + 15;
const int K = 1e3 + 15;
int n, m, k, buy[N][K], sell[N][K];
int g[N][N];

int d[N][N], dp[N][N];

bool used[N];

int maxval[N][N];

bool check(int mid) {
	for(int i = 1; i <= n; ++i) {
		fill(d[i] + 1, d[i] + n + 1, inf);
		fill(dp[i] + 1, dp[i] + n + 1, inf);
	}

	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			if(g[i][j])
				d[i][j] = g[i][j] * mid;

	for(int k = 1; k <= n; ++k)
		for(int i = 1; i <= n; ++i)
			for(int j = 1; j <= n; ++j)
				Min(d[i][j], d[i][k] + d[k][j]);
	
	memcpy(dp, d, sizeof(dp));

	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j) {
			Min(dp[i][j], d[i][j] + maxval[i][j]);
			Max(dp[i][j], -inf);
		}
	for(int i = 1; i <= n; ++i)
		dp[i][i] = 0;
//	memcpy(dp, mx, sizeof(dp));
	for(int k = 1; k <= n; ++k)
		for(int i = 1; i <= n; ++i)
			for(int j = 1; j <= n; ++j) {
				Min(dp[i][j], dp[i][k] + dp[k][j]);
				Max(dp[i][j], -inf);
			}
	int ans = inf;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			if(i != j)
				Min(ans, dp[i][j] + dp[j][i]);
	return ans <= 0;
}

main() {
	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
//	freopen("input.txt", "r", stdin);
	cin >> n >> m >> k;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= k; ++j)
			cin >> buy[i][j] >> sell[i][j];
	for(int i = 1; i <= m; ++i) {
		int u, v;
		cin >> u >> v;
		cin >> g[u][v];
	}
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j) {
			maxval[i][j] = inf;
			for(int s = 1; s <= k; ++s)
				if(buy[i][s] != -1 && sell[j][s] != -1) 
					Min(maxval[i][j], buy[i][s] - sell[j][s]);
		}
	int l = 1, r = 1e9, res = 0;
	while(l <= r) {
		int mid = l + r >> 1;
		if(check(mid))
			l = mid + 1, res = mid;
		else
			r = mid - 1;
	}
	cout << res << endl;
	return 0;
}

Compilation message

merchant.cpp:114:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  114 | main() {
      |      ^
merchant.cpp: In function 'int main()':
merchant.cpp:135:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  135 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 2304 KB Output is correct
2 Correct 86 ms 1572 KB Output is correct
3 Correct 85 ms 1536 KB Output is correct
4 Correct 14 ms 1024 KB Output is correct
5 Correct 14 ms 1048 KB Output is correct
6 Correct 13 ms 1024 KB Output is correct
7 Correct 14 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 12 ms 1024 KB Output is correct
10 Correct 16 ms 1024 KB Output is correct
11 Correct 14 ms 1024 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 13 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 1664 KB Output is correct
2 Correct 138 ms 2368 KB Output is correct
3 Correct 88 ms 1536 KB Output is correct
4 Correct 105 ms 1964 KB Output is correct
5 Correct 96 ms 1920 KB Output is correct
6 Correct 87 ms 1664 KB Output is correct
7 Correct 14 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 15 ms 1024 KB Output is correct
10 Correct 14 ms 1024 KB Output is correct
11 Correct 13 ms 1024 KB Output is correct
12 Correct 17 ms 1024 KB Output is correct
13 Correct 12 ms 1024 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1024 KB Output is correct
2 Correct 14 ms 1024 KB Output is correct
3 Correct 13 ms 1024 KB Output is correct
4 Correct 15 ms 1024 KB Output is correct
5 Correct 13 ms 1024 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 13 ms 1024 KB Output is correct
8 Correct 17 ms 1024 KB Output is correct
9 Correct 17 ms 1024 KB Output is correct
10 Correct 17 ms 1024 KB Output is correct
11 Correct 14 ms 1024 KB Output is correct
12 Correct 14 ms 1024 KB Output is correct
13 Correct 21 ms 1024 KB Output is correct
14 Correct 13 ms 1024 KB Output is correct
15 Correct 14 ms 1024 KB Output is correct
16 Correct 13 ms 1024 KB Output is correct
17 Correct 90 ms 1664 KB Output is correct
18 Correct 138 ms 2368 KB Output is correct
19 Correct 88 ms 1536 KB Output is correct
20 Correct 105 ms 1964 KB Output is correct
21 Correct 96 ms 1920 KB Output is correct
22 Correct 87 ms 1664 KB Output is correct
23 Correct 14 ms 1024 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 15 ms 1024 KB Output is correct
26 Correct 14 ms 1024 KB Output is correct
27 Correct 13 ms 1024 KB Output is correct
28 Correct 17 ms 1024 KB Output is correct
29 Correct 12 ms 1024 KB Output is correct
30 Correct 90 ms 1536 KB Output is correct
31 Correct 101 ms 1792 KB Output is correct
32 Correct 107 ms 2860 KB Output is correct
33 Correct 92 ms 1792 KB Output is correct
34 Correct 89 ms 1792 KB Output is correct
35 Correct 89 ms 1828 KB Output is correct
36 Correct 146 ms 4312 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 84 ms 1536 KB Output is correct
40 Correct 97 ms 1784 KB Output is correct
41 Correct 89 ms 1784 KB Output is correct
42 Correct 105 ms 1664 KB Output is correct
43 Correct 111 ms 1536 KB Output is correct
44 Correct 1 ms 512 KB Output is correct
45 Correct 18 ms 1152 KB Output is correct
46 Correct 19 ms 1152 KB Output is correct
47 Correct 17 ms 1152 KB Output is correct
48 Correct 160 ms 4344 KB Output is correct
49 Correct 157 ms 4344 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 121 ms 2304 KB Output is correct
52 Correct 86 ms 1572 KB Output is correct
53 Correct 85 ms 1536 KB Output is correct
54 Correct 14 ms 1024 KB Output is correct
55 Correct 14 ms 1048 KB Output is correct
56 Correct 13 ms 1024 KB Output is correct
57 Correct 14 ms 1024 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 12 ms 1024 KB Output is correct
60 Correct 16 ms 1024 KB Output is correct
61 Correct 14 ms 1024 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 13 ms 1024 KB Output is correct