제출 #117547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
117547		ckodser	Palembang Bridges (APIO15_bridge)	C++14	8 / 100	2045 ms	6912 KiB

bridge

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}

#define ll long long
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=2e5+500;
const ll inf=1e18+800;


vector<ll> comp;
ll n,k;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);	
	cin>>k>>n;
	ll sum=0;
	vector<pair<ll,pii> > vec;
	comp.pb(0);
	for(ll i=0;i<n;i++){
		char C,T;
		ll L,R;
		cin>>C>>L>>T>>R;
		if(L>R)swap(L,R);
		sum+=R-L;
		if(C!=T){
			comp.pb(L);
			comp.pb(R);
			sum++;
			vec.pb(mp(L+R,mp(L,R)));
		}
	}

	sort(comp.begin(),comp.end());
	auto it=unique(comp.begin(),comp.end());
	comp.resize(it-comp.begin());

	if(k==1){
		ll ans=inf;
		for(auto x:comp){
			ll res=0;
			for(auto e:vec){
				ll l=e.S.F;
				ll r=e.S.S;
				if(x<l){
					res+=(l-x);
				}
				if(r<x){
					res+=(x-r);
				}
			}
			ans=min(ans,res);
		}
		cout<<ans*2+sum<<endl;
	}
	return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37