oj.uz

Submission #92530

# Submission time Handle Problem Language Result Execution time Memory
92530 2019-01-03T10:37:25 Z 3zp Divide and conquer (IZhO14_divide) C++14
100 / 100
 140 ms 14760 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn = 300009;
int n;
long long e[maxn], E[maxn];
long long g[maxn], G[maxn];
long long x[maxn], X[maxn];
long long a[maxn], b[maxn], f[maxn];
void upd(long long x, long long d){
    while(x <= 2*n+1){
        f[x] = min(f[x], d);
        x += (x & -x);
    }
}
long long cnt(long long x){
    long long ans = 1e18;
    while(x){
        ans = min(ans, f[x]);
        x -= (x & -x);
    }
    return ans;
}
main(){
    cin >> n;
    for(long long i = 1; i <= n; i++){
        cin >> x[i] >> g[i] >> e[i];
        X[i] = x[i] ;
        G[i] = g[i] + G[i - 1];
        E[i] = e[i] + E[i - 1];
    }
    //E[r] - E[l] > X[r] - X[l + 1] ---> G[r] - G[l]

    vector<pair<long long,long long> > v;
    for(long long i = 0; i <= n; i++){
        v.push_back({E[i] - X[i], i + n + 1});
        v.push_back({E[i] - X[i + 1], i});
    }
    sort(v.begin(), v.end());
    for(long long i = 0; i < v.size(); i++)
        if(v[i].second <= n) b[v[i].second] = i + 1;
        else a[v[i].second - n - 1] = i + 1;
    for(long long i = 1; i <= 3*n+1; i++)
        f[i] = 1e18;
    long long ans = 0;
    for(long long i = 0; i <= n; i++){
        
        long long T = cnt(a[i] - 1);
        ans = max(ans, G[i] - T);
        upd(b[i], G[i]);
    }
    cout << ans << endl;
}

Compilation message

divide.cpp:23:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
divide.cpp: In function 'int main()':
divide.cpp:39:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i = 0; i < v.size(); i++)
                          ~~^~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 4 ms 760 KB Output is correct
11 Correct 8 ms 1268 KB Output is correct
12 Correct 9 ms 1268 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1140 KB Output is correct
2 Correct 10 ms 1776 KB Output is correct
3 Correct 12 ms 1644 KB Output is correct
4 Correct 58 ms 6372 KB Output is correct
5 Correct 68 ms 6452 KB Output is correct
6 Correct 140 ms 12252 KB Output is correct
7 Correct 110 ms 12252 KB Output is correct
8 Correct 108 ms 12252 KB Output is correct
9 Correct 103 ms 12252 KB Output is correct
10 Correct 108 ms 12232 KB Output is correct
11 Correct 135 ms 14556 KB Output is correct
12 Correct 124 ms 14760 KB Output is correct