Submission #632580

#TimeUsernameProblemLanguageResultExecution timeMemory
632580ghostwriterArt Exhibition (JOI18_art)C++14
100 / 100
276 ms26096 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug.h> #endif #define st first #define nd second #define pb push_back #define pf push_front #define _pb pop_back #define _pf pop_front #define lb lower_bound #define ub upper_bound #define mtp make_tuple #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair<int, int> pi; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; typedef string str; template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); } template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i)) #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i)) #define EACH(i, x) for (auto &(i) : (x)) #define WHILE while #define file "TEST" mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); } /* Tran The Bao CTL - Da Lat Practising for VOI23 gold medal */ const ll oo = 1e18; const int N = 5e5 + 1; int n; pll a[N]; ll v[N], d[N], f[N], rs = -oo; void upd(int ps, ll v) { for (int i = ps; i <= n; i += (i & -i)) f[i] = max(f[i], v); } ll get(int ps) { ll rs = -oo; for (int i = ps; i >= 1; i -= (i & -i)) rs = max(rs, f[i]); return rs; } signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); // freopen(file".inp", "r", stdin); // freopen(file".out", "w", stdout); cin >> n; FOR(i, 1, n) { cin >> a[i].st >> a[i].nd; v[i] = a[i].st; } sort(a + 1, a + 1 + n); sort(v + 1, v + 1 + n); FOR(i, 1, n) d[i] = d[i - 1] + a[i].nd; FOR(i, 1, n) f[i] = -oo; FOR(i, 1, n) { rs = max(rs, a[i].nd); int pos = lb(v + 1, v + 1 + n, a[i].st) - v; ll tmp = get(pos); rs = max(rs, d[i] - a[i].st + tmp); upd(pos, -d[i - 1] + a[i].st); } cout << rs; return 0; }

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
art.cpp:48:5: note: in expansion of macro 'FOR'
   48 |     FOR(i, 1, n) {
      |     ^~~
art.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
art.cpp:54:5: note: in expansion of macro 'FOR'
   54 |     FOR(i, 1, n) d[i] = d[i - 1] + a[i].nd;
      |     ^~~
art.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
art.cpp:55:5: note: in expansion of macro 'FOR'
   55 |     FOR(i, 1, n) f[i] = -oo;
      |     ^~~
art.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
art.cpp:56:5: note: in expansion of macro 'FOR'
   56 |     FOR(i, 1, n) {
      |     ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...