Submission #421253

#	Time	Username	Problem	Language	Result	Execution time	Memory
421253		errorgorn	전선 연결 (IOI17_wiring)	C++17	17 / 100	536 ms	7988 KiB

wiring

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include "wiring.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

vector<ii> v;

const int BUF=205;
ll memo[2][410];

long long min_total_length(std::vector<int> R, std::vector<int> B) {
	for (auto &it:R) v.pub(ii(it,1));
	for (auto &it:B) v.pub(ii(it,-1));
	
	sort(all(v));
	
	memset(memo,63,sizeof(memo));
	int a=0,b=1;
	memo[a][BUF]=0;
	
	
	int p=0;
	for (auto &it:v){
		rep(x,0,410) memo[a][x]+=(it.fi-p)*abs(x-BUF);
		p=it.fi;
		
		memset(memo[b],63,sizeof(memo[b]));
		
		if (it.se==-1){
			rep(x,409,0){
				memo[b][x]=min(memo[b][x+1],memo[a][x+1]);
			}
		}
		else{
			rep(x,1,410){
				memo[b][x]=min(memo[b][x-1],memo[a][x-1]);
			}
		}
		
		swap(a,b);
	}
	
	return memo[a][BUF];
}

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