oj.uz

Submission #223753

# Submission time Handle Problem Language Result Execution time Memory
223753 2020-04-16T09:54:13 Z arnold518 Election Campaign (JOI15_election_campaign) C++14
100 / 100
 287 ms 37216 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int N, Q;
vector<int> adj[MAXN+10];

int par[MAXN+10][25];
int dep[MAXN+10];
int L[MAXN+10], R[MAXN+10], cnt;

struct Query
{
	int u, v, w;
};
vector<Query> A[MAXN+10];

void dfs(int now, int bef, int d)
{
	dep[now]=d;
	par[now][0]=bef;
	L[now]=++cnt;
	for(int nxt : adj[now])
	{
		if(nxt==bef) continue;
		dfs(nxt, now, d+1);
	}
	R[now]=cnt;
}

int lca(int x, int y)
{
	int i, j;
	if(dep[x]<dep[y]) swap(x, y);
	for(i=20; i>=0; i--) if(dep[par[x][i]]>=dep[y]) x=par[x][i];
	if(x==y) return x;
	for(i=20; i>=0; i--) if(par[x][i]!=par[y][i]) x=par[x][i], y=par[y][i];
	return par[x][0];
}

struct BIT
{
	int tree[MAXN+10];
	void update(int i, int v) { for(; i<=N; i+=(i&-i)) tree[i]+=v; }
	int query(int i) { int ret=0; for(; i>0; i-=(i&-i)) ret+=tree[i]; return ret; }
	void update(int l, int r, int v) { update(l, v); update(r+1, -v); }
}seg;
int dp[MAXN+10];

void dfs2(int now, int bef)
{
	int i, j;	
	vector<int> chd;

	int sum=0;
	for(int nxt : adj[now])
	{
		if(nxt==bef) continue;
		dfs2(nxt, now);
		chd.push_back(nxt);
		sum+=dp[nxt];
	}

	dp[now]=sum;

	for(auto nxt : chd) seg.update(L[nxt], R[nxt], -dp[nxt]);	
	for(auto &it : A[now])
	{
		int v=seg.query(L[it.u])+seg.query(L[it.v])+sum+it.w;
		dp[now]=max(dp[now], v);
	}
	seg.update(L[now], R[now], sum);
}

