oj.uz

Submission #986849

# Submission time Handle Problem Language Result Execution time Memory
986849 2024-05-21T11:16:24 Z arush_agu Snowball (JOI21_ho_t2) C++17
100 / 100
 77 ms 16880 KB 
#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

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

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 608 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 608 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 23 ms 8700 KB Output is correct
21 Correct 20 ms 8540 KB Output is correct
22 Correct 18 ms 8384 KB Output is correct
23 Correct 18 ms 8172 KB Output is correct
24 Correct 23 ms 8664 KB Output is correct
25 Correct 73 ms 14940 KB Output is correct
26 Correct 77 ms 15056 KB Output is correct
27 Correct 73 ms 14652 KB Output is correct
28 Correct 71 ms 14676 KB Output is correct
29 Correct 70 ms 14416 KB Output is correct
30 Correct 75 ms 13644 KB Output is correct
31 Correct 47 ms 13152 KB Output is correct
32 Correct 40 ms 13392 KB Output is correct
33 Correct 7 ms 1884 KB Output is correct
34 Correct 75 ms 15708 KB Output is correct
35 Correct 72 ms 14928 KB Output is correct
36 Correct 71 ms 14928 KB Output is correct
37 Correct 76 ms 14708 KB Output is correct
38 Correct 73 ms 14676 KB Output is correct
39 Correct 69 ms 14724 KB Output is correct
40 Correct 52 ms 14932 KB Output is correct
41 Correct 21 ms 9308 KB Output is correct
42 Correct 40 ms 13172 KB Output is correct
43 Correct 58 ms 16604 KB Output is correct
44 Correct 21 ms 9304 KB Output is correct
45 Correct 45 ms 14852 KB Output is correct
46 Correct 54 ms 16720 KB Output is correct
47 Correct 57 ms 16856 KB Output is correct
48 Correct 61 ms 16880 KB Output is correct