178492025-09-19 18:12:23KristófA lehető legkevesebb átszállás (50 pont)cpp17Wrong answer 39/508ms508 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n,m;
    cin>>n>>m;
    vector<pair<int,int>> utak(n+1);
    for(int i=1;i<=n;i++)
        {
        cin>>utak[i].first>>utak[i].second;
        }
    int tovabbm=1;
    int tovabbmtmp=1;
    int indextmp;
    vector<int> megoldas(10001);
    int cnt=0;
    for(int i=1;i<=n && tovabbm<m;)
        {
        if(utak[i].first<=tovabbm)
            {
            if(utak[i].second>tovabbmtmp)
                {
                tovabbmtmp=utak[i].second;
                indextmp=i;
                }
            i++;
            }
        else
            {
            if(tovabbm==tovabbmtmp)
                {
                cout<<-1;
                return 0;
                }
            else
                {
                tovabbm=tovabbmtmp;
                megoldas[cnt]=indextmp;
                cnt++;
                }
            }
        }
    cout<<cnt-1<<endl;
    for(int i=0;i<cnt;i++)
        {
        cout<<megoldas[i]<<" ";
        }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base39/50
1Accepted0/01ms508 KiB
2Accepted0/08ms316 KiB
3Wrong answer0/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted2/21ms500 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/22ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/22ms316 KiB
10Accepted2/23ms424 KiB
11Accepted2/23ms316 KiB
12Accepted2/24ms316 KiB
13Accepted2/21ms316 KiB
14Accepted2/22ms316 KiB
15Accepted2/23ms320 KiB
16Accepted2/24ms440 KiB
17Accepted2/26ms316 KiB
18Accepted2/26ms456 KiB
19Accepted2/27ms464 KiB
20Accepted2/27ms316 KiB
21Accepted2/28ms480 KiB
22Accepted2/27ms476 KiB
23Wrong answer0/27ms476 KiB
24Wrong answer0/27ms472 KiB
25Accepted2/27ms476 KiB
26Wrong answer0/27ms480 KiB
27Wrong answer0/27ms316 KiB
28Accepted2/27ms328 KiB