oj.uz

답안 #444383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444383 2021-07-13T21:32:22 Z arwaeystoamneg 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 494 ms 3532 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 111;
int n, m, k, A[MAX][10 * MAX], B[MAX][10 * MAX];
int dist[MAX][MAX];
ll best[MAX][MAX], dp[MAX][MAX];
bool check(int x)
{
	F0R(i, n)
	{
		F0R(j, n)
		{
			ll ans = -(ll)x * dist[i][j];
			F0R(l, k)
			{
				if (A[i][l] == -1 || B[j][l] == -1)continue;
				ans = max(ans, B[j][l] - A[i][l] - (ll)x * dist[i][j]);
			}
			best[i][j] = ans;
		}
	}
	F0R(i, n)fill(dp[i], dp[i] + n, linf);
	F0R(i, n)F0R(j, n)dp[i][j] = -best[i][j];
	F0R(k, n)
	{
		F0R(i, n)
		{
			F0R(j, n)
			{
				if (dp[i][j] > dp[i][k] + dp[k][j])
					dp[i][j] = dp[i][k] + dp[k][j];
			}
		}
	}
	F0R(i, n)if (dp[i][i] <= 0)return 1;
	return 0;
}
int main()
{
	setIO("test1");
	cin >> n >> m >> k;
	F0R(i, n)
	{
		F0R(j, k)cin >> A[i][j] >> B[i][j];
		fill(dist[i], dist[i] + n, inf);
	}
	F0R(i, m)
	{
		int x, y, z;
		cin >> x >> y >> z;
		x--, y--;
		dist[x][y] = min(dist[x][y], z);
	}
	F0R(k, n)
	{
		F0R(i, n)
		{
			F0R(j, n)
			{
				if (dist[i][j] > dist[i][k] + dist[k][j])
				{
					dist[i][j] = dist[i][k] + dist[k][j];
				}
			}
		}
	}
	int l = 0, r = inf;
	while (l < r)
	{
		int m = (l + r + 1) / 2;
		if (check(m))l = m;
		else r = m - 1;
	}
	cout << l << endl;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 2576 KB Output is correct
2 Correct 35 ms 1344 KB Output is correct
3 Correct 37 ms 1348 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 6 ms 832 KB Output is correct
7 Correct 11 ms 900 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 9 ms 844 KB Output is correct
10 Correct 8 ms 840 KB Output is correct
11 Correct 9 ms 832 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 10 ms 908 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 832 KB Output is correct
2 Correct 11 ms 900 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 844 KB Output is correct
5 Correct 8 ms 840 KB Output is correct
6 Correct 9 ms 832 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 908 KB Output is correct
9 Correct 10 ms 844 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 12 ms 840 KB Output is correct
12 Correct 11 ms 852 KB Output is correct
13 Correct 18 ms 920 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 7 ms 844 KB Output is correct
16 Correct 12 ms 844 KB Output is correct
17 Correct 8 ms 836 KB Output is correct
18 Correct 11 ms 876 KB Output is correct
19 Correct 14 ms 844 KB Output is correct
20 Correct 14 ms 844 KB Output is correct
21 Correct 7 ms 844 KB Output is correct
22 Correct 10 ms 872 KB Output is correct
23 Correct 18 ms 844 KB Output is correct
24 Correct 8 ms 716 KB Output is correct
25 Correct 21 ms 844 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 21 ms 844 KB Output is correct
28 Correct 15 ms 844 KB Output is correct
29 Correct 14 ms 844 KB Output is correct
30 Correct 7 ms 844 KB Output is correct
31 Correct 8 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 844 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 21 ms 844 KB Output is correct
4 Correct 15 ms 844 KB Output is correct
5 Correct 14 ms 844 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 8 ms 844 KB Output is correct
8 Correct 147 ms 1484 KB Output is correct
9 Correct 488 ms 3172 KB Output is correct
10 Correct 106 ms 1484 KB Output is correct
11 Correct 157 ms 1624 KB Output is correct
12 Correct 153 ms 1612 KB Output is correct
13 Correct 75 ms 1356 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 844 KB Output is correct
2 Correct 8 ms 844 KB Output is correct
3 Correct 12 ms 840 KB Output is correct
4 Correct 11 ms 852 KB Output is correct
5 Correct 18 ms 920 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 12 ms 844 KB Output is correct
9 Correct 8 ms 836 KB Output is correct
10 Correct 11 ms 876 KB Output is correct
11 Correct 14 ms 844 KB Output is correct
12 Correct 14 ms 844 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 10 ms 872 KB Output is correct
15 Correct 18 ms 844 KB Output is correct
16 Correct 8 ms 716 KB Output is correct
17 Correct 147 ms 1484 KB Output is correct
18 Correct 488 ms 3172 KB Output is correct
19 Correct 106 ms 1484 KB Output is correct
20 Correct 157 ms 1624 KB Output is correct
21 Correct 153 ms 1612 KB Output is correct
22 Correct 75 ms 1356 KB Output is correct
23 Correct 21 ms 844 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 21 ms 844 KB Output is correct
26 Correct 15 ms 844 KB Output is correct
27 Correct 14 ms 844 KB Output is correct
28 Correct 7 ms 844 KB Output is correct
29 Correct 8 ms 844 KB Output is correct
30 Correct 343 ms 2576 KB Output is correct
31 Correct 35 ms 1344 KB Output is correct
32 Correct 37 ms 1348 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 6 ms 832 KB Output is correct
36 Correct 11 ms 900 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 9 ms 844 KB Output is correct
39 Correct 8 ms 840 KB Output is correct
40 Correct 9 ms 832 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 10 ms 908 KB Output is correct
43 Correct 54 ms 1360 KB Output is correct
44 Correct 89 ms 1484 KB Output is correct
45 Correct 348 ms 1980 KB Output is correct
46 Correct 76 ms 1356 KB Output is correct
47 Correct 89 ms 1484 KB Output is correct
48 Correct 77 ms 1484 KB Output is correct
49 Correct 494 ms 3352 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 43 ms 1356 KB Output is correct
53 Correct 43 ms 1420 KB Output is correct
54 Correct 69 ms 1400 KB Output is correct
55 Correct 49 ms 1356 KB Output is correct
56 Correct 41 ms 1356 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 19 ms 972 KB Output is correct
59 Correct 21 ms 972 KB Output is correct
60 Correct 20 ms 972 KB Output is correct
61 Correct 486 ms 3532 KB Output is correct
62 Correct 459 ms 3396 KB Output is correct
63 Correct 1 ms 332 KB Output is correct