제출 #282138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
282138		khangal	전선 연결 (IOI17_wiring)	C++14	20 / 100	62 ms	37376 KiB

wiring

#include<bits/stdc++.h>
#include "wiring.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    ans=0;
    n = ll(r.size());
    m = ll(b.size());
    if(n<=200&&m<=200){
        vector<vector<ll>> dp(1000,vl(1000,1e9));

        dp[0][0]=0;
        // rep(i,1,n){
        //     rep(j,1,m)cout<<dp[i][j]<<" ";
        //     cout<<'\n';
        // }
        rep(i,1,n){
            rep(j,1,m){
                dp[i][j]=min({dp[i-1][j-1],dp[i-1][j],dp[i][j-1]});
                dp[i][j]+=abs(r[i-1]-b[j-1]);
            }
        }
        return dp[n][m];
    }
    rep(i,0,m-1){
        ans+=b[i]-r[n-1];
    }
    rep(i,0,n-2){
        ans+=r[n-1]-r[i];
    }
    ll dif=n-m;
    rep(i,1,dif){
        ans+=abs(b[0]-r[n-1]);
    }
    return ans;
}
// int main(){
//     vl vec,vec1;
//     vec={1,2,3,7};
//     vec1={0,4,5,6,9};
//     cout<<min_total_length(vec,vec1);
// }

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