Submission #892938

#TimeUsernameProblemLanguageResultExecution timeMemory
892938marvinthangAnts and Sugar (JOI22_sugar)C++17
26 / 100
699 ms69516 KiB
/************************************* * author: marvinthang * * created: 26.12.2023 10:02:55 * *************************************/ #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 struct Node { long long ma[2][2], lazy, common; Node() { REP(i, 2) REP(j, 2) ma[i][j] = 0; lazy = common = 0; } void add(long long x) { REP(i, 2) REP(j, 2) ma[i][j] -= x; lazy += x; common += x; } void merge(const Node &a, const Node &b) { REP(i, 2) REP(j, 2) ma[i][j] = max(a.ma[i][0] + b.ma[0][j], a.ma[i][1] + b.ma[1][j] + common); REP(i, 2) { maximize(ma[i][0], a.ma[i][0]); maximize(ma[0][i], b.ma[0][i]); } } }; void process(void) { int q, l; cin >> q >> l; vector <tuple <int, int, int>> queries; vector <int> pos; REP(i, q) { int t, x, a; cin >> t >> x >> a; if (t == 1) pos.push_back(x); queries.emplace_back(t, x, a); } sort(ALL(pos)); pos.erase(unique(ALL(pos)), pos.end()); vector <Node> st(pos.size() * 4); auto pushDown = [&] (int i) { if (!st[i].lazy) return; st[i << 1].add(st[i].lazy); st[i << 1 | 1].add(st[i].lazy); st[i].lazy = 0; }; function<void(int, int, int, int, int)> updateAnt = [&] (int i, int l, int r, int p, int v) { if (r - l == 1) { REP(x, 2) REP(y, 2) st[i].ma[x][y] += v; return; } pushDown(i); int m = l + r >> 1; if (p < m) updateAnt(i << 1, l, m, p, v); else updateAnt(i << 1 | 1, m, r, p, v); st[i].merge(st[i << 1], st[i << 1 | 1]); }; function<void(int, int, int, int, int, int)> updateSugar = [&] (int i, int l, int r, int u, int v, int w) { if (u <= l && r <= v) { st[i].add(w); return; } pushDown(i); int m = l + r >> 1; if (v <= m) updateSugar(i << 1, l, m, u, v, w); else if (u >= m) updateSugar(i << 1 | 1, m, r, u, v, w); else { st[i].common += w; updateSugar(i << 1, l, m, u, v, w); updateSugar(i << 1 | 1, m, r, u, v, w); } st[i].merge(st[i << 1], st[i << 1 | 1]); }; long long sum = 0; for (auto [t, x, a]: queries) { if (t == 1) { x = lower_bound(ALL(pos), x) - pos.begin(); updateAnt(1, 0, (int) pos.size(), x, a); sum += a; } else { int tl = lower_bound(ALL(pos), x - l) - pos.begin(); int tr = upper_bound(ALL(pos), x + l) - pos.begin(); if (tl < tr) updateSugar(1, 0, (int) pos.size(), tl, tr, a); } cout << sum - max(0LL, st[1].ma[0][0]) << '\n'; } } int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr); file("JOI22_sugar"); // int t; cin >> t; while (t--) process(); // cerr << "Time elapsed: " << TIME << " s.\n"; return (0^0); }

Compilation message (stderr)

sugar.cpp: In lambda function:
sugar.cpp:91:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   91 |   int m = l + r >> 1;
      |           ~~^~~
sugar.cpp: In lambda function:
sugar.cpp:102:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |   int m = l + r >> 1;
      |           ~~^~~
sugar.cpp: In function 'int main()':
sugar.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sugar.cpp:130:2: note: in expansion of macro 'file'
  130 |  file("JOI22_sugar");
      |  ^~~~
sugar.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sugar.cpp:130:2: note: in expansion of macro 'file'
  130 |  file("JOI22_sugar");
      |  ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...