Submission
Status:
[PPPPPPPPPPPPPPPPPPPPPPPPP]
Subtask/Task Score:
{100/100}
Score: 100
User: njoop
Problemset: วันว่างๆ
Language: cpp
Time: 0.009 second
Submitted On: 2025-11-01 23:20:58
#include <bits/stdc++.h>
using namespace std;
int sw[1002], arr[1002], cnt, s, e, n, m, st;
vector<pair<int, int>> ans;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i=1; i<=n; i++) {
cin >> m;
while(m--) {
cin >> s >> e;
sw[s]++;
sw[e]--;
}
}
for(int i=0; i<=1001; i++) {
cnt += sw[i];
if(st == 0 && cnt == 0) {
s = i;
st = 1;
} else if(st == 1 && cnt != 0) {
e = i;
st = 0;
ans.push_back({s, e});
}
}
int sz = 0;
for(int i=1; i<ans.size(); i++) {
if(ans[i].first == 0 || ans[i].second == 1001) continue;
cout << ans[i].first << " " << ans[i].second << " ";
sz++;
}
if(sz == 0) cout << -1;
return 0;
}