204822026-01-07 10:02:54BikficcA lehető legkevesebb átszállás (50 pont)cpp17Accepted 50/507ms508 KiB
#include <iostream>
#include <vector>
using namespace std;

struct vonat
{
    int start, stop;
};

int main()
{
    int n, m;
    cin >> n >> m;

    vector<vonat> v(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> v[i].start >> v[i].stop;
    }

    int vege = 1,mvege, mindex;
    vector<int> index;
    int i = 0;
    while (vege < m)
    {
        mvege = vege;
        mindex = -1;
        while (i < n && v[i].start <= vege)
        {
            if (v[i].stop > mvege)
            {
                mvege = v[i].stop;
                mindex = i;
            }
            i++;
        }
        if (mindex == -1)
        {
            cout << -1;
            return 0;
        }
        index.push_back(mindex+1);
        vege = mvege;
    }

    cout << index.size() - 1 << endl;
    for (int x : index)
    {
        cout << x << " ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/07ms316 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms500 KiB
7Accepted2/22ms508 KiB
8Accepted2/22ms416 KiB
9Accepted2/22ms316 KiB
10Accepted2/23ms316 KiB
11Accepted2/23ms316 KiB
12Accepted2/24ms388 KiB
13Accepted2/22ms316 KiB
14Accepted2/22ms316 KiB
15Accepted2/23ms316 KiB
16Accepted2/24ms316 KiB
17Accepted2/26ms316 KiB
18Accepted2/26ms508 KiB
19Accepted2/26ms316 KiB
20Accepted2/27ms468 KiB
21Accepted2/27ms388 KiB
22Accepted2/27ms480 KiB
23Accepted2/27ms316 KiB
24Accepted2/27ms476 KiB
25Accepted2/27ms476 KiB
26Accepted2/27ms316 KiB
27Accepted2/27ms476 KiB
28Accepted2/27ms316 KiB