oj.uz

Submission #876725

# Submission time Handle Problem Language Result Execution time Memory
876725 2023-11-22T09:06:10 Z marvinthang Travelling Merchant (APIO17_merchant) C++17
100 / 100
 148 ms 3616 KB 
/*************************************
*    author: marvinthang             *
*    created: 22.11.2023 15:37:37    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// copied from https://codeforces.com/blog/entry/76149
template<int D, typename T> struct Vec: public vector <Vec <D - 1, T>> {
    static_assert(D >= 1, "Vector dimension must be greater than zero!");
    template <typename... Args>
    Vec(int n = 0, Args... args): vector <Vec <D - 1, T>>(n, Vec <D - 1, T>(args...)) {}
};
template<typename T> struct Vec <1, T>: public vector <T> {
    Vec(int n = 0, const T& val = T()): vector <T>(n, val) {}
};
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const long long INF = 1e18;

void process(void) {
	int n, m, k; cin >> n >> m >> k;
	Vec <2, int> B(n, k), S(n, k), max_add(n, n);
	REP(i, n) REP(j, k) cin >> B[i][j] >> S[i][j];
	REP(i, n) REP(j, n) REP(t, k) if (S[j][t] >= 0 && B[i][t] >= 0) 
		maximize(max_add[i][j], S[j][t] - B[i][t]);

	Vec <2, long long> dist(n, n, INF), tdist(n, n);
	while (m--) {
		int u, v, w; cin >> u >> v >> w;
		dist[u - 1][v - 1] = w;
	}
	REP(k, n) REP(i, n) REP(j, n) minimize(dist[i][j], dist[i][k] + dist[k][j]);
	long long l = 1, r = INF;
	auto check = [&] (long long val) {
		long long v = INF / val;
		REP(i, n) REP(j, n) tdist[i][j] = max_add[i][j] - (v < dist[i][j] ? INF : dist[i][j] * val);
		REP(k, n) REP(i, n) REP(j, n) maximize(tdist[i][j], tdist[i][k] + tdist[k][j]);
		REP(i, n) if (tdist[i][i] >= 0) return true;
		return false;
	};
	while (l <= r) {
		long long m = (l + r) >> 1;
		if (check(m)) l = m + 1;
		else r = m - 1;
	}
	cout << r << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("merchant");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:89:2: note: in expansion of macro 'file'
   89 |  file("merchant");
      |  ^~~~
merchant.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:89:2: note: in expansion of macro 'file'
   89 |  file("merchant");
      |  ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1368 KB Output is correct
2 Correct 44 ms 600 KB Output is correct
3 Correct 46 ms 600 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 7 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 7 ms 572 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 572 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 7 ms 460 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 7 ms 464 KB Output is correct
13 Correct 15 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 9 ms 348 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 7 ms 348 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 9 ms 588 KB Output is correct
20 Correct 9 ms 348 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 9 ms 604 KB Output is correct
24 Correct 7 ms 520 KB Output is correct
25 Correct 19 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 19 ms 596 KB Output is correct
28 Correct 11 ms 588 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 7 ms 348 KB Output is correct
31 Correct 11 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 19 ms 596 KB Output is correct
4 Correct 11 ms 588 KB Output is correct
5 Correct 10 ms 344 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 126 ms 732 KB Output is correct
9 Correct 148 ms 3116 KB Output is correct
10 Correct 88 ms 604 KB Output is correct
11 Correct 105 ms 944 KB Output is correct
12 Correct 129 ms 956 KB Output is correct
13 Correct 62 ms 600 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 7 ms 460 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 7 ms 464 KB Output is correct
5 Correct 15 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 9 ms 348 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 9 ms 588 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 7 ms 468 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 9 ms 604 KB Output is correct
16 Correct 7 ms 520 KB Output is correct
17 Correct 126 ms 732 KB Output is correct
18 Correct 148 ms 3116 KB Output is correct
19 Correct 88 ms 604 KB Output is correct
20 Correct 105 ms 944 KB Output is correct
21 Correct 129 ms 956 KB Output is correct
22 Correct 62 ms 600 KB Output is correct
23 Correct 19 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 19 ms 596 KB Output is correct
26 Correct 11 ms 588 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
29 Correct 11 ms 348 KB Output is correct
30 Correct 61 ms 1368 KB Output is correct
31 Correct 44 ms 600 KB Output is correct
32 Correct 46 ms 600 KB Output is correct
33 Correct 7 ms 348 KB Output is correct
34 Correct 7 ms 348 KB Output is correct
35 Correct 7 ms 348 KB Output is correct
36 Correct 7 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 348 KB Output is correct
39 Correct 7 ms 348 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 7 ms 572 KB Output is correct
43 Correct 47 ms 604 KB Output is correct
44 Correct 51 ms 772 KB Output is correct
45 Correct 62 ms 1624 KB Output is correct
46 Correct 47 ms 804 KB Output is correct
47 Correct 54 ms 604 KB Output is correct
48 Correct 47 ms 600 KB Output is correct
49 Correct 98 ms 3376 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 452 KB Output is correct
52 Correct 47 ms 604 KB Output is correct
53 Correct 49 ms 856 KB Output is correct
54 Correct 47 ms 716 KB Output is correct
55 Correct 45 ms 692 KB Output is correct
56 Correct 52 ms 692 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 9 ms 656 KB Output is correct
59 Correct 9 ms 600 KB Output is correct
60 Correct 9 ms 604 KB Output is correct
61 Correct 80 ms 3508 KB Output is correct
62 Correct 83 ms 3616 KB Output is correct
63 Correct 0 ms 344 KB Output is correct