제출 #503734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503734		cig32	Snowball (JOI21_ho_t2)	C++17	100 / 100	101 ms	18408 KiB

Main

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long

int rnd(int x, int y) { // random number generator
  int u= uniform_int_distribution<int>(x, y)(rng); return u;
}

void solve(int tc) {
  int N, Q;
  cin >> N >> Q;
  int X[N+1], L[N+1], R[N+1];
  for(int i=1; i<=N; i++) cin >> X[i];
  int W[Q+1], ps[Q+1], maxp[Q+1], minp[Q+1];
  minp[0] = 0;
  maxp[0] = 0;
  ps[0] = 0;
  for(int i=1; i<=Q; i++) {
    cin >> W[i];
    ps[i] = ps[i-1] + W[i];
    maxp[i] = max(maxp[i-1], ps[i]);
    minp[i] = min(minp[i-1], ps[i]);
  }
  L[1] = X[1] + minp[Q];
  R[N] = X[N] + maxp[Q];
  for(int i=1; i<N; i++) {
    int lb = 1, rb = Q;
    while(lb<rb) {
      int mid = (lb+rb) >> 1;
      if(X[i] + maxp[mid] > X[i+1] + minp[mid]) rb = mid;
      else lb = mid + 1;
    }
    if(X[i] + maxp[lb] > X[i+1] + minp[lb]) {
      if(W[lb] > 0) {
        R[i] = L[i+1] = X[i+1] + minp[lb];
      }
      else {
        R[i] = L[i+1] = X[i] + maxp[lb];
      }
    }
    else {
      R[i] = X[i] + maxp[Q];
      L[i+1] = X[i+1] + minp[Q];
    }
  }
  for(int i=1; i<=N; i++) cout << R[i] - L[i] << "\n";
}

int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

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