oj.uz

Submission #637743

# Submission time Handle Problem Language Result Execution time Memory
637743 2022-09-03T05:20:56 Z LeonaRaging Event Hopping (BOI22_events) C++14
0 / 100
 192 ms 35860 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "

const ll mod = 1e9 + 7;
const int maxn = 1e5 + 4;
const int INF = 1e9;
const int N = 18;

pair<int,int> a[maxn];

struct seg_tree {
    vector<int> t;
    seg_tree() {
        t.resize(4 * maxn);
    }
    int MIN(int i, int j) {
        return (a[i].fi < a[j].fi ? i : j);
    }
    void update(int pos, int val, int v = 1, int l = 1, int r = maxn - 1) {
        if (l == r) {
            t[v] = MIN(t[v], val);
            return;
        }
        int m = (l + r) / 2;
        if (pos <= m) update(pos, val, 2 * v, l, m);
        else update(pos, val, 2 * v + 1, m + 1, r);
        t[v] = MIN(t[2 * v], t[2 * v + 1]);
    }
    int get(int l, int r, int v = 1, int tl = 1, int tr = maxn - 1) {
        if (tl > r || tr < l) return 0;
        if (tl >= l && tr <= r) return t[v];
        int m = (tl + tr) / 2;
        int L = get(l, r, 2 * v, tl, m);
        int R = get(l, r, 2 * v + 1, m + 1, tr);
        return MIN(L, R);
    }
} IT;

int n, q, pre[maxn][20];
vector<int> vals;
vector<pair<int,int>> R[maxn];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        int l, r; cin >> l >> r;
        a[i] = {l, r};
        vals.pb(l); vals.pb(r);        
    }
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    a[0] = {INF, INF};
    for (int i = 1; i <= n; i++) {
        a[i].fi = lower_bound(vals.begin(), vals.end(), a[i].fi) - vals.begin() + 1;
        a[i].se = lower_bound(vals.begin(), vals.end(), a[i].se) - vals.begin() + 1;
        R[a[i].se].pb({a[i].fi, i});
    }
    int sz = vals.size();
    for (int i = 1; i <= sz; i++) {
        for (auto it : R[i]) {
            pre[it.se][0] = IT.get(it.fi, i);
            IT.update(i, it.se);
        }
    }
    for (int j = 1; j <= N; j++)
        for (int i = n; i >= 1; i--)
            pre[i][j] = pre[pre[i][j - 1]][j - 1];
    a[0] = {-INF, -INF};
    while (q--) {
        int s, t; cin >> s >> t;
        if (s == t) cout << "0\n";
        int ans = 0;
        for (int j = N; j >= 0; j--)
            if (a[pre[t][j]].fi >= a[s].fi) {
                ans += (1 << j);
                t = pre[t][j];
            }
        if (s != t) cout << "impossible";
        else cout << ans;
        cout << '\n';
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 17276 KB Output is correct
2 Correct 192 ms 20272 KB Output is correct
3 Correct 165 ms 20220 KB Output is correct
4 Runtime error 101 ms 35860 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4180 KB Output isn't correct
2 Halted 0 ms 0 KB -