oj.uz

답안 #1045307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1045307 2024-08-05T20:15:17 Z _rain_ Transport (COCI19_transport) C++17
0 / 130
 100 ms 14168 KB 
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int maxn = 1e5;
std::vector<pair<int,i64>> graph[maxn+2];
int a[maxn+2] , n;

	i64 BIT[maxn+2];
	void upd(int pos , int val)
	{
		for (; pos <= maxn;  pos += pos&-pos)
			BIT[pos] += val;
		return;
	}
	i64 get(int id)
	{
		i64 sum = 0;
		for (; id ; id -= id&-id)
			sum += BIT[id];
		return sum;
	}
	i64 sum_range(int l , int r)
	{
		return get(r) - get(l);
	}


	int sub[maxn+2] ;
	bool mark[maxn+2];
	std::vector<pair<i64,int>> cost;
	std::vector<i64> down;
	int id[maxn+2];
	i64 answer = 0;

	int get_centroid(int v , int p , int half)
	{
		for (auto& [to,w] : graph[v])
		{
			if (mark[to] || to == p) continue;
			if (sub[to] > half) return get_centroid(to,v,half);
		}
		return v;
	}

	void dfssize(int v , int p)
	{
		sub[v]=1;
		for (auto& [to,w] : graph[v])
		{
			if (to==p||mark[to]) continue;
			dfssize(to,v);
			sub[v]+=sub[to];
		}
		return;
	}

	void downforces(int v , int p , i64 mn , i64 used)
	{
			down.push_back(mn);
			for (auto& [to , w] : graph[v])
			{
				if (mark[to] || to == p) continue;
				downforces(to , v , min({mn , used + a[v] - w }) , used + a[v] - w);
			}
			return;
	}

	void build(int v , int p , i64 sum )
	{
		if (sum >= 0)
				cost.push_back({sum , v});
		for (auto& [to , w] : graph[v])
		{
			if (to==p || mark[to]) continue;
			if (a[to] - w >= 0)
				build(to , v , sum + a[to] - w);
		}
		return;
	}

	void centroid(int v)
	{
		dfssize(v,v);
		v = get_centroid(v,v,sub[v]/2);
		mark[v] = true;
		// cout << "BUCET IS : " << v << '\n';

		// DP 
			for (auto& [to,w] : graph[v])
			{
				if (mark[to]) continue;
				build(to , v , a[to] - w);
			}
			
			vector<i64> allcost ;
			std::sort(cost.begin() , cost.end());
			for (int i = 0; i < cost.size(); ++i)
			{
				id[cost[i].second] = i + 1;
				upd(id[cost[i].second] , 1);
				allcost.push_back(cost[i].first);
				++answer;
			}
			cost.clear();

			for (auto& [to , w] : graph[v])
			{
				
				if (mark[to]) continue;
				// cout << "VERTEX IS : " << to << '\n';
				build(to , v , a[to] - w);
				for (auto& [x,y] : cost) upd(id[y] , -1);
					downforces(to , v , a[v] - w , a[v] - w);
					for (auto& x : down)
					{
						if (x >= 0) ++answer;
						int pos = lower_bound(allcost.begin() , allcost.end() , -x) - allcost.begin() ;
						answer += sum_range(pos , allcost.size());
							// cout << x << ' ' << answer << ' ' << pos << '\n';
						// cout << x << ' ' << answer << '\n';
					}
					// cout << '\n';
					down.clear();
				for (auto& [x,y] : cost) upd(id[y] , 1);
				cost.clear();
			}

			for (int i = 0; i < allcost.size(); ++i) upd(i + 1 , -1);

		// cout << "\n VECTOR IS \n";
		// for (auto& x : allcost) cout << x << ' '; 
		// cout << '\n';
		// cout << "ANSWER IS : " << answer << '\n';
		
		for (auto& [to , w] : graph[v])
			if (!mark[to]) centroid(to);
	}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	cin >> n ;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	for (int i = 1; i < n; ++i)
	{
		int u , v , w; cin >> u >> v >> w;
		graph[u].push_back({v , w});
		graph[v].push_back({u , w});
	}
	centroid(1);
	cout << answer;
}

Compilation message

transport.cpp: In function 'void centroid(int)':
transport.cpp:97:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |    for (int i = 0; i < cost.size(); ++i)
      |                    ~~^~~~~~~~~~~~~
transport.cpp:128:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |    for (int i = 0; i < allcost.size(); ++i) upd(i + 1 , -1);
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 9688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 11740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 56 ms 14168 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 6236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 7512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 8412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 73 ms 9440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 100 ms 10884 KB Output isn't correct
2 Halted 0 ms 0 KB -