Submission

Status:

[PPP-SSSSSSSSSSSSSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: konthaina_TH

Problemset: วันว่างๆ

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-05 21:43:31

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
    ll n;
    cin >> n;
    vector<ll>frien(n);
    ll high = 0;
    ll low = INT_MAX;
    vector<int>cnt(1001,0);
    vector<int>border(1001,0);
    for (ll i=0;i<n;i++) {
        cin >> frien[i];
        for (ll k=0;k<frien[i];k++) {
            ll x,y;
            cin >> x >> y;
            border[x]++;
            border[y]++;
            for (ll j=x+1;j<y;j++) {
                cnt[j]++;
            }
            if (x < low) low = x;
            if (y > high) high = y;
        }
    }
    ll co = 0;
    for (ll i = low ;i<=high;i++) {
        if (cnt[i] == 0) {
            if (i == low or i == high) continue;
            else if (border[i-1] > 0 and border[i] == 0) continue;
            else if (border[i+1] > 0 and border[i] == 0) continue;
            else {
                cout << i << ' ';
                co++;
            }
        }
    }
    if(co == 0) cout << "-1";
}