Submission

Status:

[PPPPPPPPPPPPPPPPPPPPPPPPP]

Score: 100

User: achinhchin

Problemset: วันว่างๆ

Language: cpp

Time: 0.012 second

Submitted On: 2025-04-01 19:38:41

#include<bits/stdc++.h>
#include<iostream>
using namespace std;
typedef long long l;
l A[1001],n,m,a,b,i,t,mn=1001,mx,c;
bool e;
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cin>>n; while(n--) {
    cin>>m;while(m--)cin>>a>>b,A[a]++,A[b]--,mn=min(mn,a),mx=max(mx,b);
  }for(i=1;i<mx;i++)A[i]+=A[i-1];
  for(i=mn;i<mx;i++){if(!A[i]){
      e=1,t=i; while(i<mx&&!A[i++]);
      cout<<t<<' '<<--i<<' ';
    }
  }if(!e)cout<<-1;
}