Submission

Status:

[PPPPPPPPPPPPPPPPPPPPPPPPP]

Subtask/Task Score:

{100/100}

Score: 100

User: mantaggez

Problemset: วันว่างๆ

Language: cpp

Time: 0.010 second

Submitted On: 2026-03-20 22:05:22

#include <bits/stdc++.h>

using namespace std;

const int nx = 1e3+5;

int n, m, mx = 0, mn = 1e9;
int sl[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n;
    for(int i=0;i<n;i++) {
        cin >> m;
        for(int j=0;j<m;j++) {
            int s, e;
            cin >> s >> e;
            mx = max(mx, e);
            mn = min(mn, s);
            sl[s]++;
            sl[e]--;
        }
    }

    vector<int> ans;
    for(int i=1;i<nx;i++) sl[i] += sl[i - 1];

    bool start = false;
    int idx = 0;
    for(int i=mn;i<mx;i++) {
        if(sl[i] == 0 && !start) {
            idx = i;
            start = true;
            // cout << i << ' ';
        }

        if(sl[i] > 0 && start) {
            ans.push_back(idx);
            ans.push_back(i);
            start = false;
        }
        // cout << sl[i] << ' ';
    }

    if(ans.empty()) cout << -1 << '\n';
    else {
        for(int a : ans) {
            cout << a << ' ';
        }
    }

    return 0;
}