oj.uz

Submission #765365

# Submission time Handle Problem Language Result Execution time Memory
765365 2023-06-24T11:39:03 Z vjudge1 Roadside Advertisements (NOI17_roadsideadverts) C++17
100 / 100
 64 ms 16808 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimization("g", on)
#pragma GCC optimization("03")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

#define boba ios_base::sync_with_stdio(false); cin.tie(NULL);
#define br break
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define rbg rbegin()
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
#define emp empty()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 5e4 + 11;	
const ll inf = 1e9 + 7;
ll tt = 1;
vector<pll> g[N];
ll d[N], pr[N];
ll up[N][17];
ll tin[N];
ll timer;

void dfs(ll v, ll p) {
	tin[v] = ++timer;
	up[v][0] = p;
	for (int i = 1;i <= 16;i++) up[v][i] = up[up[v][i - 1]][i - 1];
	for (auto to : g[v]) {
		if (to.ff != p) {
			d[to.ff] = d[v] + 1;
			pr[to.ff] = pr[v] + to.ss;
//			cout << d[to.ff] << sp << pr[d[to.ff]] << sp << to.ff << sp << v << en;
			dfs(to.ff, v);
		}
	}
}

ll lca(ll x, ll y) {
//	cout << x << sp << y << en;
	if (d[x] < d[y]) swap(x, y);
	ll k = d[x] - d[y];
	for (int i = 0;i < 17;i++) {
		if (k & (1 << i)) {
			x = up[x][i];
		}
	}
	if (x == y) return x;
	for (int i = 16;i >= 0;i--) {
		if (up[x][i] != up[y][i]) {
			x = up[x][i];
			y = up[y][i];
		}
	}
	return up[x][0];
}
	
void solve() {
	ll n; cin >> n;
	for (int i = 1;i < n;i++) {
		ll u, v, w; cin >> u >> v >> w;
		u++, v++;
		g[u].pb({v, w});
		g[v].pb({u, w});
	}
	ll rt = 0;
	dfs(1, 0);
	ll q; cin >> q;
	while (q--) {
		ll b[6], ans[6]; 
		ll lc = 0;
		vector<pll> c;
		c.clear();
		bool u[6];
		for (int i = 1;i <= 5;i++) {
			u[i] = 0;
			ans[i] = 0;
			cin >> b[i];
			b[i]++;
			c.pb({tin[b[i]], b[i]});
		}
		sort(c.bg, c.ed);
		ll sum = 0;
		for (int i = 0;i < 5;i++) {
			ll h = lca(c[i].ss, c[(i + 1) % 5].ss);
			sum += (pr[c[i].ss] - pr[h]) + (pr[c[(i + 1) % 5].ss] - pr[h]);
		}
		cout << sum / 2 << en;
	}
}	
  
int main() {    
   boba                                   
//    freopen("ladder");
//    precalc();
//    cin >> tt;	
	for (int i = 1;i <= tt;i++) {
		solve(); 
    }
}

Compilation message

roadsideadverts.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization("g", on)
      | 
roadsideadverts.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization("03")
      | 
roadsideadverts.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
roadsideadverts.cpp: In function 'void solve()':
roadsideadverts.cpp:108:12: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
  108 |   ll b[6], ans[6];
      |            ^~~
roadsideadverts.cpp:109:6: warning: unused variable 'lc' [-Wunused-variable]
  109 |   ll lc = 0;
      |      ^~
roadsideadverts.cpp:112:8: warning: variable 'u' set but not used [-Wunused-but-set-variable]
  112 |   bool u[6];
      |        ^
roadsideadverts.cpp:104:5: warning: unused variable 'rt' [-Wunused-variable]
  104 |  ll rt = 0;
      |     ^~
roadsideadverts.cpp: In function 'void freopen(std::string)':
roadsideadverts.cpp:49:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
roadsideadverts.cpp:49:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 14692 KB Output is correct
2 Correct 47 ms 16748 KB Output is correct
3 Correct 43 ms 16772 KB Output is correct
4 Correct 38 ms 16792 KB Output is correct
5 Correct 52 ms 16700 KB Output is correct
6 Correct 44 ms 16808 KB Output is correct
7 Correct 57 ms 16784 KB Output is correct
8 Correct 45 ms 16764 KB Output is correct
9 Correct 41 ms 16732 KB Output is correct
10 Correct 64 ms 16792 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 11900 KB Output is correct
2 Correct 27 ms 15172 KB Output is correct
3 Correct 30 ms 15124 KB Output is correct
4 Correct 31 ms 15756 KB Output is correct
5 Correct 27 ms 15096 KB Output is correct
6 Correct 29 ms 15648 KB Output is correct
7 Correct 31 ms 15776 KB Output is correct
8 Correct 36 ms 15744 KB Output is correct
9 Correct 35 ms 15692 KB Output is correct
10 Correct 28 ms 15684 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 39 ms 14692 KB Output is correct
3 Correct 47 ms 16748 KB Output is correct
4 Correct 43 ms 16772 KB Output is correct
5 Correct 38 ms 16792 KB Output is correct
6 Correct 52 ms 16700 KB Output is correct
7 Correct 44 ms 16808 KB Output is correct
8 Correct 57 ms 16784 KB Output is correct
9 Correct 45 ms 16764 KB Output is correct
10 Correct 41 ms 16732 KB Output is correct
11 Correct 64 ms 16792 KB Output is correct
12 Correct 23 ms 11900 KB Output is correct
13 Correct 27 ms 15172 KB Output is correct
14 Correct 30 ms 15124 KB Output is correct
15 Correct 31 ms 15756 KB Output is correct
16 Correct 27 ms 15096 KB Output is correct
17 Correct 29 ms 15648 KB Output is correct
18 Correct 31 ms 15776 KB Output is correct
19 Correct 36 ms 15744 KB Output is correct
20 Correct 35 ms 15692 KB Output is correct
21 Correct 28 ms 15684 KB Output is correct
22 Correct 35 ms 14652 KB Output is correct
23 Correct 31 ms 11948 KB Output is correct
24 Correct 39 ms 16084 KB Output is correct
25 Correct 42 ms 15188 KB Output is correct
26 Correct 42 ms 16076 KB Output is correct
27 Correct 41 ms 16076 KB Output is correct
28 Correct 37 ms 16060 KB Output is correct
29 Correct 38 ms 16084 KB Output is correct
30 Correct 38 ms 16132 KB Output is correct
31 Correct 37 ms 16124 KB Output is correct