int main()
{
	int i, j;

	scanf("%d", &N);
	for(i=1; i<N; i++)
	{
		int u, v;
		scanf("%d%d", &u, &v);
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	dfs(1, 1, 1);
	for(i=1; i<=20; i++) for(j=1; j<=N; j++) par[j][i]=par[par[j][i-1]][i-1];

	scanf("%d", &Q);
	while(Q--)
	{
		int u, v, w, k;
		scanf("%d%d%d", &u, &v, &k);
		w=lca(u, v);
		A[w].push_back({u, v, k});
	}

	dfs2(1, 1);
	printf("%d\n", dp[1]);
}

Compilation message

election_campaign.cpp: In function 'int lca(int, int)':
election_campaign.cpp:38:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
election_campaign.cpp: In function 'void dfs2(int, int)':
election_campaign.cpp:57:6: warning: unused variable 'i' [-Wunused-variable]
  int i, j; 
      ^
election_campaign.cpp:57:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j; 
         ^
election_campaign.cpp: In function 'int main()':
election_campaign.cpp:84:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
election_campaign.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~
election_campaign.cpp:96:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
election_campaign.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5248 KB Output is correct
5 Correct 114 ms 21208 KB Output is correct
6 Correct 83 ms 33596 KB Output is correct
7 Correct 107 ms 29304 KB Output is correct
8 Correct 85 ms 21656 KB Output is correct
9 Correct 105 ms 27128 KB Output is correct
10 Correct 88 ms 21624 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5376 KB Output is correct
4 Correct 176 ms 34424 KB Output is correct
5 Correct 174 ms 34424 KB Output is correct
6 Correct 164 ms 34424 KB Output is correct
7 Correct 171 ms 34424 KB Output is correct
8 Correct 187 ms 34424 KB Output is correct
9 Correct 184 ms 34552 KB Output is correct
10 Correct 190 ms 34424 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5376 KB Output is correct
4 Correct 176 ms 34424 KB Output is correct
5 Correct 174 ms 34424 KB Output is correct
6 Correct 164 ms 34424 KB Output is correct
7 Correct 171 ms 34424 KB Output is correct
8 Correct 187 ms 34424 KB Output is correct
9 Correct 184 ms 34552 KB Output is correct
10 Correct 190 ms 34424 KB Output is correct
11 Correct 21 ms 5760 KB Output is correct
12 Correct 179 ms 34424 KB Output is correct
13 Correct 190 ms 34552 KB Output is correct
14 Correct 163 ms 34428 KB Output is correct
15 Correct 174 ms 34424 KB Output is correct
16 Correct 160 ms 34424 KB Output is correct
17 Correct 175 ms 34576 KB Output is correct
18 Correct 176 ms 34424 KB Output is correct
19 Correct 159 ms 34424 KB Output is correct
20 Correct 185 ms 34552 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 21552 KB Output is correct
2 Correct 178 ms 36856 KB Output is correct
3 Correct 287 ms 32640 KB Output is correct
4 Correct 155 ms 24364 KB Output is correct
5 Correct 230 ms 31608 KB Output is correct
6 Correct 154 ms 24300 KB Output is correct
7 Correct 269 ms 31280 KB Output is correct
8 Correct 200 ms 24312 KB Output is correct
9 Correct 160 ms 36856 KB Output is correct
10 Correct 259 ms 29488 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5248 KB Output is correct
5 Correct 114 ms 21208 KB Output is correct
6 Correct 83 ms 33596 KB Output is correct
7 Correct 107 ms 29304 KB Output is correct
8 Correct 85 ms 21656 KB Output is correct
9 Correct 105 ms 27128 KB Output is correct
10 Correct 88 ms 21624 KB Output is correct
11 Correct 8 ms 5248 KB Output is correct
12 Correct 8 ms 5376 KB Output is correct
13 Correct 8 ms 5248 KB Output is correct
14 Correct 8 ms 5248 KB Output is correct
15 Correct 8 ms 5248 KB Output is correct
16 Correct 8 ms 5248 KB Output is correct
17 Correct 8 ms 5256 KB Output is correct
18 Correct 8 ms 5248 KB Output is correct
19 Correct 10 ms 5248 KB Output is correct
20 Correct 8 ms 5376 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5248 KB Output is correct
5 Correct 114 ms 21208 KB Output is correct
6 Correct 83 ms 33596 KB Output is correct
7 Correct 107 ms 29304 KB Output is correct
8 Correct 85 ms 21656 KB Output is correct
9 Correct 105 ms 27128 KB Output is correct
10 Correct 88 ms 21624 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5376 KB Output is correct
14 Correct 176 ms 34424 KB Output is correct
15 Correct 174 ms 34424 KB Output is correct
16 Correct 164 ms 34424 KB Output is correct
17 Correct 171 ms 34424 KB Output is correct
18 Correct 187 ms 34424 KB Output is correct
19 Correct 184 ms 34552 KB Output is correct
20 Correct 190 ms 34424 KB Output is correct
21 Correct 21 ms 5760 KB Output is correct
22 Correct 179 ms 34424 KB Output is correct
23 Correct 190 ms 34552 KB Output is correct
24 Correct 163 ms 34428 KB Output is correct
25 Correct 174 ms 34424 KB Output is correct
26 Correct 160 ms 34424 KB Output is correct
27 Correct 175 ms 34576 KB Output is correct
28 Correct 176 ms 34424 KB Output is correct
29 Correct 159 ms 34424 KB Output is correct
30 Correct 185 ms 34552 KB Output is correct
31 Correct 202 ms 21552 KB Output is correct
32 Correct 178 ms 36856 KB Output is correct
33 Correct 287 ms 32640 KB Output is correct
34 Correct 155 ms 24364 KB Output is correct
35 Correct 230 ms 31608 KB Output is correct
36 Correct 154 ms 24300 KB Output is correct
37 Correct 269 ms 31280 KB Output is correct
38 Correct 200 ms 24312 KB Output is correct
39 Correct 160 ms 36856 KB Output is correct
40 Correct 259 ms 29488 KB Output is correct
41 Correct 8 ms 5248 KB Output is correct
42 Correct 8 ms 5376 KB Output is correct
43 Correct 8 ms 5248 KB Output is correct
44 Correct 8 ms 5248 KB Output is correct
45 Correct 8 ms 5248 KB Output is correct
46 Correct 8 ms 5248 KB Output is correct
47 Correct 8 ms 5256 KB Output is correct
48 Correct 8 ms 5248 KB Output is correct
49 Correct 10 ms 5248 KB Output is correct
50 Correct 8 ms 5376 KB Output is correct
51 Correct 203 ms 24568 KB Output is correct
52 Correct 174 ms 37112 KB Output is correct
53 Correct 259 ms 30128 KB Output is correct
54 Correct 157 ms 24628 KB Output is correct
55 Correct 204 ms 24240 KB Output is correct
56 Correct 187 ms 37216 KB Output is correct
57 Correct 236 ms 30840 KB Output is correct
58 Correct 152 ms 24624 KB Output is correct
59 Correct 211 ms 24696 KB Output is correct
60 Correct 172 ms 37112 KB Output is correct
61 Correct 230 ms 30968 KB Output is correct
62 Correct 161 ms 24400 KB Output is correct
63 Correct 196 ms 24164 KB Output is correct
64 Correct 176 ms 37112 KB Output is correct
65 Correct 261 ms 30896 KB Output is correct
66 Correct 152 ms 24756 KB Output is correct
67 Correct 200 ms 24172 KB Output is correct
68 Correct 181 ms 37112 KB Output is correct
69 Correct 241 ms 29076 KB Output is correct
70 Correct 153 ms 24796 KB Output is correct