/*************************************
* author: marvinthang *
* created: 25.12.2023 20:42:18 *
*************************************/
#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 A, class B> bool minimize(A &a, B b) { return a > b ? a = b, true : false; }
template <class A, class B> bool maximize(A &a, B b) { return a < b ? a = b, true : false; }
// end of template
const long long INF = 1e18;
const int MAX = 6001;
int ma[MAX + MAX][MAX][2];
long long dp[MAX + MAX][MAX];
void process(void) {
int n, q; cin >> n >> q;
vector <int> t(n), a(n), b(n), c(n);
REP(i, n) {
cin >> t[i] >> a[i] >> b[i] >> c[i];
t[i] *= 2;
a[i] *= 2;
b[i] *= 2;
c[i] /= 2;
if (a[i] < b[i]) {
REP(l, b[i] - a[i]) maximize(ma[t[i] + l][a[i] + l][1], c[i]);
} else {
REP(l, a[i] - b[i]) maximize(ma[t[i] + l][a[i] - l][0], c[i]);
}
}
REPD(t, MAX + MAX - 1) {
REP(x, MAX) {
dp[t][x] = dp[t + 1][x];
if (x + 1 < MAX) maximize(dp[t][x], dp[t + 1][x + 1] + ma[t][x][1]);
if (x) maximize(dp[t][x], dp[t + 1][x - 1] + ma[t][x][0]);
}
}
while (q--) {
int p, x; cin >> p >> x;
cout << dp[p * 2][x * 2] << '\n';
}
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("JOI21_bodyguard");
// int t; cin >> t; while (t--)
process();
// cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
Compilation message
bodyguard.cpp: In function 'int main()':
bodyguard.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); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bodyguard.cpp:83:2: note: in expansion of macro 'file'
83 | file("JOI21_bodyguard");
| ^~~~
bodyguard.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); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bodyguard.cpp:83:2: note: in expansion of macro 'file'
83 | file("JOI21_bodyguard");
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1519 ms |
1120608 KB |
Output is correct |
| 2 |
Correct |
1381 ms |
1116112 KB |
Output is correct |
| 3 |
Correct |
1087 ms |
714324 KB |
Output is correct |
| 4 |
Correct |
1014 ms |
657796 KB |
Output is correct |
| 5 |
Correct |
1197 ms |
827300 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
21 ms |
600 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
21 ms |
600 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
21 ms |
600 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1519 ms |
1120608 KB |
Output is correct |
| 2 |
Correct |
1381 ms |
1116112 KB |
Output is correct |
| 3 |
Correct |
1087 ms |
714324 KB |
Output is correct |
| 4 |
Correct |
1014 ms |
657796 KB |
Output is correct |
| 5 |
Correct |
1197 ms |
827300 KB |
Output is correct |
| 6 |
Runtime error |
21 ms |
600 KB |
Execution killed with signal 11 |
| 7 |
Halted |
0 ms |
0 KB |
- |
