oj.uz

답안 #678473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678473 2023-01-06T04:40:21 Z cig32 Event Hopping (BOI22_events) C++17
100 / 100
 369 ms 58964 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 998244353;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); 
  lucas[0] = 2;
  lucas[1] = 1;
  for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
  fib[0] = 0;
  fib[1] = 1;
  for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void google(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
  int n = a.size();
  int bucket[n+1];
  for(int i=1; i<=n; i++) bucket[i] = 1e18;
  int ans = 1;
  for(int x: a) {
    auto it = lower_bound(bucket + 1, bucket +n +1, x);
    int d = distance(bucket, it);
    ans = max(ans, d);
    bucket[d] = min(bucket[d], x);
  }
  return ans;
}
 
pair<int, int> str[4*MAXN];
 
void u(int l, int r, int tar, int idx, int val, int val2) {
  if(l == r) {
    str[idx] = {val, val2}; return;
  }
  int mid = (l + r) >> 1;
  if(tar <= mid) u(l, mid, tar, 2 * idx + 1, val, val2);
  else u(mid + 1, r, tar, 2 * idx + 2, val, val2);
  str[idx] = min(str[2*idx+1], str[2*idx+2]);
}
 
pair<int, int> qu(int l, int r, int constl, int constr, int idx) {
  if(l <= constl && constr <= r) return str[idx];
  int mid = (constl + constr) >> 1;
  if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
  else if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
  else {
    return min(qu(l, r, constl, mid, 2*idx+1), qu(l, r, mid+1, constr, 2*idx+2));
  }
}
 
void update(int i, int v, int w) {
  u(0, MAXN - 1, i, 0, v, w);
}
int min_idx(int l, int r) {
  pair<int, int> res = qu(l, r, 0, MAXN - 1, 0);
  if(res.first == 1e16) return -1;
  return res.second;
}
 
