Submission #697588

#	Time	Username	Problem	Language	Result	Execution time	Memory
697588		sunwukong123	전선 연결 (IOI17_wiring)	C++14	13 / 100	1066 ms	158108 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 200005;
int a,b;
deque<int> DQ[MAXN];
int T[MAXN];
vector<pi> vec;
int ans;
map<int,int> dist;
long long min_total_length(std::vector<int32_t> R, std::vector<int32_t> B) {
	a=R.size();
	b=B.size();
	FOR(i,0,a-1){
		vec.pb({R[i],0});
	}
	FOR(i,0,b-1) {
		vec.pb({B[i],1});
	}
	sort(all(vec)); // {x position, 0/1}

	int s=vec.size();
	int dlen=0;
	T[0]=-1;
	FOR(i,0,s-1) {
		dist[vec[i].f]=oo;
		if(vec[i].s == 0){
			auto it=lower_bound(all(B),vec[i].f);
			if(it!=B.end())chmin(dist[vec[i].f], *it-vec[i].f);
			if(it!=B.begin()) {
				chmin(dist[vec[i].f], vec[i].f - *prev(it));
			}
		} else {
			auto it=lower_bound(all(R),vec[i].f);
			if(it != R.end()) {
				chmin(dist[vec[i].f], *it-vec[i].f);
			} 
			if(it!=R.begin()) {
				chmin(dist[vec[i].f], vec[i].f - *prev(it));
			}
		}
		db3(i,vec[i].f,dist[vec[i].f]);

		if(T[dlen] != vec[i].s) {
			++dlen;
			T[dlen]=vec[i].s;
		}
		DQ[dlen].pb(vec[i].f);
	}
	for(;;) {
		int cost = oo;
		FOR(i,1,dlen) {
			// maybe i should do [i-1,i] now
			if(DQ[i-1].size() && DQ[i].size()) {
				int fi=DQ[i-1].back();
				int se=DQ[i].front();
				int extra = se-fi - dist[i]; 
				chmin(cost, extra);
			}
			if(DQ[i+1].size() && DQ[i].size()) {
				int fi=DQ[i].back();
				int se=DQ[i+1].front();
				int extra = se-fi-dist[i];
				chmin(cost,extra);
			}
		}
		if(cost == oo)break;

		FOR(i,1,dlen) {
			// maybe i should do [i-1,i] now
			if(DQ[i-1].size() && DQ[i].size()) {
				int fi=DQ[i-1].back();
				int se=DQ[i].front();
				int extra = se-fi - dist[i]; 
				if(extra==cost) {
					DQ[i-1].pop_back();
					DQ[i].pop_front();
					ans += se-fi;
					goto done;
				}
			}
			if(DQ[i+1].size() && DQ[i].size()) {
				int fi=DQ[i].back();
				int se=DQ[i+1].front();
				int extra = se-fi-dist[i];
				if(extra == cost) {
					DQ[i].pop_back();
					DQ[i+1].pop_front();
					ans+=se-fi;
					goto done;
				}
			}
		}

		done:;	
	}
	db(ans);
	FOR(i,1,dlen) {
		db(i);
		dbv(DQ[i]);
		for(auto x:DQ[i])ans+=dist[x];
	}
	return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45