제출 #799510

#제출 시각아이디문제언어결과실행 시간메모리
7995101075508020060209tcUnique Cities (JOI19_ho_t5)C++14
0 / 100
544 ms42384 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC targent("avx,popcnt,sse4,abm") #include <bits/stdc++.h> using namespace std; #define int long long struct SGTR{ int l;int r; int lz; int mn; }tr[800055]; void buildtr(int nw,int l,int r){ tr[nw].l=l;tr[nw].r=r; tr[nw].lz=0; tr[nw].mn=0; if(l==r){return;} int mi=(l+r)/2; buildtr(nw*2,l,mi);buildtr(nw*2+1,mi+1,r); } void psh(int nw){ int v=tr[nw].lz; tr[nw].lz=0; tr[nw*2].lz+=v;tr[nw*2+1].lz+=v; tr[nw*2].mn+=v;tr[nw*2+1].mn+=v; } int qmn(int nw,int l,int r){ if(tr[nw].l>=l&&tr[nw].r<=r){ return tr[nw].mn; } if(tr[nw].l>r||tr[nw].r<l){return 1e9;} psh(nw); return min(qmn(nw*2,l,r),qmn(nw*2+1,l,r)); } void upd(int nw,int l,int r,int v){ if(tr[nw].l>=l&&tr[nw].r<=r){ tr[nw].mn+=v;tr[nw].lz+=v; return; } if(tr[nw].l>r||tr[nw].r<l){return;} psh(nw); upd(nw*2,l,r,v);upd(nw*2+1,l,r,v); tr[nw].mn=min(tr[nw*2].mn,tr[nw*2+1].mn); } int n;int M; vector<int>e[500005]; int D; int rt1;int rt2; int dph[500005]; int dp[500005]; int fa[500005]; void dpdfs(int nw,int pa){ fa[nw]=pa; dph[nw]=dph[pa]+1; dp[nw]=nw; for(int i=0;i<e[nw].size();i++){ int v=e[nw][i]; if(v==pa){continue;} dpdfs(v,nw); if(dph[dp[v]]>dph[nw]){ dp[nw]=dp[v]; } } } void finrt(){ dpdfs(1,0); rt1=dp[1]; //cout<<rt1<<" "; dpdfs(rt1,0); rt2=dp[rt1]; //cout<<rt2<<endl; D=dph[rt2]; } void srtlng(int rt){ dpdfs(rt,0); for(int nw=1;nw<=n;nw++){ for(int i=0;i<e[nw].size();i++){ int v=e[nw][i]; if(v==fa[nw]){continue;} if(e[nw][0]==fa[nw]||dph[dp[v]]>dph[dp[e[nw][0]]]){ swap(e[nw][i],e[nw][0]); } } for(int i=1;i<e[nw].size();i++){ int v=e[nw][i]; if(v==fa[nw]){continue;} if(e[nw][1]==fa[nw]||dph[dp[v]]>dph[dp[e[nw][1]]]){ swap(e[nw][i],e[nw][1]); } } } } int ans[500005]; void dfs(int nw,int pa){ int askr=dph[nw]-1-(dph[dp[nw]]-dph[nw]); if(qmn(1,1,askr)==0){ans[nw]=1;} for(int i=0;i<e[nw].size();i++){ int v=e[nw][i]; if(v==pa){continue;} if(i!=0){ int d=dph[dp[nw]]-dph[nw]; upd(1,dph[nw]-d,dph[nw]-1,1); dfs(v,nw); upd(1,dph[nw]-d,dph[nw]-1,-1); }else{ int d=0; if(e[nw].size()>=2&&e[nw][1]!=pa){ d=dph[dp[e[nw][1]]]-dph[nw]; } upd(1,dph[nw]-d,dph[nw]-1,1); dfs(v,nw); upd(1,dph[nw]-d,dph[nw]-1,-1); } } } void solve(int rt){ dpdfs(rt,0); srtlng(rt); buildtr(1,1,n); dfs(rt,0); } signed main(){ cin>>n>>M; for(int i=1;i<=n-1;i++){ int a;int b; cin>>a>>b; e[a].push_back(b); e[b].push_back(a); } for(int i=1;i<=n;i++){cin>>M;} finrt(); solve(rt1); solve(rt2); //cout<<rt1<<" "<<rt2<<endl; for(int i=1;i<=n;i++){ cout<<ans[i]<<endl; } }

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t5.cpp:2: warning: ignoring '#pragma GCC targent' [-Wunknown-pragmas]
    2 | #pragma GCC targent("avx,popcnt,sse4,abm")
      | 
joi2019_ho_t5.cpp: In function 'void dpdfs(long long int, long long int)':
joi2019_ho_t5.cpp:55:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'void srtlng(long long int)':
joi2019_ho_t5.cpp:78:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp:85:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for(int i=1;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'void dfs(long long int, long long int)':
joi2019_ho_t5.cpp:98:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...