제출 #157169

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
157169		AKaan37	Wiring (IOI17_wiring)	C++17	7 / 100	1072 ms	8424 KiB

wiring

//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include "wiring.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#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 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,mx,mn=inf,dp[205][205];
int cev;
queue<lo> q,q1;
map<lo,lo> PS;
string s;
vector<PII> v;

inline lo f(lo l,lo rr,vector<int>r,vector<int>b){
	lo cevv=inf;
	//~ if(l==n && rr==m-1)return 0;
	//~ if(l==n-1 && rr==m)return 0;
	if(l==n && rr==m)return 0;
	if(l>n || rr>m || (rr==m && l!=n) || (rr!=m && l==n))return inf;
	
	if(~dp[l][rr])return dp[l][rr];
	cevv=min(cevv,f(l+1,rr,r,b)+abs(b[rr]-r[l]));
	cevv=min(cevv,f(l,rr+1,r,b)+abs(b[rr]-r[l]));
	cevv=min(cevv,f(l+1,rr+1,r,b)+abs(b[rr]-r[l]));
	return dp[l][rr]=cevv;
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	memset(dp,-1,sizeof(dp));
	for(lo i=0;i<(lo)r.size();i++){v.pb(mp(r[i],1));}
	for(lo i=0;i<(lo)b.size();i++){v.pb(mp(b[i],2));}
	n=r.size();
	m=b.size();
	PS[-1]=0;
	//~ if(m>n){
		//~ swap(n,m);
		//~ swap(b,r);
	//~ }
	//~ cout<<"**\n";
	for(lo i=0;i<(lo)b.size();i++){
		cev=2000000000;
		for(lo j=0;j<(lo)r.size();j++){
			cev=min(cev,abs(r[j]-b[i]));
		}
		if(i==0)PS[i]=cev;
		else PS[i]=PS[i-1]+cev;
	}
	//~ cout<<"**\n";
	return f(0,0,r,b);
}

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