結果
問題 | No.561 東京と京都 |
ユーザー | 👑 testestest |
提出日時 | 2017-08-25 23:15:52 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 235 bytes |
コンパイル時間 | 202 ms |
コンパイル使用メモリ | 28,800 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 16:34:00 |
合計ジャッジ時間 | 798 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 17 |
コンパイルメッセージ
main.c:2:1: warning: data definition has no type or storage class 2 | t[110],k[110]; | ^ main.c:2:1: warning: type defaults to 'int' in declaration of 't' [-Wimplicit-int] main.c:2:8: warning: type defaults to 'int' in declaration of 'k' [-Wimplicit-int] 2 | t[110],k[110]; | ^ main.c:3:1: warning: data definition has no type or storage class 3 | n,d; | ^ main.c:3:1: warning: type defaults to 'int' in declaration of 'n' [-Wimplicit-int] main.c:3:3: warning: type defaults to 'int' in declaration of 'd' [-Wimplicit-int] 3 | n,d; | ^ main.c:4:1: warning: return type defaults to 'int' [-Wimplicit-int] 4 | main(){ | ^~~~ main.c: In function 'main': main.c:5:9: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration] 5 | scanf("%d%d",&n,&d); | ^~~~~ main.c:1:1: note: include '<stdio.h>' or provide a declaration of 'scanf' +++ |+#include <stdio.h> 1 | #define max(p,q)(p>q?p:q) main.c:5:9: warning: incompatible implicit declaration of built-in function 'scanf' [-Wbuiltin-declaration-mismatch] 5 | scanf("%d%d",&n,&d); | ^~~~~ main.c:5:9: note: include '<stdio.h>' or provide a declaration of 'scanf' main.c:11:9: warning: implicit declaration of function 'printf' [-Wimplicit-function-declaration] 11 | printf("%d",*t); | ^~~~~~ main.c:11:9: note: include '<stdio.h>' or provide a declaration of 'printf' main.c:11:9: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch] main.c:11:9: note: include '<stdio.h>' or provide a declaration of 'printf'
ソースコード
#define max(p,q)(p>q?p:q) t[110],k[110]; n,d; main(){ scanf("%d%d",&n,&d); for(int i=1;i<=n;i++)scanf("%d%d",t+i,k+i); for(int i=n;i>=0;i--){ t[i]=max(t[i+1],k[i+1]-d)+t[i]; k[i]=max(k[i+1],t[i+1]-d)+k[i]; } printf("%d",*t); }