oj.uz

답안 #56849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
56849 2018-07-12T20:24:44 Z Mamnoon_Siam Election Campaign (JOI15_election_campaign) C++17
100 / 100
 540 ms 28020 KB 
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;
template<typename T> using min_pq =
	priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

const int maxn = 100005;

int n, m;
vector<int> g[maxn], paths[maxn], A, B, C;
int t[18][maxn], dp[maxn], sz[maxn], where[maxn], lvl[maxn], tym = 0;
ll S[maxn];

int dfs(int u, int par) {
	sz[u] = 1;
	where[u] = ++tym;
	t[0][u] = par;
	lvl[u] = par == -1 ? 0 : lvl[par] + 1;
	for(int v : g[u]) {
		if(par - v) {
			dfs(v, u);
			sz[u] += sz[v];
		}
	}
}

int __lca(int u, int v) {
	if(lvl[u] > lvl[v]) swap(u, v);
	int d = lvl[v] - lvl[u];
	for(int i = 16; i >= 0; i--) {
		if(d & (1 << i)) {
			v = t[i][v];
		}
	}
	if(u == v) return u;
	for(int i = 16; i >= 0; i--) {
		if(t[i][u] != t[i][v]) {
			u = t[i][u];
			v = t[i][v];
		}
	} return t[0][u];
}

void update(int u, int val) {
	int l = where[u], r = where[u] + sz[u];
	for(; l <= n; l += l & -l) S[l] += val;
	for(; r <= n; r += r & -r) S[r] -= val;
}
int query(int u, int ret = 0) {
	for(int p = where[u]; p > 0; p -= p & -p)
		ret += S[p];
	return ret;
}
int value(int u) {
	return query(u) - (u != 1 ? query(t[0][u]) : 0);
}
int pathcost(int i) { // query path S[u] sum
	int u = A[i], v = B[i];
	int lca = __lca(u, v);
	return query(u) + query(v) - query(lca) - (lca == 1 ? 0 : query(t[0][lca]));
}

void prep(int u, int par) {
	for(int v : g[u]) {
		if(v - par) {
			prep(v, u);
			update(u, dp[v]);
		}
	}
	dp[u] = value(u);
	for(int p : paths[u]) {
		int ret = C[p] + pathcost(p);
		dp[u] = max(dp[u], ret);
	}
	update(u, -dp[u]);
}

