Submission #942015

#	Time	Username	Problem	Language	Result	Execution time	Memory
942015		marvinthang	Fuel Station (NOI20_fuelstation)	C++17	100 / 100	344 ms	35008 KiB

FuelStation

/*************************************
*    author: marvinthang             *
*    created: 10.03.2024 09:09:50    *
*************************************/

#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 << '}'; }
template <class InIter, class OutIter>  void compress(InIter first, InIter last, OutIter result) { vector <__typeof(*first)> v(first, last); sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); while (first != last) { *result = lower_bound(v.begin(), v.end(), *first) - v.begin(); ++first; ++result; } }

// end of template

void process(void) {
	int n, d; cin >> n >> d;
	vector <int> x(n), a(n), b(n);
	REP(i, n) cin >> x[i] >> a[i] >> b[i];
	x.push_back(d);
	vector <int> val(ALL(x)); sort(ALL(val)); val.erase(unique(ALL(val)), val.end());
	for (int &x: x) x = lower_bound(ALL(val), x) - val.begin();
	vector <int> idx(n);
	iota(ALL(idx), 0);
	sort(ALL(idx), [&] (int x, int y) { return b[x] > b[y]; });
	int sz = val.size();
	vector <long long> st(n * 4 + 23), lazy(n * 4 + 23);
	function<void(int, int, int)> build = [&] (int i, int l, int r) {
		if (r - l == 1) {
			st[i] = val[l];
			return;
		}
		int m = l + r >> 1;
		build(i << 1, l, m);
		build(i << 1 | 1, m, r);
		st[i] = max(st[i << 1], st[i << 1 | 1]);
	};
	function<void(int, int, int, int, int, int)> update = [&] (int i, int l, int r, int u, int v, int val) {
		if (l >= v || r <= u) return;
		if (u <= l && r <= v) {
			st[i] += val;
			lazy[i] += val;
			return;
		}
		int m = l + r >> 1;
		update(i << 1, l, m, u, v, val);
		update(i << 1 | 1, m, r, u, v, val);
		st[i] = max(st[i << 1], st[i << 1 | 1]) + lazy[i];
	};
	build(1, 0, sz);
	long long res = d;
	for (int i: idx) {
		update(1, 0, sz, x[i] + 1, sz, -a[i]);
		if (st[1] <= b[i]) res = min(res, st[1]);
	}
	cout << max(0LL, res) << '\n';
}

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

Compilation message (stderr)

FuelStation.cpp: In lambda function:
FuelStation.cpp:64:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |   int m = l + r >> 1;
      |           ~~^~~
FuelStation.cpp: In lambda function:
FuelStation.cpp:76:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |   int m = l + r >> 1;
      |           ~~^~~
FuelStation.cpp: In function 'int main()':
FuelStation.cpp:31:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
FuelStation.cpp:92:2: note: in expansion of macro 'file'
   92 |  file("FUEL");
      |  ^~~~
FuelStation.cpp:31:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
FuelStation.cpp:92:2: note: in expansion of macro 'file'
   92 |  file("FUEL");
      |  ^~~~

• Subtask 1: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 17 / 17
• Subtask 4: 12 / 12
• Subtask 5: 19 / 19
• Subtask 6: 11 / 11
• Subtask 7: 21 / 21