Submission
Status:
[PPPPPPPPPPPPPPPPPPPPPPPPP]
Subtask/Task Score:
{100/100}
Score: 100
User: 38408
Problemset: วันว่างๆ
Language: cpp
Time: 0.043 second
Submitted On: 2026-10-15 22:34:25
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> num;
vector<int> ma;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int b, a;
cin >> b >> a;
for (int p = b; p < a; p++) {
num.insert(p);
}
ma.push_back(b);
ma.push_back(a);
}
}
int maxx = *max_element(ma.begin(), ma.end());
int minn = *min_element(ma.begin(), ma.end());
int m = 0;
int start = -1;
for (int i = minn; i <= maxx; i++) {
if (!num.count(i)) {
if (start == -1) {
start = i;
}
} else {
if (start != -1) {
cout << start << " " << i << " ";
m++;
start = -1;
}
}
}
if (m == 0) {
cout << -1;
}
return 0;
}