oj.uz

답안 #653947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653947 2022-10-29T02:46:21 Z baojiaopisu Event Hopping (BOI22_events) C++14
100 / 100
 220 ms 17644 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;
const int LOG = 16;

int l[N], r[N];
int jump[N][LOG + 2];

struct SegmentTree {
	int n;
	struct NODE {
		int val, pos;

		NODE(int _val = INF, int _pos = INF) : val(_val), pos(_pos) {}
	};

	NODE min(const NODE &a, const NODE &b) {
		return (a.val < b.val ? a : b);
	}

	vector<NODE> node;

	SegmentTree(int _n = 0) {
		n = _n;
		node.resize(4 * n + 7);
		for(int i = 1; i <= 4 * n; i++) node[i] = NODE();
	}

private:
	void Update(NODE c, int pos, int l, int r, int id) {
		node[id] = min(node[id], c);
		if(l == r) return;

		int mid = (l + r) >> 1;
		if(pos <= mid) Update(c, pos, l, mid, id << 1);
		else Update(c, pos, mid + 1, r, id << 1 | 1);
	}

	NODE Get(int l, int r, int lo, int hi, int id) {
		if(l > hi || r < lo) return NODE();
		if(lo <= l && r <= hi) return node[id];

		int mid = (l + r) >> 1;
		return min(Get(l, mid, lo, hi, id << 1), Get(mid + 1, r, lo, hi, id << 1 | 1));
	}
public:
	void update(int val, int p, int pos) {
		Update(NODE(val, p), pos, 1, n, 1);
	}

	int get(int l, int r) {
		NODE ans = Get(1, n, l, r, 1);
		return ans.pos;
	}
};

void solve() {
	int n, q; cin >> n >> q;
	vector<int> val;
	for(int i = 1; i <= n; i++) {
		cin >> l[i] >> r[i];
		val.pb(l[i]); val.pb(r[i]);
	}

	sort(all(val)); val.resize(unique(all(val)) - val.begin());
	SegmentTree IT = SegmentTree(2 * n);
	for(int i = 1; i <= n; i++) {
		l[i] = lower_bound(all(val), l[i]) - val.begin() + 1;
		r[i] = lower_bound(all(val), r[i]) - val.begin() + 1;	
		IT.update(l[i], i, r[i]);
	}

	for(int i = 1; i <= n; i++) {
		int p = IT.get(l[i], r[i]);
		if(l[p] < l[i]) jump[i][0] = p;
	}

	for(int j = 1; j <= LOG; j++) {
		for(int i = 1; i <= n; i++) {
			int u = jump[i][j - 1];
			jump[i][j] = jump[u][j - 1];
		}
	}

	while(q--) {
		int s, e; cin >> s >> e;

		if(s == e) {
			cout << 0 << '\n';
			continue;
		}

		if(r[s] > r[e]) {
			cout << "impossible" << '\n';
			continue;
		}

		if(r[s] >= l[e]) {
			cout << 1 << '\n';
			continue;
		}

		int ans = 0;
		for(int i = LOG; i >= 0; i--) {
			if(!jump[e][i]) continue;
			int id = jump[e][i];
			if(l[id] > r[s]) {
				ans += (1 << i);
				e = id;
			}
		}

		int id = jump[e][0];
		if(id && l[id] <= r[s]) cout << ans + 2 << '\n';
		else cout << "impossible" << '\n';
	}
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}

Compilation message

events.cpp: In function 'int main()':
events.cpp:188:17: warning: unused variable 'ddd' [-Wunused-variable]
  188 |     int tc = 1, ddd = 0;
      |                 ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 133 ms 17104 KB Output is correct
