oj.uz

Submission #801429

# Submission time Handle Problem Language Result Execution time Memory
801429 2023-08-02T06:01:44 Z arush_agu Examination (JOI19_examination) C++17
100 / 100
 282 ms 60880 KB 
#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;

struct SegTree {
  ll n;
  vl t;

  void init(ll n_) {
    n = n_;
    t = vl(2 * n + 10);
  }

  ll query(ll l, ll r) {
    ll res = 0;
    for (l += n, r += n; l < r; l /= 2, r /= 2) {
      if (l & 1)
        res += t[l++];
      if (r & 1)
        res += t[--r];
    }
    return res;
  }

  void upd(ll p, ll d) {
    for (t[p += n] += d; p > 1; p /= 2)
      t[p / 2] = t[p] + t[p ^ 1];
  }
} st1, st2;

struct Ev {
  ll x, y, z, idx, t;
  Ev(ll x, ll y, ll z, ll idx, ll t) : x(x), y(y), z(z), idx(idx), t(t) {}
  bool operator<(const Ev &other) const {
    return ii{z, -t} < ii{other.z, -other.t};
  }
};

void solve() {
  ll n, q;
  cin >> n >> q;
  vl s(n), t(n);
  for (ll i = 0; i < n; i++)
    cin >> s[i] >> t[i];
  vector<pair<ii, ii>> qs(q);
  for (ll i = 0; i < q; i++)
    cin >> qs[i].first.first >> qs[i].first.second >> qs[i].second.first,
        qs[i].second.second = i;

  vector<Ev> evs;
  for (ll i = 0; i < n; i++)
    evs.push_back(Ev(s[i], t[i], s[i] + t[i], -1, -1));
  for (auto &[a, b] : qs)
    evs.push_back(
        Ev(a.first, a.second, max(b.first, a.first + a.second), b.second, 1));

  vl comp;
  for (auto &e : evs)
    comp.push_back(e.x), comp.push_back(e.y), comp.push_back(e.z);
  sort(all(comp));
  comp.erase(unique(all(comp)), comp.end());

  auto get = [&](ll x) { return lower_bound(all(comp), x) - comp.begin(); };
  for (auto &e : evs)
    e.x = get(e.x), e.y = get(e.y), e.z = get(e.z);

  sort(all(evs));

  const ll MAXS = 1e6 + 10;
  st1.init(MAXS), st2.init(MAXS);

  vl ans(q, -1);

  ll in = 0;
  for (ll qid = evs.size() - 1; qid >= 0; qid--) {
    Ev &e = evs[qid];
    if (e.t == 1) {
      ans[e.idx] = max(0LL, st1.query(e.x, MAXS) + st2.query(e.y, MAXS) - in);
    } else {
      in++;
      st1.upd(e.x, 1), st2.upd(e.y, 1);
    }
  }

  for (ll i = 0; i < q; i++)
    cout << ans[i] << "\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

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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 11 ms 31576 KB Output is correct
3 Correct 11 ms 31572 KB Output is correct
4 Correct 12 ms 31608 KB Output is correct
5 Correct 12 ms 31572 KB Output is correct
6 Correct 11 ms 31644 KB Output is correct
7 Correct 18 ms 32396 KB Output is correct
8 Correct 17 ms 32404 KB Output is correct
9 Correct 18 ms 32280 KB Output is correct
10 Correct 16 ms 32368 KB Output is correct
11 Correct 16 ms 32280 KB Output is correct
12 Correct 14 ms 32220 KB Output is correct
13 Correct 17 ms 32316 KB Output is correct
14 Correct 18 ms 32364 KB Output is correct
15 Correct 16 ms 32260 KB Output is correct
16 Correct 15 ms 32288 KB Output is correct
17 Correct 15 ms 32276 KB Output is correct
18 Correct 13 ms 32264 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 56000 KB Output is correct
2 Correct 209 ms 56012 KB Output is correct
3 Correct 221 ms 56016 KB Output is correct
4 Correct 166 ms 56064 KB Output is correct
5 Correct 161 ms 56040 KB Output is correct
6 Correct 97 ms 56080 KB Output is correct
7 Correct 202 ms 56028 KB Output is correct
8 Correct 210 ms 56064 KB Output is correct
9 Correct 185 ms 56000 KB Output is correct
10 Correct 161 ms 55812 KB Output is correct
11 Correct 157 ms 55812 KB Output is correct
12 Correct 75 ms 55636 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 56000 KB Output is correct
2 Correct 209 ms 56012 KB Output is correct
3 Correct 221 ms 56016 KB Output is correct
4 Correct 166 ms 56064 KB Output is correct
5 Correct 161 ms 56040 KB Output is correct
6 Correct 97 ms 56080 KB Output is correct
7 Correct 202 ms 56028 KB Output is correct
8 Correct 210 ms 56064 KB Output is correct
9 Correct 185 ms 56000 KB Output is correct
10 Correct 161 ms 55812 KB Output is correct
11 Correct 157 ms 55812 KB Output is correct
12 Correct 75 ms 55636 KB Output is correct
13 Correct 216 ms 56040 KB Output is correct
14 Correct 220 ms 56024 KB Output is correct
15 Correct 216 ms 56068 KB Output is correct
16 Correct 175 ms 56072 KB Output is correct
17 Correct 166 ms 56008 KB Output is correct
18 Correct 92 ms 56024 KB Output is correct
19 Correct 240 ms 56020 KB Output is correct
20 Correct 227 ms 56068 KB Output is correct
21 Correct 218 ms 55972 KB Output is correct
22 Correct 168 ms 55812 KB Output is correct
23 Correct 165 ms 55940 KB Output is correct
24 Correct 73 ms 55684 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 11 ms 31576 KB Output is correct
3 Correct 11 ms 31572 KB Output is correct
4 Correct 12 ms 31608 KB Output is correct
5 Correct 12 ms 31572 KB Output is correct
6 Correct 11 ms 31644 KB Output is correct
7 Correct 18 ms 32396 KB Output is correct
8 Correct 17 ms 32404 KB Output is correct
9 Correct 18 ms 32280 KB Output is correct
10 Correct 16 ms 32368 KB Output is correct
11 Correct 16 ms 32280 KB Output is correct
12 Correct 14 ms 32220 KB Output is correct
13 Correct 17 ms 32316 KB Output is correct
14 Correct 18 ms 32364 KB Output is correct
15 Correct 16 ms 32260 KB Output is correct
16 Correct 15 ms 32288 KB Output is correct
17 Correct 15 ms 32276 KB Output is correct
18 Correct 13 ms 32264 KB Output is correct
19 Correct 219 ms 56000 KB Output is correct
20 Correct 209 ms 56012 KB Output is correct
21 Correct 221 ms 56016 KB Output is correct
22 Correct 166 ms 56064 KB Output is correct
23 Correct 161 ms 56040 KB Output is correct
24 Correct 97 ms 56080 KB Output is correct
25 Correct 202 ms 56028 KB Output is correct
26 Correct 210 ms 56064 KB Output is correct
27 Correct 185 ms 56000 KB Output is correct
28 Correct 161 ms 55812 KB Output is correct
29 Correct 157 ms 55812 KB Output is correct
30 Correct 75 ms 55636 KB Output is correct
31 Correct 216 ms 56040 KB Output is correct
32 Correct 220 ms 56024 KB Output is correct
33 Correct 216 ms 56068 KB Output is correct
34 Correct 175 ms 56072 KB Output is correct
35 Correct 166 ms 56008 KB Output is correct
36 Correct 92 ms 56024 KB Output is correct
37 Correct 240 ms 56020 KB Output is correct
38 Correct 227 ms 56068 KB Output is correct
39 Correct 218 ms 55972 KB Output is correct
40 Correct 168 ms 55812 KB Output is correct
41 Correct 165 ms 55940 KB Output is correct
42 Correct 73 ms 55684 KB Output is correct
43 Correct 270 ms 60880 KB Output is correct
44 Correct 282 ms 60832 KB Output is correct
45 Correct 272 ms 60816 KB Output is correct
46 Correct 195 ms 59344 KB Output is correct
47 Correct 199 ms 59384 KB Output is correct
48 Correct 105 ms 56900 KB Output is correct
49 Correct 258 ms 60824 KB Output is correct
50 Correct 271 ms 60864 KB Output is correct
51 Correct 258 ms 60740 KB Output is correct
52 Correct 197 ms 59196 KB Output is correct
53 Correct 177 ms 58340 KB Output is correct