oj.uz

Submission #343510

# Submission time Handle Problem Language Result Execution time Memory
343510 2021-01-04T04:49:49 Z Habib_Assoev Divide and conquer (IZhO14_divide) C++14
17 / 100
 1 ms 512 KB 
# include<bits/stdc++.h>
#define in freopen ("measurement.in", "r", stdin);
#define out freopen("measurement.out", "w", stdout);
#define ll long long
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std ;
long long const N = 1e6 + 7;
long long N1 = 1e9 + 7;
int main( ){
    //in out
    speed ;
    ll TJK = 1 ;
    // cin >> TJK ;
    while( TJK -- ){
        ll n;
        cin >> n;
        ll a[n] , g[n] , d[n];
        for( int i = 0 ; i < n ; i ++ ){
            cin >> a[i] >> g[i] >> d[i];
        }
        ll g1[n] , d1[n];
        g1[0] = g[0] , d1[0] = d[0];
        for( int i = 1 ; i < n ; i ++ ){
            g1[i] = g1[i-1] + g[i];
            d1[i] = d1[i-1] + d[i];
        }
        ll l = 0 , r = 0 , go = 0 , di = 0 , en = 0 , mx = 0;
        for( int i = 0 ; i < n ; i ++ ){
            di = a[r] - a[l];
            en = ( d1[r] - d1[l] ) + d[l];
            go = ( g1[r] - g1[l] ) + g[l];
            //cout << l << ' ' << r << ' ' << di << ' ' << en << ' ' << go << endl;
            if( di <= en ){
                r ++;
                mx = max( mx , go );
            }else{
                while( di > en ){
                    l ++;
                    di = a[r] - a[l];
                    en = ( d1[r] - d1[l] ) + d[l];
                    go = ( g1[r] - g1[l] ) + g[l];
                    //cout << l << ' ' << r << ' ' << di << ' ' << en << ' ' << go << endl;
                }
                mx = max( mx , go );
                r ++;
            }
        }
        cout << mx << endl;
    }
}

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 492 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 512 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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #2
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 492 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 512 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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
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 492 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 512 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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Halted 0 ms 0 KB -