Submission

Status:

[P-SSSSSSSSSSSSSSSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: krittaphot

Problemset: วันว่างๆ

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-05 18:44:39

#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n;
	cin >> n;
	int last = -1;
	vector<pair<int,int>> timeline;
	for(int i = 0;i<n;i++){
		int m;
		cin >> m;
		for(int j = 0;j<m;j++){
			int a,b;
			cin >> a >> b;
			timeline.push_back({a,1});
			timeline.push_back({b,-1});
			last = max(last,b);
		}
	}
	
	sort(timeline.begin(),timeline.end());
	int sum = 0;
	int prev;
	vector<int> ans;
	for(int i = 0;i<timeline.size();i++){
		if(i != 0 && sum == 0){
			int cur = timeline[i].first;
			for(int idx = prev+1;idx<=cur;idx++){
				ans.push_back(idx);
			}
		}
		sum += timeline[i].second;
		if(sum == 0 && timeline[i].first != last){
			ans.push_back(timeline[i].first);
			prev = timeline[i].first;
		}
		
	}
	if(ans.size() == 0){
		cout << -1;
	}
	else
		for(int x : ans){
			cout << x << " ";
		}
	
	
}