oj.uz

답안 #342581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342581 2021-01-02T11:50:40 Z Nursik Election Campaign (JOI15_election_campaign) C++14
100 / 100
 340 ms 76652 KB 
#include <bits/stdc++.h>
          
#define fi first
#define se second
#define pp pop_back
#define ll long long
#define pb push_back
#define ld long double
#define debug cout << "OK\n";
#define all(x) x.begin(), x.end() 
#define mp make_pair 
using namespace std;        
 
const ll N = 1e6;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll pe = mod2; 
const ll pe2 = 570210983;
const ld eps = 1e-6; 
 
 
/*
Rucode: jaqVYNrpMj
JUDGE_ID: 295965SY
dl:160532
*/
void data() {
	#ifdef NURS
        freopen("main.in", "r", stdin);
        freopen("main.out", "w", stdout);
    #endif	
} 

int n, m, timer;
int tin[N], tout[N], up[25][N];
ll dp[N], dp2[N], l[N], r[N], w[N];
vector<int> g[N], g2[N];
struct fenw
{
	ll f[N * 2];
	void upd(int pos, ll val)
	{
		for (int i = pos; i <= N; i = (i | (i + 1)))
			f[i] += val;
	}
	ll sum(int pos)
	{
		ll res = 0;
		for (int i = pos; i >= 1; i = (i & (i + 1)) - 1)
			res += f[i];
		return res;
	}
	ll get(int l, int r)
	{
		if (l > r)
			return 0;
		return sum(r) - sum(l - 1);
	}
} tr, tr2;
void dfs(int v, int p)
{
	tin[v] = ++timer;
	up[0][v] = max(p, 1);
	for (int i = 1; i <= 18; i++)
	{
		up[i][v] = up[i - 1][up[i - 1][v]];
	}
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (to == p)
			continue;
		dfs(to, v);
	}
	tout[v] = ++timer;
}
bool upper(int a, int b)
{
	return (tin[a] <= tin[b] && tout[b] <= tout[a]);
}
int lca(int a, int b)
{
	if (upper(a, b))
		return a;
	if (upper(b, a))
		return b;
	for (int i = 18; i >= 0; i--)
	{
		if (!upper(up[i][a], b))
			a = up[i][a];
	}
	return up[0][a];
}    
void dfs2(int v, int p)
{
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (to == p)
			continue;
		dfs2(to, v);
	   	dp[v] += dp2[to];
	}
	dp2[v] = dp[v];
	for (int i = 0; i < g2[v].size(); i++)
	{
		int pos = g2[v][i];
		int a = l[pos], b = r[pos];
		dp2[v] = max(dp2[v] , dp[v] + tr.get(tin[v], tin[a]) + tr.get(tin[v], tin[b]) 
					 				- tr2.get(tin[v], tin[a]) - tr2.get(tin[v], tin[b]) + w[pos]); 
	}
	tr.upd(tin[v], dp[v]);
	tr.upd(tout[v], -dp[v]);
	tr2.upd(tin[v], dp2[v]);
	tr2.upd(tout[v], -dp2[v]);
}
main()
{
	data();
	ios_base::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	cin >> n;
	for (int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;
		g[u].pb(v), g[v].pb(u);
	}
	dfs(1, 0);
	cin >> m;
	for (int i = 1; i <= m; i++)
	{
		cin >> l[i] >> r[i] >> w[i];
		int lc = lca(l[i], r[i]);
		g2[lc].pb(i);
	}
	dfs2(1, 0);
	cout << dp2[1];
}

Compilation message

election_campaign.cpp: In function 'void dfs(int, int)':
election_campaign.cpp:68:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  for (int i = 0; i < g[v].size(); i++)
      |                  ~~^~~~~~~~~~~~~
election_campaign.cpp: In function 'void dfs2(int, int)':
election_campaign.cpp:96:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |  for (int i = 0; i < g[v].size(); i++)
      |                  ~~^~~~~~~~~~~~~