3 Correct 161 ms 17000 KB Output is correct
4 Correct 156 ms 16956 KB Output is correct
5 Correct 162 ms 17124 KB Output is correct
6 Correct 139 ms 17164 KB Output is correct
7 Correct 151 ms 17180 KB Output is correct
8 Correct 143 ms 17516 KB Output is correct
9 Correct 137 ms 17516 KB Output is correct
10 Correct 164 ms 17360 KB Output is correct
11 Correct 157 ms 17452 KB Output is correct
12 Correct 114 ms 17512 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 480 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 480 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 2 ms 472 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 34 ms 2116 KB Output is correct
20 Correct 32 ms 2064 KB Output is correct
21 Correct 46 ms 2336 KB Output is correct
22 Correct 28 ms 2404 KB Output is correct
23 Correct 27 ms 2284 KB Output is correct
24 Correct 29 ms 2304 KB Output is correct
25 Correct 35 ms 1964 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 480 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 476 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 120 ms 16108 KB Output is correct
20 Correct 111 ms 15896 KB Output is correct
21 Correct 104 ms 16160 KB Output is correct
22 Correct 104 ms 15992 KB Output is correct
23 Correct 130 ms 16104 KB Output is correct
24 Correct 128 ms 16104 KB Output is correct
25 Correct 51 ms 15960 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 16996 KB Output is correct
2 Correct 141 ms 17044 KB Output is correct
3 Correct 220 ms 17036 KB Output is correct
4 Correct 123 ms 17644 KB Output is correct
5 Correct 145 ms 17380 KB Output is correct
6 Correct 219 ms 17236 KB Output is correct
7 Correct 155 ms 17292 KB Output is correct
8 Correct 156 ms 17260 KB Output is correct
9 Correct 126 ms 16452 KB Output is correct
10 Correct 168 ms 16844 KB Output is correct
11 Correct 170 ms 16620 KB Output is correct
12 Correct 162 ms 16836 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 133 ms 17104 KB Output is correct
3 Correct 161 ms 17000 KB Output is correct
4 Correct 156 ms 16956 KB Output is correct
5 Correct 162 ms 17124 KB Output is correct
6 Correct 139 ms 17164 KB Output is correct
7 Correct 151 ms 17180 KB Output is correct
8 Correct 143 ms 17516 KB Output is correct
9 Correct 137 ms 17516 KB Output is correct
10 Correct 164 ms 17360 KB Output is correct
11 Correct 157 ms 17452 KB Output is correct
12 Correct 114 ms 17512 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 1 ms 472 KB Output is correct
18 Correct 2 ms 476 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 480 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 476 KB Output is correct
28 Correct 2 ms 472 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 34 ms 2116 KB Output is correct
32 Correct 32 ms 2064 KB Output is correct
33 Correct 46 ms 2336 KB Output is correct
34 Correct 28 ms 2404 KB Output is correct
35 Correct 27 ms 2284 KB Output is correct
36 Correct 29 ms 2304 KB Output is correct
37 Correct 35 ms 1964 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 476 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 476 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 120 ms 16108 KB Output is correct
48 Correct 111 ms 15896 KB Output is correct
49 Correct 104 ms 16160 KB Output is correct
50 Correct 104 ms 15992 KB Output is correct
51 Correct 130 ms 16104 KB Output is correct
52 Correct 128 ms 16104 KB Output is correct
53 Correct 51 ms 15960 KB Output is correct
54 Correct 138 ms 16996 KB Output is correct
55 Correct 141 ms 17044 KB Output is correct
56 Correct 220 ms 17036 KB Output is correct
57 Correct 123 ms 17644 KB Output is correct
58 Correct 145 ms 17380 KB Output is correct
59 Correct 219 ms 17236 KB Output is correct
60 Correct 155 ms 17292 KB Output is correct
61 Correct 156 ms 17260 KB Output is correct
62 Correct 126 ms 16452 KB Output is correct
63 Correct 168 ms 16844 KB Output is correct
64 Correct 170 ms 16620 KB Output is correct
65 Correct 162 ms 16836 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 136 ms 16632 KB Output is correct
68 Correct 146 ms 16632 KB Output is correct
69 Correct 170 ms 16576 KB Output is correct
70 Correct 154 ms 16752 KB Output is correct
71 Correct 152 ms 16748 KB Output is correct
72 Correct 155 ms 16772 KB Output is correct
73 Correct 138 ms 17140 KB Output is correct
74 Correct 129 ms 17220 KB Output is correct
75 Correct 188 ms 17084 KB Output is correct
76 Correct 155 ms 17052 KB Output is correct
77 Correct 87 ms 17180 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 1 ms 468 KB Output is correct
80 Correct 2 ms 468 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 2 ms 472 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 1 ms 468 KB Output is correct
85 Correct 1 ms 476 KB Output is correct
86 Correct 36 ms 2072 KB Output is correct
87 Correct 34 ms 2088 KB Output is correct
88 Correct 37 ms 2360 KB Output is correct
89 Correct 26 ms 2572 KB Output is correct
90 Correct 30 ms 2212 KB Output is correct
91 Correct 33 ms 2276 KB Output is correct
92 Correct 29 ms 1876 KB Output is correct
93 Correct 116 ms 16016 KB Output is correct
94 Correct 106 ms 15964 KB Output is correct
95 Correct 107 ms 16100 KB Output is correct
96 Correct 110 ms 16108 KB Output is correct
97 Correct 122 ms 16096 KB Output is correct
98 Correct 137 ms 16096 KB Output is correct
99 Correct 62 ms 16084 KB Output is correct
100 Correct 185 ms 16812 KB Output is correct
101 Correct 171 ms 16796 KB Output is correct
102 Correct 180 ms 16928 KB Output is correct
103 Correct 176 ms 16424 KB Output is correct
104 Correct 158 ms 16208 KB Output is correct
105 Correct 159 ms 16496 KB Output is correct
106 Correct 156 ms 16836 KB Output is correct
107 Correct 170 ms 16940 KB Output is correct
108 Correct 138 ms 16812 KB Output is correct
109 Correct 148 ms 16872 KB Output is correct
110 Correct 149 ms 16692 KB Output is correct
111 Correct 174 ms 16724 KB Output is correct