oj.uz

Submission #719114

# Submission time Handle Problem Language Result Execution time Memory
719114 2023-04-05T11:19:47 Z fdnfksd Divide and conquer (IZhO14_divide) C++14
100 / 100
 45 ms 8048 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll ans=-inf;
ll n,x[maxN],g[maxN],d[maxN],pre[maxN],pre2[maxN],mn[maxN];
void solve()
{
    cin >> n;
    for(int i=1;i<=n;i++) cin >> x[i] >> g[i] >> d[i],pre[i]=pre[i-1]+d[i],pre2[i]=pre2[i-1]+g[i];
    for(int i=1;i<=n;i++)
    {
        ll sum=g[i],re=d[i];
        ans=max(ans,sum);
    }
    mn[n+1]=-inf;
    for(int i=n;i>=1;i--)
    {
        mn[i]=max(mn[i+1],pre[i]-x[i]);
    }
    for(int i=1;i<n;i++)
    {
        ll low=i+1,high=n;
        while(low<=high)
        {
            ll mid=low+high>>1;
            if(mn[mid]>=pre[i-1]-x[i]) low=mid+1;
            else high=mid-1;
        }
        ans=max(ans,pre2[high]-pre2[i-1]);
    }
    cout << ans;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

divide.cpp: In function 'void solve()':
divide.cpp:21:21: warning: unused variable 're' [-Wunused-variable]
   21 |         ll sum=g[i],re=d[i];
      |                     ^~
divide.cpp:34:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |             ll mid=low+high>>1;
      |                    ~~~^~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 14 ms 2688 KB Output is correct
29 Correct 17 ms 3880 KB Output is correct
30 Correct 45 ms 8048 KB Output is correct
31 Correct 28 ms 6692 KB Output is correct
32 Correct 29 ms 6860 KB Output is correct
33 Correct 37 ms 6644 KB Output is correct
34 Correct 28 ms 6680 KB Output is correct
35 Correct 28 ms 7092 KB Output is correct
36 Correct 30 ms 7244 KB Output is correct