135382025-01-08 09:31:54Leventusz09A lehető legkevesebb átszállás (50 pont)cpp17Wrong answer 37/50300ms1772 KiB
#include <iostream>
#include <vector>

using namespace std;

int main() {
	int N, M;
	cin >> N >> M;

	vector<int> ss(M, -1);  // minimális átszállások száma
	vector<int> ls(M, -1);  // előző index
	vector<int> ind(M, -1); // bemeneti index

	for (int i = 0, a, b; i < N; i++) {
		cin >> a >> b;
		for (int j = a+1; j <= b; j++) {
			if (ss [a - 1] < ss[j - 1] || ss[j - 1] == -1) {
				ss [j - 1] = ss[a - 1] + 1;
				ls [j - 1] = a - 1;
				ind[j - 1] = i;
			}
		}
	}

	cout << ss[M - 1] << "\n";
	vector<int> ol;
	for (int i = M - 1; i != 0; i = ls[i]) ol.push_back(ind[i] + 1);
	
	for (int i = ss[M - 1]; i >= 0; i--) cout << ol[i] << " ";
	cout << endl;

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base37/50
1Accepted0/01ms316 KiB
2Accepted0/013ms1588 KiB
3Accepted1/11ms316 KiB
4Wrong answer0/11ms500 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/22ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/23ms316 KiB
10Accepted2/24ms564 KiB
11Accepted2/26ms652 KiB
12Accepted2/27ms820 KiB
13Accepted2/22ms564 KiB
14Accepted2/23ms820 KiB
15Accepted2/24ms824 KiB
16Accepted2/27ms1000 KiB
17Accepted2/29ms1424 KiB
18Accepted2/210ms1332 KiB
19Accepted2/210ms1524 KiB
20Accepted2/212ms1580 KiB
21Accepted2/213ms1588 KiB
22Accepted2/213ms1600 KiB
23Time limit exceeded0/2300ms1076 KiB
24Time limit exceeded0/2300ms1332 KiB
25Time limit exceeded0/2300ms1332 KiB
26Time limit exceeded0/2300ms1332 KiB
27Time limit exceeded0/2287ms1332 KiB
28Time limit exceeded0/2300ms1772 KiB