oj.uz

Submission #332438

# Submission time Handle Problem Language Result Execution time Memory
332438 2020-12-02T15:28:16 Z nvmdava Divide and conquer (IZhO14_divide) C++17
100 / 100
 43 ms 10344 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 100'005;
const ll MOD = 1'000'000'007;
const int INF = 0x3f3f3f3f;

ll x[N], g[N], d[N];
ll p1[N], p2[N];
ll w1[N], w2[N];

vector<pair<ll, ll>> v; 
ll ans = 0;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;

    for(int i = 1; i <= n; ++i){
        cin>>x[i]>>g[i]>>d[i];
        p2[i] = p1[i + 1] = p1[i] + d[i];
        w2[i] = w1[i + 1] = w1[i] + g[i];
    }
    for(int i = 1; i <= n; ++i){
        p2[i] -= x[i];
        p1[i] -= x[i];
    }

    for(int i = n; i >= 1; --i){
        if(v.empty() || v.back().ff < p2[i])
            v.push_back({p2[i], w2[i]});

        ans = max(ans, lower_bound(v.begin(), v.end(), p1[i], [](const pair<ll, ll>& lhs, const int& rhs){
            return lhs.ff < rhs;
        }) -> ss - w1[i]);
    }

    cout<<ans;
}

Subtask #1
17.0 / 17.0

# 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 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct

Subtask #2
31.0 / 31.0

# 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 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 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 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 2 ms 1004 KB Output is correct
24 Correct 2 ms 1004 KB Output is correct

Subtask #3
52.0 / 52.0

# 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 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 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 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 2 ms 1004 KB Output is correct
24 Correct 2 ms 1004 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 3 ms 1004 KB Output is correct
27 Correct 4 ms 1132 KB Output is correct
28 Correct 17 ms 4224 KB Output is correct
29 Correct 20 ms 4460 KB Output is correct
30 Correct 38 ms 8780 KB Output is correct
31 Correct 31 ms 7532 KB Output is correct
32 Correct 32 ms 7660 KB Output is correct
33 Correct 31 ms 7404 KB Output is correct
34 Correct 43 ms 8556 KB Output is correct
35 Correct 37 ms 10088 KB Output is correct
36 Correct 38 ms 10344 KB Output is correct