#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],inv[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++,inv[num-1] = u;
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;
}
LLI tree[1 << 19],lazy[1 << 19];
int pos[1 << 19];
int prop(int s,int e,int i) {
tree[i] += lazy[i];
if (s != e) lazy[2*i+1] += lazy[i],lazy[2*i+2] += lazy[i];
lazy[i] = 0;
return 0;
}
int build(int s,int e,int i) {
if (s == e) {
tree[i] = lazy[i] = 0,pos[i] = s;
return 0;
}
int mid = (s+e) / 2;
build(s,mid,2*i+1),build(mid+1,e,2*i+2);
tree[i] = lazy[i] = 0,pos[i] = s;
return 0;
}
LLI update(int s,int e,int as,int ae,int i,LLI num) {
prop(s,e,i);
if ((s > ae) || (e < as)) return tree[i];
else if ((s >= as) && (e <= ae)) {
lazy[i] += num;
prop(s,e,i);
return tree[i];
}
int mid = (s+e) / 2;
tree[i] = max(update(s,mid,as,ae,2*i+1,num),update(mid+1,e,as,ae,2*i+2,num));
if (tree[2*i+1] > tree[2*i+2]) pos[i] = pos[2*i+1];
else pos[i] = pos[2*i+2];
return tree[i];
}
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,num = 0;
doDFS(i,-1,0);
ans[1] = max(ans[1],sum2);
fill(done,done+N,0);
build(0,N-1,0);
for (j = 0; j < N; j++) update(0,N-1,disc[j],disc[j],0,pp[j]);
for (j = 2; j <= N; j++) {
prop(0,N-1,0);
int mi = inv[pos[0]];
sum2 += tree[0];
ans[j] = max(ans[j],sum2);
while (!done[mi] && (mi != i)) {
update(0,N-1,disc[mi],fin[mi]-1,0,-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;
}
Compilation message
timeleap.cpp: In function 'int doDFS(int, int, LLI)':
timeleap.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < adjList[u].size(); i++) {
~~^~~~~~~~~~~~~~~~~~~
timeleap.cpp: In function 'int main()':
timeleap.cpp:123:11: warning: unused variable 'k' [-Wunused-variable]
int j,k;
^
timeleap.cpp:114:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&N);
~~~~~^~~~~~~~~
timeleap.cpp:116: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);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:144:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&Q);
~~~~~^~~~~~~~~
timeleap.cpp:146:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&E);
~~~~~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
9856 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
9856 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
9856 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
