129812025-01-04 13:35:20PallanekPéterMekk Mester munkái (50 pont)cpp17Accepted 50/5090ms2268 KiB
#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,h; cin >> n >> h;
    vector<array<int,3>> munka(n);
    for (int i=0;i<n;i++){
        cin >> munka[i][1] >> munka[i][0];
        munka[i][2]=i+1;
    }
    sort(munka.begin(), munka.end());
    int m=0,f=0;
    vector<int> mm,fm;
    for (int i=0;i<n;i++){
        if (m>f and m<munka[i][1]){
            m=munka[i][0];mm.push_back(munka[i][2]);
        }
        else if (f<munka[i][1]){
            f=munka[i][0];fm.push_back(munka[i][2]);
        }
        else if (m<munka[i][1]){
            m=munka[i][0];mm.push_back(munka[i][2]);
        }
    }
    cout << mm.size() << " " << fm.size() << "\n";
    for (int i:mm)
        cout << i << " ";
    cout << "\n";
    for (int i:fm)
        cout << i << " ";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms320 KiB
2Accepted0/08ms320 KiB
3Accepted1/11ms320 KiB
4Accepted1/11ms508 KiB
5Accepted2/21ms320 KiB
6Accepted2/21ms320 KiB
7Accepted2/21ms320 KiB
8Accepted2/21ms320 KiB
9Accepted3/31ms508 KiB
10Accepted1/11ms320 KiB
11Accepted1/12ms320 KiB
12Accepted2/21ms320 KiB
13Accepted2/21ms388 KiB
14Accepted2/22ms412 KiB
15Accepted2/22ms320 KiB
16Accepted3/32ms508 KiB
17Accepted2/285ms1596 KiB
18Accepted2/281ms1584 KiB
19Accepted4/481ms1592 KiB
20Accepted4/482ms1588 KiB
21Accepted4/483ms1780 KiB
22Accepted4/483ms1592 KiB
23Accepted4/490ms2268 KiB