結果
問題 | No.190 Dry Wet Moist |
ユーザー | 👑 testestest |
提出日時 | 2016-07-31 20:47:31 |
言語 | C90 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 52 ms / 2,000 ms |
コード長 | 229 bytes |
コンパイル時間 | 278 ms |
コンパイル使用メモリ | 20,864 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-06 21:36:03 |
合計ジャッジ時間 | 2,904 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 0 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 0 ms
5,248 KB |
testcase_04 | AC | 0 ms
5,248 KB |
testcase_05 | AC | 0 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | AC | 1 ms
5,248 KB |
testcase_10 | AC | 1 ms
5,248 KB |
testcase_11 | AC | 1 ms
5,248 KB |
testcase_12 | AC | 26 ms
5,248 KB |
testcase_13 | AC | 33 ms
5,248 KB |
testcase_14 | AC | 25 ms
5,248 KB |
testcase_15 | AC | 36 ms
5,248 KB |
testcase_16 | AC | 46 ms
5,248 KB |
testcase_17 | AC | 6 ms
5,248 KB |
testcase_18 | AC | 21 ms
5,248 KB |
testcase_19 | AC | 45 ms
5,248 KB |
testcase_20 | AC | 31 ms
5,248 KB |
testcase_21 | AC | 4 ms
5,248 KB |
testcase_22 | AC | 51 ms
5,248 KB |
testcase_23 | AC | 52 ms
5,248 KB |
testcase_24 | AC | 51 ms
5,248 KB |
testcase_25 | AC | 0 ms
5,248 KB |
testcase_26 | AC | 1 ms
5,248 KB |
testcase_27 | AC | 33 ms
5,248 KB |
testcase_28 | AC | 15 ms
5,248 KB |
testcase_29 | AC | 19 ms
5,248 KB |
コンパイルメッセージ
main.c:2:1: warning: data definition has no type or storage class 2 | a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)} | ^ main.c:2:1: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int] main.c:2:10: warning: type defaults to ‘int’ in declaration of ‘s’ [-Wimplicit-int] 2 | a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)} | ^ main.c:2:12: warning: type defaults to ‘int’ in declaration of ‘r’ [-Wimplicit-int] 2 | a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)} | ^ main.c:2:14: warning: type defaults to ‘int’ in declaration of ‘x’ [-Wimplicit-int] 2 | a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)} | ^ main.c:2:16: warning: return type defaults to ‘int’ [-Wimplicit-int] 2 | a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)} | ^ main.c:2:40: warning: return type defaults to ‘int’ [-Wimplicit-int] 2 | a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)} | ^~~~ main.c: In function ‘main’: main.c:2:40: warning: type of ‘n’ defaults to ‘int’ [-Wimplicit-int] main.c:2:40: warning: type of ‘l’ defaults to ‘int’ [-Wimplicit-int] main.c:2:56: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 2 | a[1<
ソースコード
#define f(P,Q,R)for(l=0,r=~n;l<r;P)x=a[l]Q-a[r]?s++,R:0;s=!printf("%d ",s); a[1<<18],s,r,x;c(int*p,int*q){r=*p-*q;}main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,c);f(r--,<,l++)f(l++,>,r--)f((a[l]+a[r]<=0?l++,r-=x:r--),==,1)}