Submission
Status:
[PP][PP][PPP][P-S][PPP][PPPPP][PPPP-SS][PPPP][PPTS][PPxSS]
Subtask/Task Score:
{10/10}{10/10}{10/10}{0/10}{10/10}{10/10}{0/10}{10/10}{0/10}{0/10}
Score: 60
User: Jokul
Problemset: ช่องบนไม้
Language: c
Time: 1.080 second
Submitted On: 2025-06-14 19:09:59
#include<stdio.h>
int main(){
int n,w,l,k,hole;
scanf("%d %d %d",&n,&w,&l);
int a[w];
for(int i=0;i<w;i++)
{
a[i]=0;
}
for(int i=0;i<n;i++)
{
scanf("%d",&k);
for(int j=0;j<k;j++)
{
scanf("%d",&hole);
for(int d=hole-l;d<=hole+l;d++)
{
a[d]++;
}
}
}
for(int i=0;i<w;i++)
{
if(a[i]==n)
{
printf("1");
return 0;
}
}
printf("0");
}