한 조건까지 놓쳐도 되는 범위

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> interval(vector<vector<int>> rules, int limit, int skip) {
    int low = 1, high = limit;
    for (int i = 0; i < (int)rules.size(); ++i) {
        if (i == skip) continue;
        if (rules[i][0] == 0) low = max(low, /*@blank1@*/);
        else high = min(high, /*@blank2@*/);
    }
    return {low, high};
}
int solution(int limit, vector<vector<int>> rules) {
    vector<int> seen(limit + 1, 0);
    int count = 0;
    for (int skip = -1; skip < (int)rules.size(); ++skip) {
        vector<int> range = interval(rules, limit, skip);
        for (int value = range[0]; value <= range[1]; ++value) {
            if (!seen[value]) {
                seen[value] = 1;
                ++count;
            }
        }
    }
    return count;
}
int main() {
    int limit, n; cin >> limit >> n;
    vector<vector<int>> rules(n, vector<int>(2));
    for (int i = 0; i < n; ++i) cin >> rules[i][0] >> rules[i][1];
    cout << solution(limit, rules) << '\n';
}