답안 #583648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583648 2022-06-25T21:15:22 Z tutis Event Hopping (BOI22_events) C++17
10 / 100
1500 ms 524288 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] = upper_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;
	for (int i = N - 1; i >= 0; i--)
	{
		D[i][i] = 0;
		for (int j = i + 1; j < N; j++)
		{
			if (S[j] <= E[i])
				D[i][j] = 1;
			else
			{
				for (int k = i + 1; k < j; k++)
					D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
			}
		}
	}
	while (Q--)
	{
		int s, t;
		cin >> s >> t;
		s = p[s - 1];
		t = p[t - 1];
		int k = D[s][t];
		if (s == t)
		{
			cout << "0\n";
		}
		else {
			if (S[t] <= E[s] && E[s] <= E[t])
				cout << "1\n";
			else {
				if (k > N)
					cout << "impossible\n";
				else
					cout << k << "\n";
			}
		}
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 227 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 293 ms 4228 KB Output is correct
4 Correct 281 ms 4232 KB Output is correct
5 Correct 307 ms 4232 KB Output is correct
6 Correct 212 ms 4180 KB Output is correct
7 Correct 148 ms 4232 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 3 ms 4200 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 293 ms 4228 KB Output is correct
4 Correct 281 ms 4232 KB Output is correct
5 Correct 307 ms 4232 KB Output is correct
6 Correct 212 ms 4180 KB Output is correct
7 Correct 148 ms 4232 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 3 ms 4200 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 311 ms 4232 KB Output is correct
13 Correct 293 ms 4280 KB Output is correct
14 Correct 271 ms 4312 KB Output is correct
15 Correct 201 ms 4176 KB Output is correct
16 Correct 136 ms 4180 KB Output is correct
17 Correct 3 ms 4180 KB Output is correct
18 Correct 3 ms 4180 KB Output is correct
19 Execution timed out 1585 ms 98224 KB Time limit exceeded
20 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 293 ms 4228 KB Output is correct
4 Correct 281 ms 4232 KB Output is correct
5 Correct 307 ms 4232 KB Output is correct
6 Correct 212 ms 4180 KB Output is correct
7 Correct 148 ms 4232 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 3 ms 4200 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 305 ms 4240 KB Output is correct
13 Correct 307 ms 4248 KB Output is correct
14 Correct 348 ms 4236 KB Output is correct
15 Correct 191 ms 4252 KB Output is correct
16 Correct 142 ms 4240 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 3 ms 4180 KB Output is correct
19 Runtime error 261 ms 524288 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 387 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 227 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -