Submission

Score: 100

User: angpangSK

Problemset: วันว่างๆ

Language: cpp

Time: 0.009 second

Submitted On: 2025-11-18 22:04:28

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int arr[1000];
    memset(arr, 0, sizeof(arr));

    int n;
    cin >> n;
    int mx = 0, mn = 1000;

    while (n--) {
        int m;
        cin >> m;
        while (m--) {
            int a, b;
            cin >> a >> b;
            arr[a]++;
            arr[b]--;
            mx = max(mx, b);
            mn = min(mn, a);
        }
    }

    for (int i = 1; i < 1000; i++) arr[i] += arr[i - 1];

    int found = 0;
    for (int i = mn; i < mx; i++) {
        if (arr[i] == 0) {
            int s = i;
            while (i < mx && arr[i] == 0) i++;
            cout << s << ' ' << i << ' ';
            found = 1;
        }
    }

    if (!found) cout << -1;
    return 0;
}