130772025-01-05 15:44:00PallanekPéterA lehető legkevesebb átszállás (50 pont)cpp17Wrong answer 30/508ms528 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<array<int,3>> vonatok(n);
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> vonatok[i][0] >> vonatok[i][1];
        vonatok[i][2]=i+1;
    }
    sort(vonatok.begin(), vonatok.end());
    int j=1, mx=0;
    vector<int> utvonal;
    int i=0;
    while (j<m) {
        int legjobb_vonat = -1;
        while (i<n && vonatok[i][0]<=j) {
            if (vonatok[i][1]>mx) {
                mx=vonatok[i][1];
                legjobb_vonat = vonatok[i][2];
            }
            i++;
        }
        if (legjobb_vonat==-1) {
            cout << -1 << endl;
            return 0;
        }
        utvonal.push_back(legjobb_vonat);
        j=mx+1;
    }
    cout << utvonal.size()-1 << endl;
    for (int i : utvonal) {
        cout << i << " ";
    }
}
SubtaskSumTestVerdictTimeMemory
base30/50
1Accepted0/01ms508 KiB
2Wrong answer0/08ms320 KiB
3Wrong answer0/11ms500 KiB
4Accepted1/11ms320 KiB
5Accepted2/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Accepted2/21ms376 KiB
8Accepted2/22ms420 KiB
9Accepted2/22ms320 KiB
10Accepted2/23ms440 KiB
11Wrong answer0/24ms448 KiB
12Partially correct1/24ms320 KiB
13Partially correct1/21ms320 KiB
14Partially correct1/22ms512 KiB
15Accepted2/23ms320 KiB
16Partially correct1/24ms320 KiB
17Partially correct1/26ms484 KiB
18Wrong answer0/26ms508 KiB
19Wrong answer0/27ms320 KiB
20Partially correct1/27ms508 KiB
21Partially correct1/28ms520 KiB
22Wrong answer0/28ms528 KiB
23Wrong answer0/28ms500 KiB
24Accepted2/27ms320 KiB
25Accepted2/28ms528 KiB
26Accepted2/28ms516 KiB
27Accepted2/28ms500 KiB
28Accepted2/28ms520 KiB