Submission #2203548
Source Code Expand
#include <cstdio> #include <algorithm> using namespace std; int main(){ int T,N,M; bool ans = true; scanf("%d%*c%d%*c",&T,&N); int A[N]; for(int i=0;i<N;i++)scanf(" %d",A+i); scanf(" %d\n",&M); int B[M]; for(int i=0;i<M;i++)scanf(" %d",B+i); if(N<M){ ans = false; }else{ int k=0; while(k<M){ if(B[k]-A[k]<0){ ans = false; break; } else{ int j = 0; while(B[k]-A[k+j]>T && k+j<N){ j++; if(k+j>=N){ ans=false; break; } } k += j; } k++; } } ans ? printf("yes\n") : printf("no\n"); }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | xecua |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 866 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:8:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%*c%d%*c",&T,&N); ^ ./Main.cpp:10:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0;i<N;i++)scanf(" %d",A+i); ^ ./Main.cpp:11:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf(" %d\n",&M); ^ ./Main.cpp:13:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0;i<M;i++)scanf(" %d",B+i); ^
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | 1 ms | 128 KB |
rand11.txt | AC | 1 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 | WA | 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 |