Submission #986849

#	Time	Username	Problem	Language	Result	Execution time	Memory
986849		arush_agu	Snowball (JOI21_ho_t2)	C++17	100 / 100	77 ms	16880 KiB

Main

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  ll n, m; cin >> n >> m;
  vl a(n); for (ll &x : a) cin >> x;
  vl q(m); for (ll &x : q) cin >> x;

  ll mn = 0, mx = 0, curr = 0;
  vll pp(m);
  vl p(m);
  for (ll i=0; i<m; i++) {
    curr += q[i];
    mn = min(mn, curr), mx = max(mx, curr);
    pp[i] = {mn, mx};
    p[i] = mx - mn;
  }

  vl ans(n);
  ans[0] += -mn, ans.back() += mx;
  for (ll i=0; i<n - 1; i++) {
    ll ln = a[i + 1] - a[i];
    if (ln >= p.back()) {
      ans[i] += mx;
      ans[i + 1] += -mn;
      continue;
    }

    auto idx = lower_bound(all(p), ln) - p.begin();
    if (idx == 0) {
      ans[q[0] > 0 ? i : (i + 1)] += ln;
      continue;
    }
    idx--;
    ans[i] += pp[idx].second;
    ans[i + 1] += -pp[idx].first;
    ans[q[idx + 1] > 0 ? i : (i + 1)] += ln - p[idx];
  }
  for (auto &x : ans) cout << x << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:137:11: warning: unused variable 'start' [-Wunused-variable]
  137 |   clock_t start = clock();
      |           ^~~~~

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