제출 #613635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
613635		rrrr10000	전선 연결 (IOI17_wiring)	C++14	13 / 100	57 ms	9732 KiB

wiring

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef tuple<ll,ll,ll> PP;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pb emplace_back
template<class T> void out(T a){cout<<a<<endl;}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<endl;}
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
const ll inf=1001001001001001001;

#include "wiring.h"

long long min_total_length1(std::vector<int> r, std::vector<int> b) {
	vp v;
    rep(i,r.size())v.pb(r[i],0);
    rep(i,b.size())v.pb(b[i],1);
    sort(all(v));
    ll n=v.size();
    vi dp(n+1,inf);
    dp[0]=0;
    rep(i,n)REP(j,i+1,n+1){
        vi dif;
        REP(k,i,j-1)if(v[k].se!=v[k+1].se)dif.pb(k);
        if(dif.size()!=1)continue;
        ll sum=0;
        REP(k,i,dif[0]+1)sum-=v[k].fi;
        REP(k,dif[0]+1,j)sum+=v[k].fi;
        sum+=max(0ll,(j-dif[0]-1)-(dif[0]+1-i))*(-v[dif[0]].fi);
        sum+=max(0ll,-(j-dif[0]-1)+(dif[0]+1-i))*v[dif[0]+1].fi;
        rep(t,j+1)chmin(dp[t],dp[i]+sum);
    }
    return dp[n];
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
	vp v;
    rep(i,r.size())v.pb(r[i],0);
    rep(i,b.size())v.pb(b[i],1);
    sort(all(v));
    vector<pair<vi,ll>> al;
    for(auto x:v){
        if(al.size()==0||al.back().se!=x.se)al.pb(vi{x.fi},x.se);
        else al.back().fi.pb(x.fi);
    }
    vi dp(al[0].fi.size(),inf);dp[0]=0;
    REP(i,1,al.size()){
        vi ndp(al[i].fi.size(),inf);
        ll mi=inf,rui=0;
        rep(j,al[i].fi.size()){
            if(j<al[i-1].fi.size()){
                ll tmp=al[i-1].fi[al[i-1].fi.size()-j-1];
                rui-=tmp;
                chmin(mi,dp[al[i-1].fi.size()-j-1]+rui+al[i-1].fi.back()*j);
            }
            chmin(ndp[j],mi-al[i-1].fi.back()*j);
        }
        mi=inf;rui=0;
        rep(j,al[i-1].fi.size())rui-=al[i-1].fi[j];
        rep(j,al[i-1].fi.size()){
            chmin(mi,dp[j]+rui+(ll)(al[i-1].fi.size()-j)*al[i].fi[0]);
            rui+=al[i-1].fi[j];
            if(al[i-1].fi.size()-j-1<al[i].fi.size()){
                chmin(ndp[al[i-1].fi.size()-j-1],mi-(ll)(al[i-1].fi.size()-j)*al[i].fi[0]);
            }
        }
        rui=0;
        rep(j,al[i].fi.size()){
            rui+=al[i].fi[j];
            ndp[j]+=rui;
        }
        if(i==al.size()-1)return ndp.back();
        vi nndp(al[i].fi.size()+1);
        nndp[0]=dp.back();
        rep(j,ndp.size())nndp[j+1]=ndp[j];
        for(int j=ndp.size()-1;j>0;j--)chmin(ndp[j-1],ndp[j]);
        dp=nndp;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:61:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             if(j<al[i-1].fi.size()){
      |                ~^~~~~~~~~~~~~~~~~~
wiring.cpp:82:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<std::vector<long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |         if(i==al.size()-1)return ndp.back();
      |            ~^~~~~~~~~~~~~
wiring.cpp:47:5: warning: control reaches end of non-void function [-Wreturn-type]
   47 |  vp v;
      |     ^

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