oj.uz

Submission #1052700

# Submission time Handle Problem Language Result Execution time Memory
1052700 2024-08-10T19:37:46 Z _rain_ Roadside Advertisements (NOI17_roadsideadverts) C++14
100 / 100
 47 ms 10860 KB 
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;

const int maxn = 5e4+7;
const int maxlog = 16;
vector<pair<int,int>> g[maxn+2];
int sta[maxn+2] , fin[maxn+2] , timedfs = 0 , n;
int par[maxn+2][maxlog+2] , h[maxn+2] , v[maxn+2] ;
i64 d[maxn+2];

	void dfs(int u , int p)
	{
		sta[u] = ++timedfs;
		h[u] = h[p]+1;
		par[u][0] = p;
		for (int i = 1; i <= maxlog; ++i)
			par[u][i] = par[par[u][i - 1]][i - 1];
		for (auto& v : g[u])
			if(v.first != p)
			{
				d[v.first] = d[u] + v.second;
				dfs(v.first , u);
			}
		fin[u] = timedfs;
		return;
	}
	int LCA(int u , int v)
	{
		if (h[u] < h[v]) swap(u,v);
		for (int i = maxlog; i >= 0; --i)
			if (h[par[u][i]] >= h[v])
				u = par[u][i];
		if (u==v) return u;
		for (int i = maxlog; i >= 0; --i)
			if (par[u][i]!=par[v][i])
				u = par[u][i] , v = par[v][i];
		return par[u][0];
	}
bool parent(int u , int lca)
{
	return sta[lca] <= sta[u] && sta[u] <= fin[lca];
}

bool cmp(int x , int y)
{
	return sta[x] < sta[y];
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	#define name "main"
	if (fopen(name".inp","r"))
	{
		freopen(name".inp","r",stdin);
		freopen(name".out","w+",stdout);
	}
	cin >> n;
	for (int i = 1; i < n; ++i)
			{
				int u , v , w; cin >> u >> v >> w;
				++u,++v;
				g[u].push_back({v,w});
				g[v].push_back({u,w});
			}
	dfs(1,0);
	int q; cin >> q;
	while(q--)
	{
		int numv = 5;
		vector<int> vert;
		for (int i = 1; i <= numv; ++i) {
			cin >> v[i]; ++v[i];
			vert.push_back(v[i]);
		}
		sort(v+1,v+numv+1,cmp);
		for (int i = 2;i <= numv; ++i) vert.push_back(LCA(v[i],v[i-1]));
		sort(vert.begin(),vert.end(),cmp); vert.resize(unique(vert.begin(),vert.end()) - vert.begin());
		vector<int> lis;
		i64 answer = 0;
		lis.push_back(vert[0]);
		for (int i = 1; i < vert.size(); ++i)
		{
			while (lis.size() && !parent(vert[i],lis.back())) lis.pop_back();
			if (lis.size())
			{
				// cout << lis.back() << ' ' << vert[i] << '\n';
				answer += d[vert[i]] - d[lis.back()];
			}
			lis.push_back(vert[i]);
		}
		cout << answer << '\n';
	}
}

Compilation message

roadsideadverts.cpp: In function 'int main()':
roadsideadverts.cpp:84:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for (int i = 1; i < vert.size(); ++i)
      |                   ~~^~~~~~~~~~~~~
roadsideadverts.cpp:57:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |   freopen(name".inp","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
roadsideadverts.cpp:58:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |   freopen(name".out","w+",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 9380 KB Output is correct
2 Correct 39 ms 10856 KB Output is correct
3 Correct 36 ms 10720 KB Output is correct
4 Correct 36 ms 10748 KB Output is correct
5 Correct 41 ms 10760 KB Output is correct
6 Correct 28 ms 10840 KB Output is correct
7 Correct 30 ms 10844 KB Output is correct
8 Correct 40 ms 10860 KB Output is correct
9 Correct 34 ms 10844 KB Output is correct
10 Correct 41 ms 10724 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7900 KB Output is correct
2 Correct 25 ms 10128 KB Output is correct
3 Correct 28 ms 10328 KB Output is correct
4 Correct 19 ms 10160 KB Output is correct
5 Correct 18 ms 10168 KB Output is correct
6 Correct 24 ms 10196 KB Output is correct
7 Correct 22 ms 10352 KB Output is correct
8 Correct 17 ms 10332 KB Output is correct
9 Correct 28 ms 10328 KB Output is correct
10 Correct 28 ms 10188 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1624 KB Output is correct
2 Correct 46 ms 9380 KB Output is correct
3 Correct 39 ms 10856 KB Output is correct
4 Correct 36 ms 10720 KB Output is correct
5 Correct 36 ms 10748 KB Output is correct
6 Correct 41 ms 10760 KB Output is correct
7 Correct 28 ms 10840 KB Output is correct
8 Correct 30 ms 10844 KB Output is correct
9 Correct 40 ms 10860 KB Output is correct
10 Correct 34 ms 10844 KB Output is correct
11 Correct 41 ms 10724 KB Output is correct
12 Correct 28 ms 7900 KB Output is correct
13 Correct 25 ms 10128 KB Output is correct
14 Correct 28 ms 10328 KB Output is correct
15 Correct 19 ms 10160 KB Output is correct
16 Correct 18 ms 10168 KB Output is correct
17 Correct 24 ms 10196 KB Output is correct
18 Correct 22 ms 10352 KB Output is correct
19 Correct 17 ms 10332 KB Output is correct
20 Correct 28 ms 10328 KB Output is correct
21 Correct 28 ms 10188 KB Output is correct
22 Correct 38 ms 9304 KB Output is correct
23 Correct 36 ms 8076 KB Output is correct
24 Correct 34 ms 10328 KB Output is correct
25 Correct 45 ms 10516 KB Output is correct
26 Correct 31 ms 10332 KB Output is correct
27 Correct 35 ms 10332 KB Output is correct
28 Correct 36 ms 10332 KB Output is correct
29 Correct 31 ms 10328 KB Output is correct
30 Correct 34 ms 10444 KB Output is correct
31 Correct 47 ms 10324 KB Output is correct