結果

問題 No.364 門松木
ユーザー LayCurseLayCurse
提出日時 2016-04-18 00:45:41
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 102 ms / 3,000 ms
コード長 3,812 bytes
コンパイル時間 1,217 ms
コンパイル使用メモリ 161,164 KB
実行使用メモリ 9,800 KB
最終ジャッジ日時 2024-04-15 03:06:08
合計ジャッジ時間 4,349 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 77 ms
6,940 KB
testcase_09 AC 76 ms
6,944 KB
testcase_10 AC 68 ms
6,940 KB
testcase_11 AC 87 ms
6,940 KB
testcase_12 AC 60 ms
6,940 KB
testcase_13 AC 98 ms
6,940 KB
testcase_14 AC 97 ms
6,944 KB
testcase_15 AC 75 ms
6,944 KB
testcase_16 AC 102 ms
6,944 KB
testcase_17 AC 78 ms
6,940 KB
testcase_18 AC 78 ms
6,940 KB
testcase_19 AC 86 ms
6,944 KB
testcase_20 AC 76 ms
6,948 KB
testcase_21 AC 77 ms
6,944 KB
testcase_22 AC 55 ms
6,940 KB
testcase_23 AC 81 ms
7,108 KB
testcase_24 AC 80 ms
7,748 KB
testcase_25 AC 82 ms
8,644 KB
testcase_26 AC 91 ms
6,940 KB
testcase_27 AC 90 ms
6,940 KB
testcase_28 AC 91 ms
6,940 KB
testcase_29 AC 79 ms
6,948 KB
testcase_30 AC 80 ms
7,108 KB
testcase_31 AC 1 ms
6,940 KB
testcase_32 AC 2 ms
6,940 KB
testcase_33 AC 80 ms
9,800 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[77000000]; void *mem = memarr;
#define MD 1000000007

void* readUndirectedGraph(int N, int M, int **es, int ***edge, void *mem, int origin=0){int i,*A;A=((int*)(((int**)mem)+N)+N+2*M);rep(i,2*M)reader(A+i),A[i]-=origin;*es=(int*)mem;*edge=(int**)((*es)+N);memset(*es,0,sizeof(int)*N);rep(i,2*M)(*es)[A[i]]++;(*edge)[0]=(int*)((*edge)+N);REP(i,1,N)(*edge)[i]=(*edge)[i-1]+(*es)[i-1];memset(*es,0,sizeof(int)*N);for(i=0;i<2*M;i+=2)(*edge)[A[i]][(*es)[A[i]]++]=A[i+1],(*edge)[A[i+1]][(*es)[A[i+1]]++]=A[i];return A;}

int N, A[100000];
int *es, **edge;

/// use          both
int dp1[100000], dp2[100000];

int arr[1000], val[1000], sz;

void solve(int n, int b){
  int i, j, k;
  int tmp;
  dp1[n] = -MD;

  rep(i,es[n]){
    k = edge[n][i];
    if(k==b) continue;
    solve(k, n);
  }

  rep(i,1000) arr[i] = -1;
  sz = 0;

  rep(i,es[n]){
    k = edge[n][i];
    if(k==b) continue;
    arr[A[k]] = max(arr[A[k]], dp1[k]);
    dp2[n] = max(dp2[n], dp2[k]);
  }

  tmp = 0; k = 0;
  rep(i,A[n]) if(arr[i]>=0) tmp += arr[i] + k, k++;
  dp2[n] = max(dp2[n], tmp);

  tmp = 0; k = 0;
  REP(i,A[n]+1,1000) if(arr[i]>=0) tmp += arr[i] + k, k++;
  dp2[n] = max(dp2[n], tmp);

  if(b >= 0){
    arr[A[b]] = 0;
    if(A[b] < A[n]){
      tmp = 0; k = 0;
      rep(i,A[n]) if(arr[i] >= 0) tmp += arr[i] + k, k++;
      dp1[n] = max(dp1[n], tmp);
    }
    if(A[b] > A[n]){
      tmp = 0; k = 0;
      REP(i,A[n]+1,1000) if(arr[i] >= 0) tmp += arr[i] + k, k++;
      dp1[n] = max(dp1[n], tmp);
    }
  }

  dp2[n] = max(dp1[n], dp2[n]);

//  printf("%d %d %d\n",n,dp1[n],dp2[n]);
}

int main(){
  int i, j, k;

  reader(&N);
  rep(i,N) reader(A+i), A[i]--;
  mem = readUndirectedGraph(N, N-1, &es, &edge, mem, 1);

  solve(0, -1);
  writerLn(dp2[0]);

  return 0;
}
0