제출 #121535

#제출 시각아이디문제언어결과실행 시간메모리
121535dualityDesignated Cities (JOI19_designated_cities)C++11
6 / 100
2066 ms25228 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 ---------- struct edge { int v,c,d; }; vector<edge> adjList[200000]; LLI ans[200001]; int parent[200000],pw[200000],disc[200000],fin[200000],num = 0; LLI pp[200000]; int done[200000]; LLI sum2 = 0; int doDFS(int u,int p,LLI d) { int i; parent[u] = p,pp[u] = d,disc[u] = num++; for (i = 0; i < adjList[u].size(); i++) { int v = adjList[u][i].v; if (v != p) pw[v] = adjList[u][i].c,doDFS(v,u,d+adjList[u][i].c),sum2 += adjList[u][i].d; } fin[u] = num; return 0; } int main() { int i; int N,Q; int A,B,C,D; LLI sum = 0; scanf("%d",&N); for (i = 0; i < N-1; i++) { scanf("%d %d %d %d",&A,&B,&C,&D); A--,B--; adjList[A].pb((edge){B,C,D}); adjList[B].pb((edge){A,D,C}); sum += C+D; } int j,k; for (i = 0; i < N; i++) { sum2 = 0; doDFS(i,-1,0); ans[1] = max(ans[1],sum2); fill(done,done+N,0); for (j = 2; j <= N; j++) { int mi = 0; for (k = 0; k < N; k++) { if (pp[k] > pp[mi]) mi = k; } sum2 += pp[mi]; ans[j] = max(ans[j],sum2); while (!done[mi] && (mi != i)) { for (k = 0; k < N; k++) { if ((disc[k] >= disc[mi]) && (disc[k] < fin[mi])) pp[k] -= pw[mi]; } done[mi] = 1,mi = parent[mi]; } } } int E; scanf("%d",&Q); for (i = 0; i < Q; i++) { scanf("%d",&E); printf("%lld\n",sum-ans[E]); } return 0; }

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

designated_cities.cpp: In function 'int doDFS(int, int, LLI)':
designated_cities.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
designated_cities.cpp: In function 'int main()':
designated_cities.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
designated_cities.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d",&A,&B,&C,&D);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&Q);
     ~~~~~^~~~~~~~~
designated_cities.cpp:114:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&E);
         ~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...