232052026-01-16 17:08:22horkaA lehető legkevesebb átszállás (50 pont)cpp17Accepted 50/504ms1112 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,m; cin>>n>>m;
    swap(n,m);
    vector<array<int, 2>> mx(n+1);
    for(int i=1; i<=m; i++)
    {
        int a,b; cin>>a>>b;
        mx[a]=max(mx[a],{b,i});
    }
    for(int i=1; i<=n; i++)
        mx[i]=max(mx[i],mx[i-1]);
    vector<int> ans;
    int curr=1;
    while(curr<n)
    {
        if(mx[curr][0]<=curr) break;
        ans.push_back(mx[curr][1]);
        curr=mx[curr][0];
    }
    if(n==1)
    {
        cout<<"0\n";
        return 0;
    }
    if(curr<n)
    {
        cout<<"-1\n";
        return 0;
    }
    cout<<ans.size()-1<<"\n";
    for(int i:ans)
        cout<<i<<" ";
    cout<<"\n";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/04ms1076 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms508 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms332 KiB
8Accepted2/22ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms508 KiB
11Accepted2/22ms568 KiB
12Accepted2/23ms572 KiB
13Accepted2/21ms564 KiB
14Accepted2/22ms564 KiB
15Accepted2/22ms820 KiB
16Accepted2/23ms836 KiB
17Accepted2/23ms872 KiB
18Accepted2/23ms1076 KiB
19Accepted2/24ms1076 KiB
20Accepted2/24ms1112 KiB
21Accepted2/24ms1076 KiB
22Accepted2/24ms1076 KiB
23Accepted2/23ms824 KiB
24Accepted2/23ms820 KiB
25Accepted2/24ms1076 KiB
26Accepted2/23ms1076 KiB
27Accepted2/24ms1080 KiB
28Accepted2/24ms1076 KiB