oj.uz

Submission #92529

# Submission time Handle Problem Language Result Execution time Memory
92529 2019-01-03T10:32:34 Z 3zp Divide and conquer (IZhO14_divide) C++14
0 / 100
 140 ms 14428 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];
    }
    //r > l, a[r] > b[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 <= 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
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1144 KB Output is correct
2 Correct 10 ms 1776 KB Output is correct
3 Correct 13 ms 1900 KB Output is correct
4 Correct 58 ms 7140 KB Output is correct
5 Correct 67 ms 7352 KB Output is correct
6 Correct 140 ms 14428 KB Output is correct
7 Correct 106 ms 13328 KB Output is correct
8 Correct 109 ms 13372 KB Output is correct
9 Correct 104 ms 13276 KB Output is correct
10 Incorrect 108 ms 13248 KB Output isn't correct
11 Halted 0 ms 0 KB -