oj.uz

Submission #386475

# Submission time Handle Problem Language Result Execution time Memory
386475 2021-04-06T16:05:09 Z VROOM_VARUN Event Hopping 2 (JOI21_event2) C++14
100 / 100
 633 ms 43968 KB 
/*
ID: varunra2
LANG: C++
TASK: hopping2
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int n, k;

VII vals;

struct fenwick {
  int n;
  VI bit;
  void init(int _n) {
    n = _n;
    bit.assign(n + 1, 0);
  }

  void upd(int ind, int val) {
    while (ind <= n) {
      bit[ind] += val;
      ind += (ind & (-ind));
    }
  }

  int qry(int ind) {
    int ret = 0;
    while (ind >= 1) {
      ret += bit[ind];
      ind -= (ind & (-ind));
    }
    return ret;
  }

  int qry(int l, int r) { return qry(r) - qry(l - 1); }
};

MPII compress(VI pnts) {
  sort(all(pnts));
  pnts.erase(unique(all(pnts)), pnts.end());
  int cnt = 0;
  MPII ret;
  for (int i = 0; i < sz(pnts); i++) {
    ret[pnts[i]] = cnt++;
  }
  return ret;
}

MPII ans;
MPII cmp;
VVI lft;
const int bits = 20;

void init() {
  vals.resize(n);
  lft.resize(n);
  trav(x, lft) x.resize(bits);
}

bool ok(int ind, int r) {
  if (ind == -1) return false;
  return vals[ind].y <= r;
}

int calc(int l, int r) {
  // calculate answer for this range
  int start = ans[l];
  if (!ok(start, r)) return 0;
  int ret = 0;
  for (int i = bits - 1; i >= 0; i--) {
    if (ok(lft[start][i], r)) {
      start = lft[start][i];
      ret += (1 << i);
    }
  }
  return ret + 1;
}

int main() {
// #ifndef ONLINE_JUDGE
  // freopen("hopping2.in", "r", stdin);
  // freopen("hopping2.out", "w", stdout);
// #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k;

  init();

  trav(x, vals) cin >> x.x >> x.y;

  VI pnts;

  trav(x, vals) pnts.PB(x.x), pnts.PB(x.y);

  cmp = compress(pnts);

  trav(x, vals) x.x = cmp[x.x], x.y = cmp[x.y];

  PII bst(INF, -1);

  VVI evnts;

  rep(i, 0, n) {
    evnts.PB({vals[i].x, 1, i});
    evnts.PB({vals[i].y, 0, i});
  }

  sort(all(evnts), greater<VI>());

  for (auto& x : evnts) {
    if (x[1] == 1) {
      bst = min(bst, MP(vals[x[2]].y, x[2]));
    } else {
      ans[vals[x[2]].y] = bst.y;
    }
  }

  ans[0] = bst.y;

  for (int i = 0; i < n; i++) {
    lft[i][0] = ans[vals[i].y];
  }

  for (int j = 1; j < bits; j++) {
    for (int i = 0; i < n; i++) {
      int to = lft[i][j - 1];
      if (to == -1)
        lft[i][j] = -1;
      else
        lft[i][j] = lft[to][j - 1];
    }
  }

  VI ret;
  int cnt = 0;

  set<PII> gps;

  gps.insert(MP(0, 2 * n));

  int gpcnt = calc(0, 2 * n);

  for (int i = 0; i < n; i++) {
    // debug(i);
    if (cnt == k) break;
    int l = vals[i].x;
    int r = vals[i].y;
    auto it = gps.upper_bound(MP(l, INF));
    if (it == gps.begin()) continue;
    it--;
    auto x = *it;
    // debug(gps);
    int rl = x.x;
    int rr = x.y;
    if (!(l >= rl and r <= rr)) continue;
    // rl, rr -> (rl, l), (r, rr)
    // calculate contribution of rl, rr (a)
    // calculate contribution of rl, l (b)
    // calculate contribution of r, rr (c)
    // this is a good range, add this mf
    int a = calc(rl, rr);
    int b = calc(rl, l);
    int c = calc(r, rr);
    // debug(a, b, c, cnt, gpcnt);
    // debug(l, r);
    // debug(rl, rr);
    // debug(cnt + gpcnt - a + b + c + 1);
    if (cnt + gpcnt - a + b + c + 1 >= k) {
      ret.PB(i + 1);
      cnt++;
      gpcnt -= a;
      gpcnt += (b + c);
      gps.erase(it);
      PII pl(rl, l);
      PII pr(r, rr);
      if (pl.x != pl.y) {
        gps.insert(pl);
      }
      if (pr.x != pr.y) {
        gps.insert(pr);
      }
    }
  }

  // debug(ret);

  if (sz(ret) != k) {
    cout << "-1\n";
    return 0;
  }

  trav(x, ret) cout << x << '\n';

  return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 308 ms 43968 KB Output is correct
5 Correct 279 ms 43840 KB Output is correct
6 Correct 293 ms 43584 KB Output is correct
7 Correct 276 ms 42944 KB Output is correct
8 Correct 293 ms 43968 KB Output is correct
9 Correct 300 ms 43840 KB Output is correct
10 Correct 271 ms 43456 KB Output is correct
11 Correct 275 ms 42944 KB Output is correct
12 Correct 265 ms 42048 KB Output is correct
13 Correct 277 ms 41900 KB Output is correct
14 Correct 263 ms 41664 KB Output is correct
15 Correct 249 ms 41408 KB Output is correct
16 Correct 220 ms 39488 KB Output is correct
17 Correct 220 ms 39500 KB Output is correct
18 Correct 216 ms 39360 KB Output is correct
19 Correct 214 ms 38848 KB Output is correct
20 Correct 212 ms 38848 KB Output is correct
21 Correct 205 ms 38720 KB Output is correct
22 Correct 232 ms 38848 KB Output is correct
23 Correct 230 ms 38992 KB Output is correct
24 Correct 219 ms 38720 KB Output is correct
25 Correct 233 ms 38720 KB Output is correct
26 Correct 236 ms 38788 KB Output is correct
27 Correct 235 ms 38720 KB Output is correct
28 Correct 258 ms 38856 KB Output is correct
29 Correct 270 ms 38720 KB Output is correct
30 Correct 292 ms 38720 KB Output is correct
31 Correct 275 ms 38848 KB Output is correct
32 Correct 283 ms 38944 KB Output is correct
33 Correct 306 ms 38772 KB Output is correct
34 Correct 231 ms 40768 KB Output is correct
35 Correct 226 ms 40064 KB Output is correct
36 Correct 226 ms 39360 KB Output is correct
37 Correct 253 ms 41664 KB Output is correct
38 Correct 256 ms 41408 KB Output is correct
39 Correct 240 ms 41280 KB Output is correct
40 Correct 268 ms 41328 KB Output is correct
41 Correct 235 ms 41152 KB Output is correct
42 Correct 290 ms 38720 KB Output is correct
43 Correct 286 ms 41408 KB Output is correct
44 Correct 270 ms 41328 KB Output is correct
45 Correct 261 ms 41156 KB Output is correct
46 Correct 287 ms 41164 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 496 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 496 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 7 ms 1556 KB Output is correct
29 Correct 8 ms 1644 KB Output is correct
30 Correct 7 ms 1516 KB Output is correct
31 Correct 7 ms 1516 KB Output is correct
32 Correct 6 ms 1516 KB Output is correct
33 Correct 10 ms 1516 KB Output is correct
34 Correct 8 ms 1516 KB Output is correct
35 Correct 10 ms 1644 KB Output is correct
36 Correct 11 ms 1644 KB Output is correct
37 Correct 9 ms 1644 KB Output is correct
38 Correct 8 ms 1516 KB Output is correct
39 Correct 10 ms 1644 KB Output is correct
40 Correct 9 ms 1644 KB Output is correct
41 Correct 8 ms 1644 KB Output is correct
42 Correct 9 ms 1516 KB Output is correct
43 Correct 8 ms 1516 KB Output is correct
44 Correct 8 ms 1516 KB Output is correct
45 Correct 7 ms 1516 KB Output is correct
46 Correct 8 ms 1516 KB Output is correct
47 Correct 7 ms 1516 KB Output is correct
48 Correct 7 ms 1536 KB Output is correct
49 Correct 7 ms 1516 KB Output is correct
50 Correct 8 ms 1516 KB Output is correct
51 Correct 7 ms 1516 KB Output is correct
52 Correct 7 ms 1516 KB Output is correct
53 Correct 7 ms 1516 KB Output is correct
54 Correct 8 ms 1516 KB Output is correct
55 Correct 7 ms 1388 KB Output is correct
56 Correct 6 ms 1388 KB Output is correct
57 Correct 6 ms 1388 KB Output is correct
58 Correct 6 ms 1388 KB Output is correct
59 Correct 6 ms 1388 KB Output is correct
60 Correct 8 ms 1388 KB Output is correct
61 Correct 6 ms 1388 KB Output is correct
62 Correct 6 ms 1388 KB Output is correct
63 Correct 6 ms 1388 KB Output is correct
64 Correct 6 ms 1388 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 308 ms 43968 KB Output is correct
5 Correct 279 ms 43840 KB Output is correct
6 Correct 293 ms 43584 KB Output is correct
7 Correct 276 ms 42944 KB Output is correct
8 Correct 293 ms 43968 KB Output is correct
9 Correct 300 ms 43840 KB Output is correct
10 Correct 271 ms 43456 KB Output is correct
11 Correct 275 ms 42944 KB Output is correct
12 Correct 265 ms 42048 KB Output is correct
13 Correct 277 ms 41900 KB Output is correct
14 Correct 263 ms 41664 KB Output is correct
15 Correct 249 ms 41408 KB Output is correct
16 Correct 220 ms 39488 KB Output is correct
17 Correct 220 ms 39500 KB Output is correct
18 Correct 216 ms 39360 KB Output is correct
19 Correct 214 ms 38848 KB Output is correct
20 Correct 212 ms 38848 KB Output is correct
21 Correct 205 ms 38720 KB Output is correct
22 Correct 232 ms 38848 KB Output is correct
23 Correct 230 ms 38992 KB Output is correct
24 Correct 219 ms 38720 KB Output is correct
25 Correct 233 ms 38720 KB Output is correct
26 Correct 236 ms 38788 KB Output is correct
27 Correct 235 ms 38720 KB Output is correct
28 Correct 258 ms 38856 KB Output is correct
29 Correct 270 ms 38720 KB Output is correct
30 Correct 292 ms 38720 KB Output is correct
31 Correct 275 ms 38848 KB Output is correct
32 Correct 283 ms 38944 KB Output is correct
33 Correct 306 ms 38772 KB Output is correct
34 Correct 231 ms 40768 KB Output is correct
35 Correct 226 ms 40064 KB Output is correct
36 Correct 226 ms 39360 KB Output is correct
37 Correct 253 ms 41664 KB Output is correct
38 Correct 256 ms 41408 KB Output is correct
39 Correct 240 ms 41280 KB Output is correct
40 Correct 268 ms 41328 KB Output is correct
41 Correct 235 ms 41152 KB Output is correct
42 Correct 290 ms 38720 KB Output is correct
43 Correct 286 ms 41408 KB Output is correct
44 Correct 270 ms 41328 KB Output is correct
45 Correct 261 ms 41156 KB Output is correct
46 Correct 287 ms 41164 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 496 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 7 ms 1556 KB Output is correct
75 Correct 8 ms 1644 KB Output is correct
76 Correct 7 ms 1516 KB Output is correct
77 Correct 7 ms 1516 KB Output is correct
78 Correct 6 ms 1516 KB Output is correct
79 Correct 10 ms 1516 KB Output is correct
80 Correct 8 ms 1516 KB Output is correct
81 Correct 10 ms 1644 KB Output is correct
82 Correct 11 ms 1644 KB Output is correct
83 Correct 9 ms 1644 KB Output is correct
84 Correct 8 ms 1516 KB Output is correct
85 Correct 10 ms 1644 KB Output is correct
86 Correct 9 ms 1644 KB Output is correct
87 Correct 8 ms 1644 KB Output is correct
88 Correct 9 ms 1516 KB Output is correct
89 Correct 8 ms 1516 KB Output is correct
90 Correct 8 ms 1516 KB Output is correct
91 Correct 7 ms 1516 KB Output is correct
92 Correct 8 ms 1516 KB Output is correct
93 Correct 7 ms 1516 KB Output is correct
94 Correct 7 ms 1536 KB Output is correct
95 Correct 7 ms 1516 KB Output is correct
96 Correct 8 ms 1516 KB Output is correct
97 Correct 7 ms 1516 KB Output is correct
98 Correct 7 ms 1516 KB Output is correct
99 Correct 7 ms 1516 KB Output is correct
100 Correct 8 ms 1516 KB Output is correct
101 Correct 7 ms 1388 KB Output is correct
102 Correct 6 ms 1388 KB Output is correct
103 Correct 6 ms 1388 KB Output is correct
104 Correct 6 ms 1388 KB Output is correct
105 Correct 6 ms 1388 KB Output is correct
106 Correct 8 ms 1388 KB Output is correct
107 Correct 6 ms 1388 KB Output is correct
108 Correct 6 ms 1388 KB Output is correct
109 Correct 6 ms 1388 KB Output is correct
110 Correct 6 ms 1388 KB Output is correct
111 Correct 387 ms 38720 KB Output is correct
112 Correct 345 ms 38660 KB Output is correct
113 Correct 349 ms 38720 KB Output is correct
114 Correct 356 ms 38720 KB Output is correct
115 Correct 338 ms 38848 KB Output is correct
116 Correct 491 ms 38720 KB Output is correct
117 Correct 475 ms 38848 KB Output is correct
118 Correct 575 ms 43968 KB Output is correct
119 Correct 633 ms 43440 KB Output is correct
120 Correct 477 ms 41280 KB Output is correct
121 Correct 567 ms 38720 KB Output is correct
122 Correct 511 ms 41920 KB Output is correct
123 Correct 507 ms 41888 KB Output is correct
124 Correct 448 ms 41408 KB Output is correct
125 Correct 569 ms 38720 KB Output is correct
126 Correct 380 ms 39488 KB Output is correct
127 Correct 404 ms 39508 KB Output is correct
128 Correct 372 ms 39232 KB Output is correct
129 Correct 523 ms 38720 KB Output is correct
130 Correct 384 ms 38848 KB Output is correct
131 Correct 344 ms 38720 KB Output is correct
132 Correct 356 ms 38720 KB Output is correct
133 Correct 495 ms 38792 KB Output is correct
134 Correct 355 ms 38848 KB Output is correct
135 Correct 357 ms 38848 KB Output is correct
136 Correct 335 ms 38720 KB Output is correct
137 Correct 482 ms 38732 KB Output is correct
138 Correct 399 ms 38720 KB Output is correct
139 Correct 338 ms 38720 KB Output is correct
140 Correct 333 ms 38720 KB Output is correct
141 Correct 480 ms 38720 KB Output is correct
142 Correct 288 ms 35520 KB Output is correct
143 Correct 234 ms 35520 KB Output is correct
144 Correct 236 ms 35520 KB Output is correct
145 Correct 220 ms 35520 KB Output is correct
146 Correct 221 ms 35520 KB Output is correct
147 Correct 214 ms 35648 KB Output is correct
148 Correct 214 ms 35520 KB Output is correct
149 Correct 216 ms 35520 KB Output is correct
150 Correct 231 ms 35520 KB Output is correct
151 Correct 224 ms 35392 KB Output is correct
152 Correct 228 ms 34112 KB Output is correct
153 Correct 221 ms 35520 KB Output is correct
154 Correct 217 ms 35520 KB Output is correct
155 Correct 237 ms 35808 KB Output is correct
156 Correct 239 ms 35520 KB Output is correct
157 Correct 210 ms 35648 KB Output is correct
158 Correct 213 ms 35520 KB Output is correct
159 Correct 203 ms 35392 KB Output is correct
160 Correct 233 ms 34124 KB Output is correct
161 Correct 481 ms 38720 KB Output is correct
162 Correct 424 ms 38720 KB Output is correct
163 Correct 442 ms 38592 KB Output is correct
164 Correct 492 ms 38464 KB Output is correct
165 Correct 410 ms 38404 KB Output is correct
166 Correct 286 ms 38780 KB Output is correct
167 Correct 271 ms 41536 KB Output is correct
168 Correct 272 ms 41280 KB Output is correct
169 Correct 258 ms 41280 KB Output is correct
170 Correct 266 ms 41152 KB Output is correct
171 Correct 237 ms 41536 KB Output is correct
172 Correct 245 ms 41664 KB Output is correct
173 Correct 454 ms 35264 KB Output is correct
174 Correct 470 ms 35392 KB Output is correct
175 Correct 444 ms 35392 KB Output is correct
176 Correct 397 ms 35520 KB Output is correct