Submission #334246

# Submission time Handle Problem Language Result Execution time Memory
334246 2020-12-08T18:08:20 Z limabeans Divide and conquer (IZhO14_divide) C++17
100 / 100
104 ms 11140 KB
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;


int n;
ll x[maxn], g[maxn], d[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
    cin>>n;
    for (int i=1; i<=n; i++) {
	cin>>x[i]>>g[i]>>d[i];
	g[i]+=g[i-1];
	d[i]+=d[i-1];
    }




    map<ll,ll> mp; // mono-decreasing

    auto insert = [&](ll k, ll v) {
	auto iter = mp.lower_bound(k);

	// inserting v is useless
	if (iter != mp.end() && iter->second >= v) {
	    return;
	}

	mp[k] = v;
	iter = mp.lower_bound(k);
	
	if (iter == mp.begin()) return;
	--iter;
	
	while (true) {
	    if (iter->second > v) break;
	    auto it2 = iter;
	    bool done = false;
	    if (it2==mp.begin()) {
		done=true;
	    } else {
		--it2;
	    }
	    mp.erase(iter);
	    if (done) break;
	    iter = it2;
	}
    };

    auto check = [&]() {
	ll last = 1e18;
	for (auto p: mp) {
	    if (p.second > last) return false;
	    last = p.second;
	}
	return true;
    };

    ll ans = 0;

    for (int i=1; i<=n; i++) {
	insert(x[i]-d[i-1], -g[i-1]);
	auto iter = mp.lower_bound(x[i]-d[i]);
	if (iter != mp.end()) {
	    ans = max(ans, g[i]+iter->second);
	}
	//assert(check());
    }

    cout<<ans<<endl;
    return 0;
}

Compilation message

divide.cpp: In function 'int main()':
divide.cpp:64:10: warning: variable 'check' set but not used [-Wunused-but-set-variable]
   64 |     auto check = [&]() {
      |          ^~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 3 ms 748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 3 ms 748 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 5 ms 620 KB Output is correct
27 Correct 4 ms 620 KB Output is correct
28 Correct 22 ms 1516 KB Output is correct
29 Correct 18 ms 2796 KB Output is correct
30 Correct 41 ms 5592 KB Output is correct
31 Correct 30 ms 4460 KB Output is correct
32 Correct 31 ms 4588 KB Output is correct
33 Correct 30 ms 4332 KB Output is correct
34 Correct 74 ms 7532 KB Output is correct
35 Correct 104 ms 11140 KB Output is correct
36 Correct 86 ms 11072 KB Output is correct