Submission #1143357

#TimeUsernameProblemLanguageResultExecution timeMemory
1143357monkey133Security Guard (JOI23_guard)C++20
26 / 100
154 ms12712 KiB
#include <bits/stdc++.h> //#include "includeall.h" //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define endl '\n' #define f first #define s second #define pb push_back #define mp make_pair #define lb lower_bound #define ub upper_bound #define input(x) scanf("%lld", &x); #define input2(x, y) scanf("%lld%lld", &x, &y); #define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z); #define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a); #define print(x, y) printf("%lld%c", x, y); #define show(x) cerr << #x << " is " << x << endl; #define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl; #define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl; #define all(x) x.begin(), x.end() #define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end()); #define FOR(i, x, n) for (ll i =x; i<=n; ++i) #define RFOR(i, x, n) for (ll i =x; i>=n; --i) using namespace std; mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count()); //using namespace __gnu_pbds; //#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> //#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> typedef long long ll; typedef long double ld; typedef pair<ld, ll> pd; typedef pair<string, ll> psl; typedef pair<ll, ll> pi; typedef pair<ll, pi> pii; typedef pair<pi, pi> piii; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll par[100005], cost[100005], a[100005], ans[100005]; ll find(ll x) {return ((par[x]==x)?x:par[x] =find(par[x]));} void unite(ll x, ll y) { x = find(x), y = find(y); if (x==y) return; par[y] = x; } int main() { ll n, m, q, minn, maxx; cin >> n >> m >> q; for (ll i=1; i<=n; ++i) cin >> a[i]; minn = *min_element(a + 1, a + n + 1); maxx = *max_element(a + 1, a + n + 1); vector<pii> edges; for (ll i=0; i<m; ++i) { ll u, v; cin >> u >> v; edges.pb(mp(a[u] + a[v], mp(u, v))); } sort(all(edges)); for (ll i=1; i<=n; ++i) par[i] = i; priority_queue<pii, vector<pii>, greater<pii> > pq; for (pii u: edges) { if (find(u.s.f)==find(u.s.s)) continue; ll x = find(u.s.f), y = find(u.s.s); if (x==y) continue; if (a[x] > a[y]) swap(x, y); unite(x, y); pq.push(mp(a[x] - minn, u.s)); } for (ll i=1; i<=n; ++i) par[i] = i, cost[i] = a[i] + minn; ans[n-1] = maxx + (n-2)*minn; for (ll i=n-2; i>=0;) { pii now = pq.top(); pq.pop(); ll x = now.s.f, y = now.s.s; if (find(x)==find(y)) continue; ll c = a[x] + a[y] - max(cost[find(x)], cost[find(y)]); if (c != now.f) {pq.push(mp(c, now.s)); continue;} if (cost[find(x)] > cost[find(y)]) swap(x, y); unite(x, y); ans[i] = c + ans[i+1]; i--; } for (ll i=0; i<=q; ++i) { cout << ans[min(i, n-1)] << endl;} return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...