Submission

Score: 80

User: sulinx

Problemset: ช่องบนไม้

Language: cpp

Time: 0.025 second

Submitted On: 2025-09-25 19:51:48

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

int main(){
    int N,W,L,tmpn,tmp;
    cin >> N >> W >> L;
    int hole[W+1] = {0};
    for(int i = 0;i<N;i++){
        cin >> tmpn;
        for(int j = 0;j<tmpn;j++){
            cin >> tmp;
            for(int k = -L;k<=L;k++){
                if(tmp+k>=0&&tmp+k<=W){
                    hole[tmp+k]++;
                }
            }
        }
    }
    for(int i = 0;i<=W;i++){
        if(hole[i]>=N){
            cout << 1;
            return 0;
        }
    }
    cout << 0;
}