Submission

Status:

[PP][PP][PPP][P-S][PPP][PPPPP][PPPP-SS][PPPP][PPPP][PPPPP]

Subtask/Task Score:

{10/10}{10/10}{10/10}{0/10}{10/10}{10/10}{0/10}{10/10}{10/10}{10/10}

Score: 80

User: sulinx

Problemset: ช่องบนไม้

Language: cpp

Time: 0.031 second

Submitted On: 2025-09-25 18:47:19

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

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