-
Notifications
You must be signed in to change notification settings - Fork 0
/
TOI15_Budget.c++
79 lines (79 loc) · 1.73 KB
/
TOI15_Budget.c++
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*
TASK: budget.cpp
LANG: C++
AUTHOR: Tapat Toungsakul
CENTER: Home
*/
#include<bits/stdc++.h>
using namespace std;
vector<int> memo;
int find(int n)
{
if (memo[n] == n) return n;
return memo[n] = find(memo[n]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int b,e;
cin >> b >> e;
memo.resize(b);
for (int i = 0 ; i < b ; i++) memo[i] = i;
int count = 0;
priority_queue<vector<int>,vector<vector<int>>,greater<vector<int>>> pq;
for (int i = 0 ; i < e ; i++)
{
int src,dest,w,status;
cin >> src >> dest >> w >> status;
if (status == 0) pq.push({w,src,dest});
else {
int a = find(src);
int b = find(dest);
if (a != b)
{
memo[a] = b;
count++;
}
}
}
vector<pair<int,int>> price;
int p;
cin >> p;
for (int i = 0 ; i < p ; i++)
{
int x,y;
cin >> x >> y;
price.push_back({x,y});
}
sort(price.begin(),price.end(),[](auto& x,auto& y)
{
if (x.second == y.second)return x.first<y.first;
return x.second < y.second;
});
int total = 0;
while(!pq.empty() && count < b-1)
{
vector<int> top = pq.top();
pq.pop();
int w = top[0];
int src = top[1];
int dest = top[2];
int a = find(src);
int b = find(dest);
if (a != b)
{
memo[a] = b;
count++;
for (int i = 0 ; i < p ; i++)
{
if (w <= price[i].first)
{
total += price[i].second;
break;
}
}
}
}
cout << total;
}