oj.uz

Submission #777814

# Submission time Handle Problem Language Result Execution time Memory
777814 2023-07-09T16:49:57 Z epicci23 Bigger segments (IZhO19_segments) C++17
100 / 100
 89 ms 44256 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in();
  int ar[n+1];
  for(int i=1;i<=n;i++) ar[i]=in();

  int pre[n+1]; pre[0]=0;
  for(int i=1;i<=n;i++) pre[i]=ar[i]+pre[i-1];

  vector<pii> dp[n+2];
  
  int dp2[n+2];
  for(int i=0;i<=n;i++) dp2[i]=INF;

  dp2[0]=0;
  dp[0].pb({0,0});

  auto get=[&](int l,int r)
  {
    if(l>r) return -INF;
    return pre[r]-pre[l-1];
  };

  for(int i=1;i<=n;i++)
  {
    int l=0,r=i-1;
    while(l<r)
    {
      int mid=(l+r+1)/2;
      if(!dp[mid].empty() && dp2[mid]<=pre[i]) l=mid;
      else r=mid-1;
    }
    int x=l;
    r=sz(dp[x])-1;
    l=0;
    
    while(l<r)
    {
      int mid=(l+r+1)/2;
      if(dp[x][mid].ff<=pre[i]) l=mid;
      else r=mid-1;
    }
    
    //cout << "i: " << i << endl;
    //cout << x+1 << " " << dp[x][l].ss+1 << " " << i <<  endl;
    
    while(!dp[x+1].empty() && dp[x+1].back().ff>=get(dp[x][l].ss+1,i)+pre[i]) dp[x+1].pop_back();
    dp[x+1].pb({get(dp[x][l].ss+1,i)+pre[i],i});
    dp2[x+1]=min(dp2[x+1],pre[i]+get(dp[x][l].ss+1,i));
  } 
  

  for(int i=n;i>=0;i--)
  {
    if(!dp[i].empty())
    {
      cout << i << endl;
      return;
    }
  }
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

segments.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 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 320 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 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 320 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 404 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 452 KB Output is correct
42 Correct 1 ms 456 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 496 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 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 320 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 404 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 452 KB Output is correct
42 Correct 1 ms 456 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 496 KB Output is correct
46 Correct 11 ms 7504 KB Output is correct
47 Correct 14 ms 6944 KB Output is correct
48 Correct 15 ms 8044 KB Output is correct
49 Correct 16 ms 8420 KB Output is correct
50 Correct 16 ms 9076 KB Output is correct
51 Correct 19 ms 7604 KB Output is correct
52 Correct 9 ms 4052 KB Output is correct
53 Correct 6 ms 2512 KB Output is correct
54 Correct 14 ms 6904 KB Output is correct
55 Correct 18 ms 8000 KB Output is correct
56 Correct 14 ms 8612 KB Output is correct
57 Correct 14 ms 8124 KB Output is correct
58 Correct 16 ms 7996 KB Output is correct
59 Correct 14 ms 8652 KB Output is correct
60 Correct 17 ms 8036 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 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 320 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 404 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 452 KB Output is correct
42 Correct 1 ms 456 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 496 KB Output is correct
46 Correct 11 ms 7504 KB Output is correct
47 Correct 14 ms 6944 KB Output is correct
48 Correct 15 ms 8044 KB Output is correct
49 Correct 16 ms 8420 KB Output is correct
50 Correct 16 ms 9076 KB Output is correct
51 Correct 19 ms 7604 KB Output is correct
52 Correct 9 ms 4052 KB Output is correct
53 Correct 6 ms 2512 KB Output is correct
54 Correct 14 ms 6904 KB Output is correct
55 Correct 18 ms 8000 KB Output is correct
56 Correct 14 ms 8612 KB Output is correct
57 Correct 14 ms 8124 KB Output is correct
58 Correct 16 ms 7996 KB Output is correct
59 Correct 14 ms 8652 KB Output is correct
60 Correct 17 ms 8036 KB Output is correct
61 Correct 52 ms 34016 KB Output is correct
62 Correct 62 ms 35800 KB Output is correct
63 Correct 71 ms 32748 KB Output is correct
64 Correct 80 ms 42336 KB Output is correct
65 Correct 77 ms 44256 KB Output is correct
66 Correct 87 ms 37096 KB Output is correct
67 Correct 70 ms 29792 KB Output is correct
68 Correct 43 ms 15296 KB Output is correct
69 Correct 69 ms 32816 KB Output is correct
70 Correct 89 ms 38624 KB Output is correct
71 Correct 66 ms 41316 KB Output is correct
72 Correct 69 ms 38652 KB Output is correct
73 Correct 71 ms 41192 KB Output is correct
74 Correct 70 ms 42696 KB Output is correct
75 Correct 77 ms 41932 KB Output is correct