제출 #1177925

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177925		thelegendary08	Road Construction (JOI21_road_construction)	C++17	6 / 100	461 ms	62144 KiB

road_construction

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,k);
	vpii v;
	f0r(i,n){
		in2(x,y);
		v.pb(mp(x,y));
	}
	vi w;
	f0r(i,n){
		w.pb(v[i].first);
	}
	sort(all(w));
	vi diff(n-1);
	f0r(i,n-1)diff[i] = w[i+1] - w[i];
	// vout(diff);
	vi ans;
	priority_queue<pair<int, pii>>q;
	set<pii>s;
	f0r(i, n-1){
		q.push(mp(-diff[i], mp(i, i+1)));
		s.insert(mp(i,i+1));
	}
	
	while(ans.size() < k){
		pii rng = q.top().second;
		int dst = -q.top().first;
		q.pop();
		ans.pb(dst);
		if(rng.first != 0){
			if(!s.count(mp(rng.first-1, rng.second))){
				q.push(mp(-(dst + diff[rng.first - 1]), mp(rng.first-1, rng.second)));
				s.insert(mp(rng.first-1, rng.second));
			}
		}
		if(rng.second != n-1){
			if(!s.count(mp(rng.first, rng.second+1))){
				q.push(mp(-(dst + diff[rng.second]), mp(rng.first, rng.second + 1)));
				s.insert(mp(rng.first, rng.second+1));
			}
		}
	}
	f0r(i,k){
		cout<<ans[i]<<'\n';
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 6 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35