結果
問題 | No.1424 Ultrapalindrome |
ユーザー |
![]() |
提出日時 | 2021-03-12 22:13:01 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 1,000 bytes |
コンパイル時間 | 1,126 ms |
コンパイル使用メモリ | 32,604 KB |
実行使用メモリ | 9,348 KB |
最終ジャッジ日時 | 2024-10-14 16:17:54 |
合計ジャッジ時間 | 1,849 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
コンパイルメッセージ
main.c:8:1: warning: data definition has no type or storage class 8 | en[MAXN+1]; | ^~ main.c:8:1: warning: type defaults to 'int' in declaration of 'en' [-Wimplicit-int] main.c:9:1: warning: data definition has no type or storage class 9 | ei[MAXN+1]; | ^~ main.c:9:1: warning: type defaults to 'int' in declaration of 'ei' [-Wimplicit-int] main.c:10:1: warning: data definition has no type or storage class 10 | eb[MAXN<<1]; | ^~ main.c:10:1: warning: type defaults to 'int' in declaration of 'eb' [-Wimplicit-int] main.c:11:1: warning: data definition has no type or storage class 11 | uv[MAXN<<1]; | ^~ main.c:11:1: warning: type defaults to 'int' in declaration of 'uv' [-Wimplicit-int] main.c:13:1: warning: data definition has no type or storage class 13 | c[100000]; | ^ main.c:13:1: warning: type defaults to 'int' in declaration of 'c' [-Wimplicit-int] main.c:25:1: warning: return type defaults to 'int' [-Wimplicit-int] 25 | main(){ | ^~~~ main.c: In function 'main': main.c:61:41: warning: implicit declaration of function 'write' [-Wimplicit-function-declaration] 61 | write(1,"No",2); | ^~~~~ main.c:62:41: warning: implicit declaration of function '_exit'; did you mean '_Exit'? [-Wimplicit-function-declaration] 62 | _exit(0); | ^~~~~ | _Exit
ソースコード
#pragma GCC optimize("Ofast") #pragma GCC target("avx2") char*mmap(); #define RD(v) int v=0;{int _c;while(_c=*rp++-48,_c>=0)v=v*10+_c;} #define MAXN 200000 en[MAXN+1]; ei[MAXN+1]; eb[MAXN<<1]; uv[MAXN<<1]; c[100000]; void f(int i,int p,int d){ c[i]=d; for(int k=0;k<en[i];++k){ int j=eb[ei[i]+k]; if(j!=p){ f(j,i,d+1); } } } main(){ char*rp=mmap(0l,1l<<28,1,2,0,0ll); RD(n); { int ne=n-1<<1; for(int j=0;j<ne;++j){ RD(t); uv[j]=t; ++en[uv[j]]; } } { int s=0; for(int i=0;++i<=n;){ ei[i]=s; s+=en[i]; en[i]=0; } } { int ne=n-1<<1; for(int j=0;j<ne;++j){ int i=uv[j]; eb[ei[i]+en[i]++]=uv[j^1]; } } int r=1; while(en[r]!=1)++r; f(r,r,0); int e=0; for(int i=r+1;i<=n;++i){ if(en[i]==1){ if(e==0){ e=c[i]; }else{ if(c[i]!=e){ write(1,"No",2); _exit(0); } } } } for(int i=0;i<n;++i){ if(en[i]>2){ if(c[i]*2!=e){ write(1,"No",2); _exit(0); } } } write(1,"Yes",3); _exit(0); }