Submission #876715

#	Time	Username	Problem	Language	Result	Execution time	Memory
876715		marvinthang	Travelling Merchant (APIO17_merchant)	C++17	0 / 100	64 ms	1372 KiB

merchant

/*************************************
*    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);
	Vec <2, long long> dist(n, n, INF), tdist(n, n);
	REP(i, n) REP(j, k) cin >> B[i][k] >> S[i][k];
	REP(i, n) REP(j, n) REP(t, k) if (S[j][k] >= 0 && B[i][k] >= 0) 
		maximize(max_add[i][j], S[j][k] - B[i][k]);
	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 (stderr)

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:88:2: note: in expansion of macro 'file'
   88 |  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:88:2: note: in expansion of macro 'file'
   88 |  file("merchant");
      |  ^~~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 34