election_campaign.cpp:105:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |  for (int i = 0; i < g2[v].size(); i++)
      |                  ~~^~~~~~~~~~~~~~
election_campaign.cpp: At global scope:
election_campaign.cpp:117:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  117 | main()
      |      ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47596 KB Output is correct
2 Correct 34 ms 47596 KB Output is correct
3 Correct 38 ms 47596 KB Output is correct
4 Correct 30 ms 47724 KB Output is correct
5 Correct 157 ms 63852 KB Output is correct
6 Correct 87 ms 73068 KB Output is correct
7 Correct 179 ms 69740 KB Output is correct
8 Correct 141 ms 63468 KB Output is correct
9 Correct 159 ms 67948 KB Output is correct
10 Correct 125 ms 63596 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47596 KB Output is correct
2 Correct 29 ms 47596 KB Output is correct
3 Correct 30 ms 47852 KB Output is correct
4 Correct 154 ms 76524 KB Output is correct
5 Correct 147 ms 76556 KB Output is correct
6 Correct 144 ms 76524 KB Output is correct
7 Correct 146 ms 76524 KB Output is correct
8 Correct 146 ms 76524 KB Output is correct
9 Correct 142 ms 76524 KB Output is correct
10 Correct 149 ms 76396 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47596 KB Output is correct
2 Correct 29 ms 47596 KB Output is correct
3 Correct 30 ms 47852 KB Output is correct
4 Correct 154 ms 76524 KB Output is correct
5 Correct 147 ms 76556 KB Output is correct
6 Correct 144 ms 76524 KB Output is correct
7 Correct 146 ms 76524 KB Output is correct
8 Correct 146 ms 76524 KB Output is correct
9 Correct 142 ms 76524 KB Output is correct
10 Correct 149 ms 76396 KB Output is correct
11 Correct 40 ms 48620 KB Output is correct
12 Correct 147 ms 76544 KB Output is correct
13 Correct 149 ms 76524 KB Output is correct
14 Correct 145 ms 76524 KB Output is correct
15 Correct 150 ms 76524 KB Output is correct
16 Correct 145 ms 76524 KB Output is correct
17 Correct 147 ms 76524 KB Output is correct
18 Correct 148 ms 76524 KB Output is correct
19 Correct 153 ms 76460 KB Output is correct
20 Correct 148 ms 76652 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 252 ms 66664 KB Output is correct
2 Correct 145 ms 76468 KB Output is correct
3 Correct 318 ms 72812 KB Output is correct
4 Correct 259 ms 66296 KB Output is correct
5 Correct 278 ms 72320 KB Output is correct
6 Correct 238 ms 66408 KB Output is correct
7 Correct 334 ms 71924 KB Output is correct
8 Correct 297 ms 67308 KB Output is correct
9 Correct 178 ms 76524 KB Output is correct
10 Correct 329 ms 70900 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47596 KB Output is correct
2 Correct 34 ms 47596 KB Output is correct
3 Correct 38 ms 47596 KB Output is correct
4 Correct 30 ms 47724 KB Output is correct
5 Correct 157 ms 63852 KB Output is correct
6 Correct 87 ms 73068 KB Output is correct
7 Correct 179 ms 69740 KB Output is correct
8 Correct 141 ms 63468 KB Output is correct
9 Correct 159 ms 67948 KB Output is correct
10 Correct 125 ms 63596 KB Output is correct
11 Correct 32 ms 47852 KB Output is correct
12 Correct 33 ms 47852 KB Output is correct
13 Correct 33 ms 47852 KB Output is correct
14 Correct 34 ms 47852 KB Output is correct
15 Correct 35 ms 47852 KB Output is correct
16 Correct 34 ms 47852 KB Output is correct
17 Correct 35 ms 47852 KB Output is correct
18 Correct 33 ms 47844 KB Output is correct
19 Correct 35 ms 47852 KB Output is correct
20 Correct 34 ms 47912 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47596 KB Output is correct
2 Correct 34 ms 47596 KB Output is correct
3 Correct 38 ms 47596 KB Output is correct
4 Correct 30 ms 47724 KB Output is correct
5 Correct 157 ms 63852 KB Output is correct
6 Correct 87 ms 73068 KB Output is correct
7 Correct 179 ms 69740 KB Output is correct
8 Correct 141 ms 63468 KB Output is correct
9 Correct 159 ms 67948 KB Output is correct
10 Correct 125 ms 63596 KB Output is correct
11 Correct 30 ms 47596 KB Output is correct
12 Correct 29 ms 47596 KB Output is correct
13 Correct 30 ms 47852 KB Output is correct
14 Correct 154 ms 76524 KB Output is correct
15 Correct 147 ms 76556 KB Output is correct
16 Correct 144 ms 76524 KB Output is correct
17 Correct 146 ms 76524 KB Output is correct
18 Correct 146 ms 76524 KB Output is correct
19 Correct 142 ms 76524 KB Output is correct
20 Correct 149 ms 76396 KB Output is correct
21 Correct 40 ms 48620 KB Output is correct
22 Correct 147 ms 76544 KB Output is correct
23 Correct 149 ms 76524 KB Output is correct
24 Correct 145 ms 76524 KB Output is correct
25 Correct 150 ms 76524 KB Output is correct
26 Correct 145 ms 76524 KB Output is correct
27 Correct 147 ms 76524 KB Output is correct
28 Correct 148 ms 76524 KB Output is correct
29 Correct 153 ms 76460 KB Output is correct
30 Correct 148 ms 76652 KB Output is correct
31 Correct 252 ms 66664 KB Output is correct
32 Correct 145 ms 76468 KB Output is correct
33 Correct 318 ms 72812 KB Output is correct
34 Correct 259 ms 66296 KB Output is correct
35 Correct 278 ms 72320 KB Output is correct
36 Correct 238 ms 66408 KB Output is correct
37 Correct 334 ms 71924 KB Output is correct
38 Correct 297 ms 67308 KB Output is correct
39 Correct 178 ms 76524 KB Output is correct
40 Correct 329 ms 70900 KB Output is correct
41 Correct 32 ms 47852 KB Output is correct
42 Correct 33 ms 47852 KB Output is correct
43 Correct 33 ms 47852 KB Output is correct
44 Correct 34 ms 47852 KB Output is correct
45 Correct 35 ms 47852 KB Output is correct
46 Correct 34 ms 47852 KB Output is correct
47 Correct 35 ms 47852 KB Output is correct
48 Correct 33 ms 47844 KB Output is correct
49 Correct 35 ms 47852 KB Output is correct
50 Correct 34 ms 47912 KB Output is correct
51 Correct 282 ms 67192 KB Output is correct
52 Correct 160 ms 76524 KB Output is correct
53 Correct 340 ms 71016 KB Output is correct
54 Correct 206 ms 66308 KB Output is correct
55 Correct 294 ms 66664 KB Output is correct
56 Correct 163 ms 76496 KB Output is correct
57 Correct 291 ms 71764 KB Output is correct
58 Correct 241 ms 66284 KB Output is correct
59 Correct 298 ms 67052 KB Output is correct
60 Correct 157 ms 76432 KB Output is correct
61 Correct 313 ms 71916 KB Output is correct
62 Correct 241 ms 66220 KB Output is correct
63 Correct 276 ms 66748 KB Output is correct
64 Correct 149 ms 76524 KB Output is correct
65 Correct 317 ms 71656 KB Output is correct
66 Correct 201 ms 66360 KB Output is correct
67 Correct 275 ms 66792 KB Output is correct
68 Correct 154 ms 76524 KB Output is correct
69 Correct 273 ms 70380 KB Output is correct
70 Correct 219 ms 66412 KB Output is correct