void solve(int tc) {
  int n, q;
  cin >> n >> q;
  int s[n+1], e[n+1];
  for(int i=1; i<=n; i++) cin >> s[i] >> e[i];
  set<int> sett;
  unordered_map<int, int> is;
  int nxt = 0;
  for(int i=1; i<=n; i++) {
    sett.insert(s[i]);
    sett.insert(e[i]);
  }
  for(int x: sett) {
    nxt++;
    is[x] = nxt;
  }
  for(int i=1; i<=n; i++) s[i] = is[s[i]], e[i] = is[e[i]];
  int m = nxt;
  pair<int, int> ohno1[m+1];
  for(int i=1; i<=m; i++) ohno1[i] = {1e16, 0};
  for(int i=1; i<=n; i++) ohno1[e[i]] = min(ohno1[e[i]], {s[i], i});
  for(int i=1; i<=m; i++) update(i, ohno1[i].first, ohno1[i].second);
  int st[17][n+1];
  
  for(int i=1; i<=n; i++) {
    st[0][i] = min_idx(s[i], e[i]);
    if(s[st[0][i]] == s[i]) st[0][i] = -1;
  //  cout << st[0][i] << " \n"[i == n];
  }
  for(int i=1; i<17; i++) {
    for(int j=1; j<=n; j++) {
      if(st[i-1][j] != -1) st[i][j] = st[i-1][st[i-1][j]];
      else st[i][j] = -1;
    }
  }
  while(q--) {
    int x, y;
    cin >> x >> y;
    int ans = 0;
    if(e[x] > e[y]) {
      cout << "impossible\n"; continue;
    }
    if(x == y) {
      cout << "0\n"; continue;
    }
    if(s[y] <= e[x] && e[x] <= e[y]) {
      cout << "1\n"; continue;
    }
    for(int i=16; i>=0; i--) {
      int id = st[i][y];
      if(id == -1) continue;
      if(s[id] > e[x]) {
        y = id;
        ans += (1 << i);
      }
    }
    //cout << x << " " << y << " " << ans << "\n";
    if(x == y) {
      cout << ans << "\n"; continue;
    }
    if(s[y] <= e[x] && e[x] <= e[y]) {
      cout << ans + 1 << "\n"; continue;
    }
    bool done = 0;
    for(int i=0; i<3; i++) {
      y = st[0][y];
      ans++;
      if(y == -1) {
        break;
      }
      if(s[y] <= e[x] && e[x] <= e[y]) {
        cout << ans + 1 << "\n";
        done = 1;
        break;
      }
    }
    if(!done) cout << "impossible\n";
    
  }
} 
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 7380 KB Output is correct
2 Correct 137 ms 42188 KB Output is correct
3 Correct 151 ms 42168 KB Output is correct
4 Correct 234 ms 42244 KB Output is correct
5 Correct 165 ms 43624 KB Output is correct
6 Correct 203 ms 45088 KB Output is correct
7 Correct 179 ms 45492 KB Output is correct
8 Correct 242 ms 58856 KB Output is correct
9 Correct 222 ms 58952 KB Output is correct
10 Correct 198 ms 42464 KB Output is correct
11 Correct 202 ms 48444 KB Output is correct
12 Correct 121 ms 41952 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7380 KB Output is correct
2 Correct 7 ms 7336 KB Output is correct
3 Correct 8 ms 7636 KB Output is correct
4 Correct 8 ms 7628 KB Output is correct
5 Correct 8 ms 7736 KB Output is correct
6 Correct 8 ms 7640 KB Output is correct
7 Correct 8 ms 7892 KB Output is correct
8 Correct 9 ms 7848 KB Output is correct
9 Correct 8 ms 7516 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7380 KB Output is correct
2 Correct 7 ms 7336 KB Output is correct
3 Correct 8 ms 7636 KB Output is correct
4 Correct 8 ms 7628 KB Output is correct
5 Correct 8 ms 7736 KB Output is correct
6 Correct 8 ms 7640 KB Output is correct
7 Correct 8 ms 7892 KB Output is correct
8 Correct 9 ms 7848 KB Output is correct
9 Correct 8 ms 7516 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 8 ms 7380 KB Output is correct
12 Correct 8 ms 7732 KB Output is correct
13 Correct 8 ms 7636 KB Output is correct
14 Correct 8 ms 7636 KB Output is correct
15 Correct 8 ms 7636 KB Output is correct
16 Correct 8 ms 7892 KB Output is correct
17 Correct 9 ms 7892 KB Output is correct
18 Correct 8 ms 7496 KB Output is correct
19 Correct 39 ms 10620 KB Output is correct
20 Correct 37 ms 10444 KB Output is correct
21 Correct 42 ms 10692 KB Output is correct
22 Correct 34 ms 10700 KB Output is correct
23 Correct 37 ms 11348 KB Output is correct
24 Correct 35 ms 11332 KB Output is correct
25 Correct 37 ms 11052 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7380 KB Output is correct
2 Correct 7 ms 7336 KB Output is correct
3 Correct 8 ms 7636 KB Output is correct
4 Correct 8 ms 7628 KB Output is correct
5 Correct 8 ms 7736 KB Output is correct
6 Correct 8 ms 7640 KB Output is correct
7 Correct 8 ms 7892 KB Output is correct
8 Correct 9 ms 7848 KB Output is correct
9 Correct 8 ms 7516 KB Output is correct
10 Correct 8 ms 7380 KB Output is correct
11 Correct 7 ms 7380 KB Output is correct
12 Correct 8 ms 7640 KB Output is correct
13 Correct 8 ms 7636 KB Output is correct
14 Correct 9 ms 7636 KB Output is correct
15 Correct 10 ms 7628 KB Output is correct
16 Correct 9 ms 7792 KB Output is correct
17 Correct 9 ms 7900 KB Output is correct
18 Correct 8 ms 7516 KB Output is correct
19 Correct 112 ms 40384 KB Output is correct
20 Correct 110 ms 39564 KB Output is correct
21 Correct 132 ms 40324 KB Output is correct
22 Correct 156 ms 46004 KB Output is correct
23 Correct 235 ms 56676 KB Output is correct
24 Correct 251 ms 56648 KB Output is correct
25 Correct 38 ms 23508 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 154 ms 42176 KB Output is correct
2 Correct 164 ms 42168 KB Output is correct
3 Correct 256 ms 42188 KB Output is correct
4 Correct 219 ms 58964 KB Output is correct
5 Correct 213 ms 42564 KB Output is correct
6 Correct 317 ms 58532 KB Output is correct
7 Correct 353 ms 58536 KB Output is correct
8 Correct 280 ms 58772 KB Output is correct
9 Correct 251 ms 56656 KB Output is correct
10 Correct 272 ms 58180 KB Output is correct
11 Correct 323 ms 58076 KB Output is correct
12 Correct 292 ms 58136 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 7380 KB Output is correct
2 Correct 137 ms 42188 KB Output is correct
3 Correct 151 ms 42168 KB Output is correct
4 Correct 234 ms 42244 KB Output is correct
5 Correct 165 ms 43624 KB Output is correct
6 Correct 203 ms 45088 KB Output is correct
7 Correct 179 ms 45492 KB Output is correct
8 Correct 242 ms 58856 KB Output is correct
9 Correct 222 ms 58952 KB Output is correct
10 Correct 198 ms 42464 KB Output is correct
11 Correct 202 ms 48444 KB Output is correct
12 Correct 121 ms 41952 KB Output is correct
13 Correct 8 ms 7380 KB Output is correct
14 Correct 7 ms 7336 KB Output is correct
15 Correct 8 ms 7636 KB Output is correct
16 Correct 8 ms 7628 KB Output is correct
17 Correct 8 ms 7736 KB Output is correct
18 Correct 8 ms 7640 KB Output is correct
19 Correct 8 ms 7892 KB Output is correct
20 Correct 9 ms 7848 KB Output is correct
21 Correct 8 ms 7516 KB Output is correct
22 Correct 7 ms 7380 KB Output is correct
23 Correct 8 ms 7380 KB Output is correct
24 Correct 8 ms 7732 KB Output is correct
25 Correct 8 ms 7636 KB Output is correct
26 Correct 8 ms 7636 KB Output is correct
27 Correct 8 ms 7636 KB Output is correct
28 Correct 8 ms 7892 KB Output is correct
29 Correct 9 ms 7892 KB Output is correct
30 Correct 8 ms 7496 KB Output is correct
31 Correct 39 ms 10620 KB Output is correct
32 Correct 37 ms 10444 KB Output is correct
33 Correct 42 ms 10692 KB Output is correct
34 Correct 34 ms 10700 KB Output is correct
35 Correct 37 ms 11348 KB Output is correct
36 Correct 35 ms 11332 KB Output is correct
37 Correct 37 ms 11052 KB Output is correct
38 Correct 8 ms 7380 KB Output is correct
39 Correct 7 ms 7380 KB Output is correct
40 Correct 8 ms 7640 KB Output is correct
41 Correct 8 ms 7636 KB Output is correct
42 Correct 9 ms 7636 KB Output is correct
43 Correct 10 ms 7628 KB Output is correct
44 Correct 9 ms 7792 KB Output is correct
45 Correct 9 ms 7900 KB Output is correct
46 Correct 8 ms 7516 KB Output is correct
47 Correct 112 ms 40384 KB Output is correct
48 Correct 110 ms 39564 KB Output is correct
49 Correct 132 ms 40324 KB Output is correct
50 Correct 156 ms 46004 KB Output is correct
51 Correct 235 ms 56676 KB Output is correct
52 Correct 251 ms 56648 KB Output is correct
53 Correct 38 ms 23508 KB Output is correct
54 Correct 154 ms 42176 KB Output is correct
55 Correct 164 ms 42168 KB Output is correct
56 Correct 256 ms 42188 KB Output is correct
57 Correct 219 ms 58964 KB Output is correct
58 Correct 213 ms 42564 KB Output is correct
59 Correct 317 ms 58532 KB Output is correct
60 Correct 353 ms 58536 KB Output is correct
61 Correct 280 ms 58772 KB Output is correct
62 Correct 251 ms 56656 KB Output is correct
63 Correct 272 ms 58180 KB Output is correct
64 Correct 323 ms 58076 KB Output is correct
65 Correct 292 ms 58136 KB Output is correct
66 Correct 7 ms 7380 KB Output is correct
67 Correct 169 ms 42144 KB Output is correct
68 Correct 156 ms 42164 KB Output is correct
69 Correct 216 ms 42152 KB Output is correct
70 Correct 231 ms 43732 KB Output is correct
71 Correct 184 ms 45100 KB Output is correct
72 Correct 207 ms 45592 KB Output is correct
73 Correct 247 ms 58960 KB Output is correct
74 Correct 247 ms 58856 KB Output is correct
75 Correct 235 ms 42512 KB Output is correct
76 Correct 245 ms 48476 KB Output is correct
77 Correct 130 ms 41868 KB Output is correct
78 Correct 8 ms 7380 KB Output is correct
79 Correct 10 ms 7632 KB Output is correct
80 Correct 10 ms 7752 KB Output is correct
81 Correct 9 ms 7640 KB Output is correct
82 Correct 10 ms 7636 KB Output is correct
83 Correct 12 ms 7796 KB Output is correct
84 Correct 10 ms 7888 KB Output is correct
85 Correct 8 ms 7512 KB Output is correct
86 Correct 44 ms 10592 KB Output is correct
87 Correct 53 ms 10444 KB Output is correct
88 Correct 50 ms 10628 KB Output is correct
89 Correct 44 ms 10756 KB Output is correct
90 Correct 36 ms 11336 KB Output is correct
91 Correct 34 ms 11348 KB Output is correct
92 Correct 41 ms 10960 KB Output is correct
93 Correct 114 ms 40424 KB Output is correct
94 Correct 118 ms 39624 KB Output is correct
95 Correct 150 ms 40340 KB Output is correct
96 Correct 193 ms 45848 KB Output is correct
97 Correct 280 ms 56584 KB Output is correct
98 Correct 274 ms 56664 KB Output is correct
99 Correct 48 ms 23500 KB Output is correct
100 Correct 348 ms 58488 KB Output is correct
101 Correct 338 ms 58536 KB Output is correct
102 Correct 323 ms 58640 KB Output is correct
103 Correct 347 ms 58124 KB Output is correct
104 Correct 349 ms 58020 KB Output is correct
105 Correct 368 ms 58164 KB Output is correct
106 Correct 196 ms 37144 KB Output is correct
107 Correct 221 ms 41528 KB Output is correct
108 Correct 216 ms 42240 KB Output is correct
109 Correct 217 ms 42316 KB Output is correct
110 Correct 369 ms 58416 KB Output is correct
111 Correct 309 ms 58472 KB Output is correct