제출 #1137439

#제출 시각아이디문제언어결과실행 시간메모리
1137439icoder178Harbingers (CEOI09_harbingers)C++17
0 / 100
132 ms131072 KiB
#include<iostream> #include<algorithm> using namespace std; #define int long long const int maxv = (int) 4e18; const int maxn = 100005; int n,dst[maxn],dp[maxn],rmv[maxn],s[maxn],v[maxn],connl[maxn],connr[maxn],ncnt = 0,rcnt = 0,chcnt = 0; pair<int,int> nconn[maxn],rmvd[maxn],cht[maxn]; pair<int,pair<int,int> > conn[maxn*2]; inline void fdp(int pos) { int l = -5, r = chcnt+5; while(l+1 < r) { int mid = (l+r)/2; bool isDecr; if(mid < 0) isDecr = true; else if(mid >= chcnt-1) isDecr = false; else { int vl1 = cht[mid].second-v[pos]*cht[mid].first; int vl2 = cht[mid+1].second-v[pos]*cht[mid+1].first; isDecr = (vl2 < vl1); } if(isDecr == true) l = mid; else r = mid; } dp[pos] = cht[r].second-v[pos]*cht[r].first+v[pos]*dst[pos]+s[pos]; } inline void prmv(int pos) { int l = -5, r = chcnt+5; while(l+1 < r) { int mid = (l+r)/2; bool isV; if(mid < 0) isV = true; else if(mid >= (chcnt-1)) isV = false; else { __int128_t x1 = cht[mid].first; __int128_t y1 = cht[mid].second; __int128_t x2 = cht[mid+1].first; __int128_t y2 = cht[mid+1].second; __int128_t x3 = dst[pos]; __int128_t y3 = dp[pos]; __int128_t v1 = (y3-y2)*(x2-x1); __int128_t v2 = (y2-y1)*(x3-x2); isV = (v1 > v2); } if(isV) l = mid; else r = mid; } rmv[pos] = r+1; } void dfs(int pos, int prevP) { for(int i = connl[pos]; i < connr[pos]; i++) { dfs(conn[i].first,pos); } // int ncl = ncnt; // for(int i = connl[pos]; i < connr[pos]; i++) { // int targP = conn[i].second.first; // int newV = conn[i].second.second; // if(targP != prevP) { // dst[targP] = dst[pos]+newV; // fdp(targP); // prmv(targP); // nconn[ncnt].first = rmv[targP]; // nconn[ncnt].second = targP; // ncnt++; // } // } // int ncr = ncnt; // sort(nconn+ncl,nconn+ncr); // int rcl = rcnt; // for(int i = ncr-1; i >= ncl; i--) { // while(chcnt > nconn[i].first) { // rmvd[rcnt] = cht[chcnt-1]; // rcnt++; // chcnt--; // } // int targP = nconn[i].second; // cht[chcnt].first = dst[targP]; // cht[chcnt].second = dp[targP]; // chcnt++; // dfs(targP,pos); // chcnt--; // } // ncnt = ncl; // int rcr = rcnt; // for(int i = rcr-1; i >= rcl; i--) { // cht[chcnt] = rmvd[i]; // chcnt++; // } // rcnt = rcl; } signed main () { scanf("%lld",&n); for(int i = 0; i < n-1; i++) { int a,b,c; scanf("%lld%lld%lld",&conn[i*2].first,&conn[i*2].second.first,&conn[i*2].second.second); conn[i*2+1].first = conn[i*2].second.first; conn[i*2+1].second.first = conn[i*2].first; conn[i*2+1].second.second = conn[i*2].second.second; } sort(conn,conn+n*2-2); for(int i = 0; i < n*2-2; i++) { connr[conn[i].first] = i+1; } for(int i = n*2-3; i >= 0; i--) { connl[conn[i].first] = i; } for(int i = 2; i <= n; i++) { scanf("%lld%lld",&s[i],&v[i]); } chcnt++; dfs(1,-1); for(int i = 2; i <= n; i++) { printf("%lld ",dp[i]); } printf("\n"); return 0; }

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

harbingers.cpp: In function 'int main()':
harbingers.cpp:92:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
harbingers.cpp:95:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         scanf("%lld%lld%lld",&conn[i*2].first,&conn[i*2].second.first,&conn[i*2].second.second);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
harbingers.cpp:108:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |         scanf("%lld%lld",&s[i],&v[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...