oj.uz

답안 #521273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521273 2022-02-01T12:49:49 Z hohohaha 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 85 ms 4200 KB 
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
#include "bits/stdc++.h"

using namespace std;

#define li long long
#define ld long double
#define ii pair<int, int>
#define vi vector<int> 
#define vvi vector<vi>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define eb emplace_back
#define em emplace
#define ob pop_back
#define om pop
#define of pop_front

#define fori(i, a, b) for(int i = (int) (a); i <= (int) (b); ++i)
#define ford(i, a, b) for(int i = (int) (a); i >= (int) (b); --i)
#define forIT(it, begin, end) for(__typeof(end) it = (begin) + ((begin) > (end)); it != (end) - ((begin) > (end)); it += 1 - 2 * ((begin) > (end)))
#define b_e(x) begin(x), end(x)
#define sz(x) ((int)(x).size())
#define bitc __builtin_popcountll

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rand rng
#define endl '\n'
#define sp ' '

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

void solve();

signed main() {
// freopen("test.inp","r",stdin);
// freopen("test.out","w",stdout);
   fastio;
   int tc = 1;
   fori(test, 1, tc) {
      solve();
   }
   return 0;
}

#define int long long
const ld pi = 4 * atan(1.0), eps = 1e-9;
const int maxn = 105, maxk =1004, inf = 1e15; 
int n, m, tp; 
int s[maxn][maxk], b[maxn][maxk]; 
int dis[maxn][maxn]; 
int pro[maxn][maxn]; 
int step[maxn][maxn]; 
int sum[maxn][maxn]; 
void solve() {
	cin >> n >> m >> tp; 
	fori(i, 1, n) { 
		fori(j, 1, n) { 
			if(i == j) dis[i][j] = 0; 
			else dis[i][j] = inf; 
		}
	}
	fori(i,1,n) { 
	 	fori(k, 1, tp) { 
	 		cin >> b[i][k] >> s[i][k]; 
	 	}
	 }
	fori(i, 1, m) { 
		int u, v, w; cin >> u >> v >> w; 
		dis[u][v] = min(dis[u][v], w); 
	}
	fori(k, 1, n) { 
		fori(i, 1, n) { 
			fori(j, 1, n) { 
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); 
			}
		}
	}
	fori(i, 1, n) { 
		fori(j, 1, n) { 
			fori(k, 1, tp) { 
				if(s[j][k] != -1 and b[i][k] != -1) pro[i][j] = max(pro[i][j], s[j][k] - b[i][k]); 
			}
		}
	}
	int lo = 0; 
	int hi = 1e9; 
	while(lo < hi) { 
		int mi = lo + hi + 1 >> 1; 
		int ratio = mi; 
		fori(i, 1, n) fori(j, 1, n) { 
			sum[i][j] = -inf; 
			if(i - j and dis[i][j] != inf) sum[i][j] = pro[i][j] - dis[i][j] * ratio; 
		}
		fori(k, 1, n) fori(i, 1, n) fori(j, 1, n) { 
			sum[i][j] = max(sum[i][j], sum[i][k] + sum[k][j]); 
		}
		bool ok = 0; fori(i, 1, n) if(sum[i][i] >= 0) ok = 1; 
		if(ok) lo = mi; 
		else hi = mi - 1; 
	}
	cout << lo; 
}

Compilation message

merchant.cpp: In function 'void solve()':
merchant.cpp:100:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |   int mi = lo + hi + 1 >> 1;
      |            ~~~~~~~~^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 1988 KB Output is correct
2 Correct 33 ms 1228 KB Output is correct
3 Correct 34 ms 1228 KB Output is correct
4 Correct 5 ms 708 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 5 ms 844 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 5 ms 716 KB Output is correct
11 Correct 5 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 5 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 900 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 6 ms 844 KB Output is correct
4 Correct 6 ms 888 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 5 ms 844 KB Output is correct
8 Correct 38 ms 1424 KB Output is correct
9 Correct 79 ms 2096 KB Output is correct
10 Correct 35 ms 1356 KB Output is correct
11 Correct 39 ms 1484 KB Output is correct
12 Correct 38 ms 1520 KB Output is correct
13 Correct 35 ms 1356 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 844 KB Output is correct
2 Correct 5 ms 844 KB Output is correct
3 Correct 5 ms 844 KB Output is correct
4 Correct 5 ms 868 KB Output is correct
5 Correct 5 ms 844 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 5 ms 844 KB Output is correct
8 Correct 5 ms 844 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 5 ms 844 KB Output is correct
11 Correct 7 ms 844 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 5 ms 844 KB Output is correct
14 Correct 5 ms 844 KB Output is correct
15 Correct 6 ms 844 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 38 ms 1424 KB Output is correct
18 Correct 79 ms 2096 KB Output is correct
19 Correct 35 ms 1356 KB Output is correct
20 Correct 39 ms 1484 KB Output is correct
21 Correct 38 ms 1520 KB Output is correct
22 Correct 35 ms 1356 KB Output is correct
23 Correct 6 ms 900 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 6 ms 844 KB Output is correct
26 Correct 6 ms 888 KB Output is correct
27 Correct 6 ms 888 KB Output is correct
28 Correct 5 ms 844 KB Output is correct
29 Correct 5 ms 844 KB Output is correct
30 Correct 55 ms 1988 KB Output is correct
31 Correct 33 ms 1228 KB Output is correct
32 Correct 34 ms 1228 KB Output is correct
33 Correct 5 ms 708 KB Output is correct
34 Correct 5 ms 716 KB Output is correct
35 Correct 5 ms 716 KB Output is correct
36 Correct 5 ms 844 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 5 ms 716 KB Output is correct
39 Correct 5 ms 716 KB Output is correct
40 Correct 5 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 5 ms 844 KB Output is correct
43 Correct 35 ms 1400 KB Output is correct
44 Correct 35 ms 1492 KB Output is correct
45 Correct 49 ms 2632 KB Output is correct
46 Correct 35 ms 1484 KB Output is correct
47 Correct 35 ms 1612 KB Output is correct
48 Correct 35 ms 1484 KB Output is correct
49 Correct 84 ms 3984 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 33 ms 1356 KB Output is correct
53 Correct 34 ms 1484 KB Output is correct
54 Correct 34 ms 1356 KB Output is correct
55 Correct 36 ms 1356 KB Output is correct
56 Correct 34 ms 1228 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 7 ms 972 KB Output is correct
60 Correct 8 ms 976 KB Output is correct
61 Correct 84 ms 4200 KB Output is correct
62 Correct 85 ms 4168 KB Output is correct
63 Correct 1 ms 332 KB Output is correct