Submission #1882708
Source Code Expand
#include<stdio.h>
int juadge(int a[],int b[],int c[],int n,int m,int t){
int i,j;
if(m>n) return 0;
for(i=0;i<m;i++){
for(j=0;j<n;j++){
if(b[i]>=a[j]&&b[i]<=a[j]+t){
c[i]++;
a[j]=-1000;
break;
}
}
if(c[i]==0) return 0;
}
return 1;
}
int main(void){
int a[200],b[200],c[200];
int t,n,m,i,d;
scanf("%d %d",&t,&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&b[i]);
c[i]=0;
}
d = juadge(a,b,c,n,m,t);
if(d==0) printf("no\n");
else printf("yes\n");
return 0;
}
Submission Info
Submission Time |
|
Task |
C - おいしいたこ焼きの売り方 |
User |
mint |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
631 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
128 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&t,&n);
^
./Main.cpp:25:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[i]);
^
./Main.cpp:26:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&m);
^
./Main.cpp:28:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&b[i]);
^
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt |
Case Name |
Status |
Exec Time |
Memory |
rand0.txt |
AC |
1 ms |
128 KB |
rand1.txt |
AC |
1 ms |
128 KB |
rand10.txt |
AC |
0 ms |
128 KB |
rand11.txt |
AC |
0 ms |
128 KB |
rand12.txt |
AC |
1 ms |
128 KB |
rand13.txt |
AC |
1 ms |
128 KB |
rand14.txt |
AC |
1 ms |
128 KB |
rand15.txt |
AC |
1 ms |
128 KB |
rand16.txt |
AC |
1 ms |
128 KB |
rand17.txt |
AC |
1 ms |
128 KB |
rand18.txt |
AC |
1 ms |
128 KB |
rand19.txt |
AC |
1 ms |
128 KB |
rand2.txt |
AC |
1 ms |
128 KB |
rand20.txt |
AC |
1 ms |
128 KB |
rand21.txt |
AC |
1 ms |
128 KB |
rand22.txt |
AC |
1 ms |
128 KB |
rand23.txt |
AC |
1 ms |
128 KB |
rand24.txt |
AC |
1 ms |
128 KB |
rand25.txt |
AC |
1 ms |
128 KB |
rand26.txt |
AC |
1 ms |
128 KB |
rand27.txt |
AC |
1 ms |
128 KB |
rand28.txt |
AC |
1 ms |
128 KB |
rand29.txt |
AC |
1 ms |
128 KB |
rand3.txt |
AC |
1 ms |
128 KB |
rand4.txt |
AC |
1 ms |
128 KB |
rand5.txt |
AC |
1 ms |
128 KB |
rand6.txt |
AC |
1 ms |
128 KB |
rand7.txt |
AC |
1 ms |
128 KB |
rand8.txt |
AC |
1 ms |
128 KB |
rand9.txt |
AC |
1 ms |
128 KB |
s1.txt |
AC |
1 ms |
128 KB |
s2.txt |
AC |
1 ms |
128 KB |
s3.txt |
AC |
1 ms |
128 KB |
s4.txt |
AC |
1 ms |
128 KB |
s5.txt |
AC |
1 ms |
128 KB |