Submission #709249

#	Time	Username	Problem	Language	Result	Execution time	Memory
709249		epicci23	Snowball (JOI21_ho_t2)	C++17	100 / 100	131 ms	13900 KiB

Main

#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(),q=in();

  int arr[n+1];
  int cnt[n+1];
  memset(cnt,0,sizeof(cnt));
  pii go[q+2];
  go[0]={0,0};
  for(int i=1;i<=n;i++) arr[i]=in();


  pii cur={0,0};
  int suan=0;

  for(int i=1;i<=q;i++)
  {
    int x;x=in();
    suan+=x;
    if(suan>=0) cur.ss=max(cur.ss,suan);
    else cur.ff=max(cur.ff,suan*-1);
    go[i]=cur;
  }
  go[q+1]=cur;
  cnt[1]+=cur.ff;
  cnt[n]+=cur.ss;

  for(int i=1;i<n;i++)
  {
    int l=0,r=q;
    while(l<r)
    {
      int mi=(l+r+1)/2;
      if(arr[i]+go[mi].ss<arr[i+1]-go[mi].ff) l=mi;
      else r=mi-1;
    }
    //cout << "l: " << l << endl;
    if(go[l+1].ff>go[l].ff)
    {
      int art=min(arr[i+1]-arr[i]-go[l+1].ss,go[l+1].ff);
      cnt[i+1]+=art;
      cnt[i]+=go[l+1].ss;
    }
    else
    {
      int art=min(arr[i+1]-arr[i]-go[l+1].ff,go[l+1].ss);
      cnt[i]+=art;
      cnt[i+1]+=go[l+1].ff;
    }

    /*if(i==4 || i==5)
    {
      cout <<"5: "<< cnt[5] << endl;
    }*/
  }

  for(int i=1;i<=n;i++) cout << cnt[i] << endl;
}

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 (stderr)

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

• Subtask 1: 33 / 33
• Subtask 2: 67 / 67