Submission
Status:
[-S][-S][-SS][P-S][-SS][-SSSS][-SSSSSS][-SSS][-SSS][PPP-S]
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: sulinxishere
Problemset: ช่องบนไม้
Language: c
Time: 0.011 second
Submitted On: 2025-08-06 17:56:23
#include <stdio.h>
int main(){
int n,w,l,k,tmp;
scanf("%d %d %d",&n,&w,&l);
int cl[w],res[w];
for(int i = 0;i<w;i++){
cl[i] = 0;
}
for(int i = 0;i<n;i++){
scanf("%d",&k);
for(int j = 0;j<k;j++){
scanf("%d",&tmp);
cl[tmp] += 1;
}
}
for(int i = 0;i<w;i++){
res[i] = cl[i];
}
for(int i = 0;i<w;i++){
if(cl[i]!=0){
for(int j = 1;j<=l && i+j<w;j++){
res[i+j] = res[i+j] + cl[i];
}
for(int j = 1;j<=l && i-j>=0;j++){
res[i-j] = res[i-j] + cl[i];
}
}
}
for(int i=0;i<w;i++){
if(res[i]>=n){
printf("1");
return 0;
}else{
printf("0");
return 0;
}
}
}