Submission

Status:

[P-][P-][P-S][-SS][P-S][TSSSS][P-SSSSS][TSSS][TSSS][TSSSS]

Subtask/Task Score:

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

Score: 0

User: sulinx

Problemset: ช่องบนไม้

Language: cpp

Time: 1.089 second

Submitted On: 2025-09-25 19:28:38

#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;
        int mark[W+1] = {0};
        for (int j = 0; j < tmpn; j++) {
            cin >> tmp;
            for (int k = -L; k <= L; k++) {
                int pos = tmp + k;
                if (pos >= 1 && pos <= W) {
                    mark[pos] = 1;
                }
            }
        
        for (int x = 1; x <= W; x++) {
            if (mark[x]) hole[x]++;
        }
    }
    }
    for(int i = 0;i<W+L+L;i++){
        if(hole[i]==N){
            cout << 1;
            return 0;
        }
    }
    cout << 0;
}