Submission

Score: 100

User: Phat12

Problemset: วันว่างๆ

Language: cpp

Time: 0.010 second

Submitted On: 2025-11-06 07:25:19

/*
TASK: c2_st66_freeday.cpp
LANG: C++
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
using namespace std;
const int N = 1100;
int arr[N];
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int mx = 0;
    int mn = 1111;
    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<N;i++) arr[i]+=arr[i-1];
    bool flag=0;
    for (int i=mn;i<mx;i++){
        if (arr[i]==0) {
            cout << i << ' ';
            while (i < mx && arr[i]==0) i++;
            cout << i << ' ';
            flag=1;
        }
    }
    if (!flag) cout << -1;
    return 0;
}