結果
問題 |
No.482 あなたの名は
|
ユーザー |
|
提出日時 | 2017-02-13 01:06:49 |
言語 | C90 (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 29 ms / 2,000 ms |
コード長 | 216 bytes |
コンパイル時間 | 784 ms |
コンパイル使用メモリ | 19,840 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-29 20:39:03 |
合計ジャッジ時間 | 2,053 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
コンパイルメッセージ
main.c:1:8: warning: data definition has no type or storage class 1 | long k;c,n,d[1<<18],u[1<<18]; | ^ main.c:1:8: warning: type defaults to ‘int’ in declaration of ‘c’ [-Wimplicit-int] main.c:1:10: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] 1 | long k;c,n,d[1<<18],u[1<<18]; | ^ main.c:1:12: warning: type defaults to ‘int’ in declaration of ‘d’ [-Wimplicit-int] 1 | long k;c,n,d[1<<18],u[1<<18]; | ^ main.c:1:21: warning: type defaults to ‘int’ in declaration of ‘u’ [-Wimplicit-int] 1 | long k;c,n,d[1<<18],u[1<<18]; | ^ main.c:6:1: warning: return type defaults to ‘int’ [-Wimplicit-int] 6 | main(i) | ^~~~ main.c: In function ‘main’: main.c:6:1: warning: type of ‘i’ defaults to ‘int’ [-Wimplicit-int] main.c:8:13: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 8 | for(scanf("%d%ld",&n,&k);~scanf("%d",d+i++);); | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | long k;c,n,d[1<<18],u[1<<18]; main.c:8:13: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 8 | for(scanf("%d%ld",&n,&k);~scanf("%d",d+i++);); | ^~~~~ main.c:8:13: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ main.c:10:16: warning: implicit declaration of function ‘puts’ [-Wimplicit-function-declaration] 10 | return!puts(k<0||k%2?"NO":"YES"); | ^~~~ main.c:10:16: note: include ‘<stdio.h>’ or provide a declaration of ‘puts’
ソースコード
long k;c,n,d[1<<18],u[1<<18]; int dfs(int v) { u[v]?k-=c-1:(u[v]=1,c++,dfs(d[v])); } main(i) { for(scanf("%d%ld",&n,&k);~scanf("%d",d+i++);); for(i=0;i++<n;)!u[i]&&(c=0,dfs(i)); return!puts(k<0||k%2?"NO":"YES"); }