int32_t main () {
	// freopen("in", "r", stdin);
	scanf("%d", &n);
	for(int i = 1; i < n; i++) {
		int u, v; scanf("%d %d", &u, &v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	MEMSET(t, -1);
	dfs(1, -1);
	for(int p = 1; p <= 16; p++) {
		for(int i = 1; i <= n; i++) {
			int mid = t[p - 1][i];
			if(mid != -1) t[p][i] = t[p - 1][mid];
		}
	}
	scanf("%d", &m);
	A.resize(m), B.resize(m), C.resize(m);
	for(int i = 0; i < m; i++) {
		scanf("%d %d %d", &A[i], &B[i], &C[i]);
		paths[__lca(A[i], B[i])].push_back(i);
	}
	prep(1, -1);
	printf("%d\n", dp[1]);
}

Compilation message

election_campaign.cpp: In function 'int myrand(int, int)':
election_campaign.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
election_campaign.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
election_campaign.cpp: In function 'int dfs(int, int)':
election_campaign.cpp:49:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
election_campaign.cpp: In function 'int32_t main()':
election_campaign.cpp:104:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
election_campaign.cpp:106:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int u, v; scanf("%d %d", &u, &v);
             ~~~~~^~~~~~~~~~~~~~~~~
election_campaign.cpp:118:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &m);
  ~~~~~^~~~~~~~~~
election_campaign.cpp:121:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &A[i], &B[i], &C[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12024 KB Output is correct
2 Correct 12 ms 12132 KB Output is correct
3 Correct 13 ms 12132 KB Output is correct
4 Correct 13 ms 12168 KB Output is correct
5 Correct 181 ms 17800 KB Output is correct
6 Correct 78 ms 25352 KB Output is correct
7 Correct 169 ms 25352 KB Output is correct
8 Correct 154 ms 25352 KB Output is correct
9 Correct 191 ms 25352 KB Output is correct
10 Correct 148 ms 25352 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25352 KB Output is correct
2 Correct 13 ms 25352 KB Output is correct
3 Correct 14 ms 25352 KB Output is correct
4 Correct 269 ms 27924 KB Output is correct
5 Correct 265 ms 27924 KB Output is correct
6 Correct 273 ms 27924 KB Output is correct
7 Correct 302 ms 27944 KB Output is correct
8 Correct 280 ms 27944 KB Output is correct
9 Correct 242 ms 28012 KB Output is correct
10 Correct 281 ms 28012 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25352 KB Output is correct
2 Correct 13 ms 25352 KB Output is correct
3 Correct 14 ms 25352 KB Output is correct
4 Correct 269 ms 27924 KB Output is correct
5 Correct 265 ms 27924 KB Output is correct
6 Correct 273 ms 27924 KB Output is correct
7 Correct 302 ms 27944 KB Output is correct
8 Correct 280 ms 27944 KB Output is correct
9 Correct 242 ms 28012 KB Output is correct
10 Correct 281 ms 28012 KB Output is correct
11 Correct 33 ms 28012 KB Output is correct
12 Correct 289 ms 28012 KB Output is correct
13 Correct 313 ms 28012 KB Output is correct
14 Correct 237 ms 28012 KB Output is correct
15 Correct 307 ms 28012 KB Output is correct
16 Correct 226 ms 28012 KB Output is correct
17 Correct 292 ms 28012 KB Output is correct
18 Correct 288 ms 28012 KB Output is correct
19 Correct 271 ms 28012 KB Output is correct
20 Correct 304 ms 28012 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 386 ms 28012 KB Output is correct
2 Correct 213 ms 28012 KB Output is correct
3 Correct 525 ms 28012 KB Output is correct
4 Correct 302 ms 28012 KB Output is correct
5 Correct 447 ms 28012 KB Output is correct
6 Correct 295 ms 28012 KB Output is correct
7 Correct 540 ms 28012 KB Output is correct
8 Correct 368 ms 28012 KB Output is correct
9 Correct 221 ms 28012 KB Output is correct
10 Correct 492 ms 28012 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12024 KB Output is correct
2 Correct 12 ms 12132 KB Output is correct
3 Correct 13 ms 12132 KB Output is correct
4 Correct 13 ms 12168 KB Output is correct
5 Correct 181 ms 17800 KB Output is correct
6 Correct 78 ms 25352 KB Output is correct
7 Correct 169 ms 25352 KB Output is correct
8 Correct 154 ms 25352 KB Output is correct
9 Correct 191 ms 25352 KB Output is correct
10 Correct 148 ms 25352 KB Output is correct
11 Correct 14 ms 28012 KB Output is correct
12 Correct 14 ms 28012 KB Output is correct
13 Correct 12 ms 28012 KB Output is correct
14 Correct 12 ms 28012 KB Output is correct
15 Correct 13 ms 28012 KB Output is correct
16 Correct 13 ms 28012 KB Output is correct
17 Correct 13 ms 28012 KB Output is correct
18 Correct 16 ms 28012 KB Output is correct
19 Correct 16 ms 28012 KB Output is correct
20 Correct 15 ms 28012 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12024 KB Output is correct
2 Correct 12 ms 12132 KB Output is correct
3 Correct 13 ms 12132 KB Output is correct
4 Correct 13 ms 12168 KB Output is correct
5 Correct 181 ms 17800 KB Output is correct
6 Correct 78 ms 25352 KB Output is correct
7 Correct 169 ms 25352 KB Output is correct
8 Correct 154 ms 25352 KB Output is correct
9 Correct 191 ms 25352 KB Output is correct
10 Correct 148 ms 25352 KB Output is correct
11 Correct 13 ms 25352 KB Output is correct
12 Correct 13 ms 25352 KB Output is correct
13 Correct 14 ms 25352 KB Output is correct
14 Correct 269 ms 27924 KB Output is correct
15 Correct 265 ms 27924 KB Output is correct
16 Correct 273 ms 27924 KB Output is correct
17 Correct 302 ms 27944 KB Output is correct
18 Correct 280 ms 27944 KB Output is correct
19 Correct 242 ms 28012 KB Output is correct
20 Correct 281 ms 28012 KB Output is correct
21 Correct 33 ms 28012 KB Output is correct
22 Correct 289 ms 28012 KB Output is correct
23 Correct 313 ms 28012 KB Output is correct
24 Correct 237 ms 28012 KB Output is correct
25 Correct 307 ms 28012 KB Output is correct
26 Correct 226 ms 28012 KB Output is correct
27 Correct 292 ms 28012 KB Output is correct
28 Correct 288 ms 28012 KB Output is correct
29 Correct 271 ms 28012 KB Output is correct
30 Correct 304 ms 28012 KB Output is correct
31 Correct 386 ms 28012 KB Output is correct
32 Correct 213 ms 28012 KB Output is correct
33 Correct 525 ms 28012 KB Output is correct
34 Correct 302 ms 28012 KB Output is correct
35 Correct 447 ms 28012 KB Output is correct
36 Correct 295 ms 28012 KB Output is correct
37 Correct 540 ms 28012 KB Output is correct
38 Correct 368 ms 28012 KB Output is correct
39 Correct 221 ms 28012 KB Output is correct
40 Correct 492 ms 28012 KB Output is correct
41 Correct 14 ms 28012 KB Output is correct
42 Correct 14 ms 28012 KB Output is correct
43 Correct 12 ms 28012 KB Output is correct
44 Correct 12 ms 28012 KB Output is correct
45 Correct 13 ms 28012 KB Output is correct
46 Correct 13 ms 28012 KB Output is correct
47 Correct 13 ms 28012 KB Output is correct
48 Correct 16 ms 28012 KB Output is correct
49 Correct 16 ms 28012 KB Output is correct
50 Correct 15 ms 28012 KB Output is correct
51 Correct 378 ms 28012 KB Output is correct
52 Correct 244 ms 28012 KB Output is correct
53 Correct 475 ms 28012 KB Output is correct
54 Correct 313 ms 28012 KB Output is correct
55 Correct 338 ms 28012 KB Output is correct
56 Correct 236 ms 28012 KB Output is correct
57 Correct 404 ms 28012 KB Output is correct
58 Correct 324 ms 28012 KB Output is correct
59 Correct 365 ms 28012 KB Output is correct
60 Correct 254 ms 28020 KB Output is correct
61 Correct 331 ms 28020 KB Output is correct
62 Correct 227 ms 28020 KB Output is correct
63 Correct 298 ms 28020 KB Output is correct
64 Correct 215 ms 28020 KB Output is correct
65 Correct 474 ms 28020 KB Output is correct
66 Correct 230 ms 28020 KB Output is correct
67 Correct 319 ms 28020 KB Output is correct
68 Correct 179 ms 28020 KB Output is correct
69 Correct 374 ms 28020 KB Output is correct
70 Correct 260 ms 28020 KB Output is correct