Submission #1859189
Source Code Expand
#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; #define fi first #define se second #define mp make_pair #define pb push_back #define fbo find_by_order #define ook order_of_key typedef long long ll; typedef pair<ll,ll> ii; typedef vector<int> vi; typedef long double ld; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; bool marked[100001]; vector<ii> v[100001]; //adjList ll prim(int k){ priority_queue<ii, vector<ii>, greater<ii> > q; ll u; long long minimumCost = 0; ii p; q.push(mp(0, k)); while(!q.empty()) { p = q.top(); q.pop(); k = p.second; if(marked[k] == true) continue; minimumCost += p.fi; marked[k] = true; for(ll i = 0;i < v[k].size();++i) { u = v[k][i].se; if(marked[u] == false) q.push(v[k][i]); } } return minimumCost; } int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); long long n; cin>>n; vector<ii> x; vector<ii> y; for(ll i =0;i<n;i++){ ll a,b; cin>>a>>b; x.pb(mp(a,i)); y.pb(mp(b,i)); } sort(x.begin(),x.end()); sort(y.begin(),y.end()); for(ll i=0;i<n-1;i++){ v[x[i].se].pb(mp(x[i+1].fi-x[i].fi,x[i+1].se)); v[x[i+1].se].pb(mp(x[i+1].fi-x[i].fi,x[i].se)); v[y[i].se].pb(mp(y[i+1].fi-y[i].fi,y[i+1].se)); v[y[i+1].se].pb(mp(y[i+1].fi-y[i].fi,y[i].se)); } ll ans=prim(0); cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Built? |
User | vjudge4 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1667 Byte |
Status | AC |
Exec Time | 109 ms |
Memory | 17508 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 102 ms | 17508 KB |
02.txt | AC | 109 ms | 17508 KB |
03.txt | AC | 107 ms | 17508 KB |
04.txt | AC | 104 ms | 17508 KB |
05.txt | AC | 109 ms | 17508 KB |
06.txt | AC | 107 ms | 17508 KB |
07.txt | AC | 103 ms | 17508 KB |
08.txt | AC | 103 ms | 17508 KB |
09.txt | AC | 105 ms | 17508 KB |
10.txt | AC | 106 ms | 17508 KB |
11.txt | AC | 103 ms | 17508 KB |
12.txt | AC | 103 ms | 17508 KB |
13.txt | AC | 85 ms | 17380 KB |
14.txt | AC | 81 ms | 17380 KB |
15.txt | AC | 61 ms | 13668 KB |
16.txt | AC | 65 ms | 13668 KB |
17.txt | AC | 67 ms | 13668 KB |
18.txt | AC | 65 ms | 13668 KB |
19.txt | AC | 65 ms | 13668 KB |
20.txt | AC | 88 ms | 16740 KB |
21.txt | AC | 81 ms | 14052 KB |
22.txt | AC | 74 ms | 13668 KB |
23.txt | AC | 41 ms | 13668 KB |
24.txt | AC | 88 ms | 14564 KB |
25.txt | AC | 2 ms | 2560 KB |
26.txt | AC | 2 ms | 2560 KB |
s1.txt | AC | 2 ms | 2560 KB |
s2.txt | AC | 2 ms | 2560 KB |