206062026-01-07 19:04:49mikloshunorA lehető legkevesebb átszállás (50 pont)cpp17Accepted 50/508ms540 KiB
#include <iostream>
#include <vector>

using namespace std; 

struct vonat
{
    int k, v;
};

int main()
{
    int n, a;
    cin >> n >> a;
    vector <vonat> v(n);
    vector <int> ind;
    
    for (int i = 0; i< n; i++)
    {
        cin >> v[i].k >> v[i].v;
    }
    int vege = 1, i = 0, maxveg, maxind;
    
    while (vege != a)
    {
        maxind = -1;
        maxveg = vege;
        while (i < n && v[i].k <= vege)
        {
            if (v[i].v > maxveg)
            {
                maxveg = v[i].v;
                maxind = i;
            }
            i++;
        }
        if (maxind == -1)
        {
            cout << maxind;
            return 0;
        }
        vege = maxveg;
        ind.push_back (maxind + 1);
    }
    cout << ind.size() - 1 << endl;
    int m = ind.size();
    for (auto i = 0; i < m; i++)
    {
        cout << ind[i] << " ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/07ms500 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms508 KiB
9Accepted2/22ms500 KiB
10Accepted2/23ms316 KiB
11Accepted2/24ms508 KiB
12Accepted2/24ms316 KiB
13Accepted2/21ms508 KiB
14Accepted2/22ms536 KiB
15Accepted2/23ms420 KiB
16Accepted2/24ms388 KiB
17Accepted2/26ms452 KiB
18Accepted2/26ms456 KiB
19Accepted2/27ms332 KiB
20Accepted2/27ms540 KiB
21Accepted2/27ms316 KiB
22Accepted2/28ms472 KiB
23Accepted2/27ms316 KiB
24Accepted2/27ms476 KiB
25Accepted2/27ms472 KiB
26Accepted2/27ms316 KiB
27Accepted2/27ms480 KiB
28Accepted2/27ms480 KiB