제출 #124283

#제출 시각아이디문제언어결과실행 시간메모리
124283dualityUnique Cities (JOI19_ho_t5)C++11
4 / 100
2065 ms43364 KiB
#define DEBUG 0 #include <bits/stdc++.h> using namespace std; #if DEBUG // basic debugging macros int __i__,__j__; #define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl #define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl #define printVar(n) cout<<#n<<": "<<n<<endl #define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl #define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;} #define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;} // advanced debugging class // debug 1,2,'A',"test"; class _Debug { public: template<typename T> _Debug& operator,(T val) { cout << val << endl; return *this; } }; #define debug _Debug(), #else #define printLine(l) #define printLine2(l,c) #define printVar(n) #define printArr(a,l) #define print2dArr(a,r,c) #define print2dArr2(a,r,c,l) #define debug #endif // define #define MAX_VAL 999999999 #define MAX_VAL_2 999999999999999999LL #define EPS 1e-6 #define mp make_pair #define pb push_back // typedef typedef unsigned int UI; typedef long long int LLI; typedef unsigned long long int ULLI; typedef unsigned short int US; typedef pair<int,int> pii; typedef pair<LLI,LLI> plli; typedef vector<int> vi; typedef vector<LLI> vlli; typedef vector<pii> vpii; typedef vector<plli> vplli; // ---------- END OF TEMPLATE ---------- vi adjList[200000]; int C[200000]; int parent[200000][18],height[200000],node[200000]; int depth[200000],disc[200000],fin[200000],inv[200000],num = 0; int doDFS(int u,int p,int d) { int i; parent[u][0] = p,height[u] = 0,node[u] = u; depth[u] = d,disc[u] = num++,inv[num-1] = u; for (i = 0; i < adjList[u].size(); i++) { int v = adjList[u][i]; if (v != p) { doDFS(v,u,d+1); if (height[v]+1 > height[u]) { height[u] = height[v]+1,node[u] = node[v]; if (!(height[u] & 1)) node[u] = parent[node[u]][0]; } } } fin[u] = num; return 0; } int logn; int moveToward(int u,int v) { if (u == -1) return 0; if ((disc[v] >= disc[u]) && (disc[v] < fin[u])) { int i; for (i = logn-1; i >= 0; i--) { if ((parent[v][i] != -1) && (depth[parent[v][i]] > depth[u])) v = parent[v][i]; } return v; } else return parent[u][0]; } int height2[200000],node2[200000]; int doDFS2(int u,int p) { int i; int m1 = height2[u],m2 = height2[u],p1 = u,p2 = u; for (i = 0; i < adjList[u].size(); i++) { int v = adjList[u][i]; if (v != p) { if (height[v]+1 >= m1) m2 = m1,p2 = p1,m1 = height[v]+1,p1 = v; else if (height[v]+1 >= m2) m2 = height[v]+1,p2 = v; } } for (i = 0; i < adjList[u].size(); i++) { int v = adjList[u][i]; if (v != p) { if (v == p1) height2[v] = m2+1,node2[v] = (p2 == u) ? node2[p2]:node[p2]; else height2[v] = m1+1,node2[v] = (p1 == u) ? node2[p1]:node[p1]; if (height2[v] & 1) node2[v] = moveToward(node2[v],v); doDFS2(v,u); } } return 0; } vpii cand; int dd = 0,mm = 0; int doDFS3(int u,int p,int d,int x) { int i; if (u != x) mm = max(mm,d); else { dd = d; return 0; } for (i = 0; i < adjList[u].size(); i++) { int v = adjList[u][i]; if (v != p) doDFS3(v,u,d+1,x); } return 0; } int c[200000],n = 0; vi tree[1 << 19]; int ans[200000]; int update(int s,int e,int as,int ae,int i,int num) { if ((s > ae) || (e < as)) return 0; else if ((s >= as) && (e <= ae)) { tree[i].pb(num); return 0; } int mid = (s+e) / 2; update(s,mid,as,ae,2*i+1,num),update(mid+1,e,as,ae,2*i+2,num); return 0; } int process(int s,int e,int i) { if (s == e) { int j; for (j = 0; j < tree[i].size(); j++) { if (c[tree[i][j]] == 0) n++; c[tree[i][j]]++; } ans[inv[s]] = n; for (j = 0; j < tree[i].size(); j++) { if (c[tree[i][j]] == 1) n--; c[tree[i][j]]--; } return 0; } int j,mid = (s+e) / 2; for (j = 0; j < tree[i].size(); j++) { if (c[tree[i][j]] == 0) n++; c[tree[i][j]]++; } process(s,mid,2*i+1),process(mid+1,e,2*i+2); for (j = 0; j < tree[i].size(); j++) { if (c[tree[i][j]] == 1) n--; c[tree[i][j]]--; } return 0; } int main() { int i; int N,M,A,B; scanf("%d %d",&N,&M); for (i = 0; i < N-1; i++) { scanf("%d %d",&A,&B); A--,B--; adjList[A].pb(B); adjList[B].pb(A); } for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--; int j; doDFS(0,-1,0); for (i = 1; (1 << i) < N; i++) { for (j = 0; j < N; j++) { if (parent[j][i-1] != -1) parent[j][i] = parent[parent[j][i-1]][i-1]; else parent[j][i] = -1; } } logn = i; height2[0] = 0,node2[0] = -1; doDFS2(0,-1); for (i = 1; i < N; i++) { cand.pb(mp(parent[i][0],node[i])); cand.pb(mp(i,node2[i])); } for (i = 0; i < cand.size(); i++) { dd = mm = 0; doDFS3(cand[i].second,-1,0,cand[i].first); if (mm < dd) { int u = cand[i].first,v = cand[i].second; if ((disc[u] >= disc[v]) && (disc[u] < fin[v])) { v = moveToward(v,u); update(0,N-1,fin[v],N-1,0,C[u]),update(0,N-1,0,disc[v]-1,0,C[u]); } else update(0,N-1,disc[v],fin[v]-1,0,C[u]); } } process(0,N-1,0); for (i = 0; i < N; i++) printf("%d\n",ans[i]); printArr(node,N); printArr(node2,N); printArr(height,N); printArr(height2,N); return 0; }

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

joi2019_ho_t5.cpp: In function 'int doDFS(int, int, int)':
joi2019_ho_t5.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int doDFS2(int, int)':
joi2019_ho_t5.cpp:95:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:102:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int doDFS3(int, int, int, int)':
joi2019_ho_t5.cpp:122:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int process(int, int, int)':
joi2019_ho_t5.cpp:145:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:150:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:158:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (j = 0; j < tree[i].size(); j++) {
                 ~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:163:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (j = 0; j < tree[i].size(); j++) {
                 ~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:196:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < cand.size(); i++) {
                 ~~^~~~~~~~~~~~~
joi2019_ho_t5.cpp:172:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:174:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&A,&B);
         ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:179:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&C[i]),C[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...