oj.uz

Submission #709249

# Submission time Handle Problem Language Result Execution time Memory
709249 2023-03-13T09:38:40 Z epicci23 Snowball (JOI21_ho_t2) C++17
100 / 100
 131 ms 13900 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(),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

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

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 340 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 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 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 424 KB Output is correct
17 Correct 1 ms 412 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 340 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 340 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 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 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 424 KB Output is correct
17 Correct 1 ms 412 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 5464 KB Output is correct
21 Correct 26 ms 5352 KB Output is correct
22 Correct 26 ms 5084 KB Output is correct
23 Correct 24 ms 4992 KB Output is correct
24 Correct 31 ms 5476 KB Output is correct
25 Correct 111 ms 11920 KB Output is correct
26 Correct 98 ms 11788 KB Output is correct
27 Correct 93 ms 11404 KB Output is correct
28 Correct 131 ms 11520 KB Output is correct
29 Correct 93 ms 11084 KB Output is correct
30 Correct 92 ms 10508 KB Output is correct
31 Correct 69 ms 9880 KB Output is correct
32 Correct 64 ms 9996 KB Output is correct
33 Correct 10 ms 1492 KB Output is correct
34 Correct 91 ms 12220 KB Output is correct
35 Correct 99 ms 11520 KB Output is correct
36 Correct 129 ms 11852 KB Output is correct
37 Correct 92 ms 11564 KB Output is correct
38 Correct 98 ms 11352 KB Output is correct
39 Correct 105 ms 11588 KB Output is correct
40 Correct 68 ms 11552 KB Output is correct
41 Correct 29 ms 6092 KB Output is correct
42 Correct 57 ms 10128 KB Output is correct
43 Correct 82 ms 13328 KB Output is correct
44 Correct 32 ms 5980 KB Output is correct
45 Correct 64 ms 11536 KB Output is correct
46 Correct 95 ms 13452 KB Output is correct
47 Correct 88 ms 13716 KB Output is correct
48 Correct 90 ms 13900 KB Output is correct