Submission

Status:

[PPPPPPPPPPPPPPPPPPPPPPPPP]

Subtask/Task Score:

{100/100}

Score: 100

User: letdown

Problemset: วันว่างๆ

Language: cpp

Time: 0.012 second

Submitted On: 2026-03-10 16:59:52

#include <bits/stdc++.h>

using namespace std;
const int MXLN = 1000;
int a[MXLN];
int main() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(0);

    int n, maxk = 0;
    cin >> n;
    

    for (int i = 0; i < n; i++) {
        int m;
        cin >> m;
        for (int j = 0; j < m; j++) {
            int i1, i2;
            cin >> i1 >> i2;
            if (i2 > maxk) maxk = i2;

            for (int k = i1; k < i2; k++) {
                a[k] = 1;
            }
        }
    }

    for (int i = maxk; i < MXLN; i++) {
        a[i] = 1;
    }
    

    int mn, mx;
    for (int i = 0; i < MXLN; i ++) {
        if (!a[i]) {
            mn = i;
            for (int j = i; j < MXLN; j++) {
                mx = j;
                if (a[j]) {
                    i = j;
                    break;
                }
            }
            if (mn != 0) cout << mn << " " << mx << " ";
        }
    }
    if (!mn) cout << -1;
}