oj.uz

답안 #583656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583656 2022-06-25T22:08:17 Z tutis Event Hopping (BOI22_events) C++17
40 / 100
 1500 ms 5244 KB 
/*input
8 5
1 2
3 4
1 5
6 7
5 10
10 20
15 20
999999999 1000000000
1 6
1 7
2 4
3 3
5 8
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int N, Q;
	cin >> N >> Q;
	pair<pair<int, int>, int>A[N];
	for (int i = 0; i < N; i++)
	{
		cin >> A[i].first.second >> A[i].first.first;
		A[i].second = i;
	}
	sort(A, A + N);
	int p[N];
	for (int i = 0; i < N; i++)
		p[A[i].second] = i;
	int S[N], E[N];
	for (int i = 0; i < N; i++)
	{
		S[i] = A[i].first.second;
		E[i] = A[i].first.first;
	}
	for (int i = 0; i < N; i++)
	{
		S[i] = (lower_bound(E, E + N, S[i]) - E);
	}
	// int D[N][N];
	// for (int i = 0; i < N; i++)
	// 	for (int j = 0; j < N; j++)
	// 		D[i][j] = N + 10;
	vector<int>V;
	int pa[N];
	for (int j = 0; j < N; j++)
	{
		if (S[j] >= j)
		{
			pa[j] = j;
		}
		else
		{
			auto it = lower_bound(V.begin(), V.end(), S[j]);
			assert(it != V.end());
			pa[j] = *it;
		}
		// pair<int, int>mn = { N + 1, N + 1};
		// for (int i = S[j]; i < j; i++)
		// {
		// 	mn = min(mn, {S[i], i});
		// }
		// pa[j] = mn.second;
		// for (int i = 0; i < S[j]; i++)
		// 	D[j][i] = D[mn.second][i] + 1;
		while (!V.empty() && S[V.back()] >= S[j])
			V.pop_back();
		V.push_back(j);
	}
	while (Q--)
	{
		int s, t;
		cin >> s >> t;
		s = p[s - 1];
		t = p[t - 1];
		if (s == t)
		{
			cout << "0\n";
		}
		else {
			if (A[t].first.second <= A[s].first.first && A[s].first.first <= A[t].first.first)
				cout << "1\n";
			else {
				int a = 1;
				while (true)
				{
					if (s >= S[t] && s < t)
					{
						cout << a << "\n";
						break;
					}
					if (pa[t] == t)
					{
						cout << "impossible\n";
						break;
					}
					t = pa[t];
					a++;
				}
				// int k = D[t][s];
				// if (k > N)
				// 	cout << "impossible\n";
				// else
				// 	cout << k << "\n";
			}
		}
	}
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1598 ms 3664 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 393 ms 900 KB Output is correct
20 Correct 1149 ms 976 KB Output is correct
21 Correct 432 ms 1252 KB Output is correct
22 Correct 26 ms 1228 KB Output is correct
23 Correct 30 ms 1152 KB Output is correct
24 Correct 229 ms 960 KB Output is correct
25 Correct 42 ms 756 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 62 ms 5244 KB Output is correct
20 Correct 39 ms 3940 KB Output is correct
21 Correct 39 ms 3372 KB Output is correct
22 Correct 41 ms 3664 KB Output is correct
23 Correct 36 ms 3604 KB Output is correct
24 Correct 38 ms 4516 KB Output is correct
25 Correct 29 ms 3140 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1577 ms 3700 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1598 ms 3664 KB Time limit exceeded
3 Halted 0 ms 0 KB -