Submission #598038

# Submission time Handle Problem Language Result Execution time Memory
598038 2022-07-17T12:20:08 Z Summers Divide and conquer (IZhO14_divide) C++14
100 / 100
33 ms 6360 KB
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
long long a[200000], b[200000], c[200000], d[200000];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

   long long i,j,n,le,ri,mid,ans=0;

   cin>>n;

   for(i=1;i<=n;i++)
   {
       cin>>a[i]>>b[i]>>c[i];
       b[i]+=b[i-1];
       c[i]+=c[i-1];
       d[i]=min(d[i-1], c[i-1]-a[i]);

   }
   for(i=1;i<=n;i++)
   {
       le=1; ri=i;
       while(le<=ri)
       {
           mid=(le+ri)/2;

           if(d[mid]<=c[i]-a[i])ri=mid-1;
           else le=mid+1;
       }
       ans=max(ans, b[i]-b[le-1]);
   }
   cout<<ans<<endl;


}

Compilation message

divide.cpp: In function 'int main()':
divide.cpp:11:16: warning: unused variable 'j' [-Wunused-variable]
   11 |    long long i,j,n,le,ri,mid,ans=0;
      |                ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 392 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 392 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 748 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 14 ms 2900 KB Output is correct
29 Correct 15 ms 3148 KB Output is correct
30 Correct 32 ms 6360 KB Output is correct
31 Correct 29 ms 5172 KB Output is correct
32 Correct 33 ms 5232 KB Output is correct
33 Correct 26 ms 5072 KB Output is correct
34 Correct 25 ms 5068 KB Output is correct
35 Correct 28 ms 5580 KB Output is correct
36 Correct 30 ms 5708 KB Output is correct