제출 #219941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
219941		blacktulip	전선 연결 (IOI17_wiring)	C++17	0 / 100	6 ms	1024 KiB

wiring

#include "wiring.h"

#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
//~ #define int long long
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

lo n,m,b[li],a[li],k,flag,t,dp[304][304];
lo cev;
string s;
vector<int> v;
queue<PII> q;

inline lo f(lo x,lo y,vector<int> r1,vector<int> r2){
	lo cevv=inf;
	if(x>=(int)r1.size())return inf;
	if(y>=(int)r2.size())return 0;
	if(~dp[x][y])return dp[x][y];
	cevv=min(cevv,f(x+1,y+1,r1,r2)+abs(r2[y]-r1[x]));
	cevv=min(cevv,f(x+1,y,r1,r2)+abs(r2[y]-r1[x]));
	cevv=min(cevv,f(x,y+1,r1,r2)+abs(r2[y]-r1[x]));
	return dp[x][y]=cevv;
}

long long min_total_length(vector<int> r, vector<int> b) {
	memset(dp,-1,sizeof(dp));
	//~ lo at=0,bt=0;
	if(r.size()>b.size())swap(r,b);
	cev=f(0,0,r,b);
	memset(dp,-1,sizeof(dp));
	reverse(b.begin(),b.end());
	cev=min(cev,f(0,0,r,b));
	memset(dp,-1,sizeof(dp));
	reverse(b.begin(),b.end());
	reverse(r.begin(),r.end());
	cev=min(cev,f(0,0,r,b));
	return cev;
}

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