Submission

Score: 80

User: sulinx

Problemset: ช่องบนไม้

Language: cpp

Time: 0.014 second

Submitted On: 2025-09-25 18:01:13

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, W, L;
    cin >> N >> W >> L;

   int hole[W+2] = {0};

    for (int i = 0; i < N; i++) {
        int tmpn;
        cin >> tmpn;
        for (int j = 0; j < tmpn; j++) {
            int tmp;
            cin >> tmp;
            int left = max(1, tmp - L);
            int right = min(W, tmp + L);
            for (int pos = left; pos <= right; pos++) {
                hole[pos]++;
            }
        }
    }

    for (int i = 1; i <= W; i++) {
        if (hole[i] == N) {
            cout << 1;
            return 0;
        }
    }

    cout << 0;
}