Submission

Score: 100

User: APNICHANAN

Problemset: วันว่างๆ

Language: cpp

Time: 0.024 second

Submitted On: 2026-03-06 21:48:51

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll cnt[1005] , maxi = 0 , mini = 1e9 ;
int main(){
    ll n ; cin >> n ;
    for (ll i = 1 ; i <= n ; i++){
        ll m ; cin >> m ;
        for (ll j = 0 ; j < m ; j++){
            ll a , b ; cin >> a >> b ;
            cnt[a]++ ;
            cnt[b]-- ;
            mini = min(mini,a) ;
            maxi = max(maxi,b) ;
        }
    }
    vector<int> vec ;
    ll now = 0 , last ;
    bool ck = 0 ;
    for (int i = mini ; i <= maxi ; i++){
        now += cnt[i] ;
        if (((now == 0 && last > 0) || (now > 0 && last == 0)) && i != mini && i != maxi){
            cout << i << " " ;
            ck = 1 ;
        }
        last = now ;
    }
    if (ck == 0)
        cout << "-1" ;
    cout << "\n" ;
}