제출 #1077835

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

wiring

#include <bits/stdc++.h>

using namespace std;
#define ll long long 
#define fo(i, n) for(ll i = 0; i<(n); i++)
#define F first 
#define S second 
#define pb push_back 
#define deb(x) cout << #x << " = " << (x) << endl
#define deb2(x, y) cout << #x << " = " << (x)  << ", " << #y << " = " << (y) << endl

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

typedef vector<ll> vl;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;

vector<vector<ll>> memo;
ll n;
vpl v;

ll dp(ll pos, ll am, ll red = 1, ll changed = 0){
    if(am>10) return 1e18;
    if(pos == n) return (am?1e18:0);
    if(memo[pos][red+changed*2+am*4] != -1) return memo[pos][red+changed*2+am*4];
    ll &ans = memo[pos][red+changed*2+am*4];
    // deb2(pos, am);

    ans = 1e18;
    if(changed) ans = dp(pos+1, am, red)+(v[pos+1].F-v[pos].F)*am;
    if(am==0) ans = min(dp(pos, am+1, v[pos].S, 1), ans);
    else if(v[pos].S == red) ans = min(dp(pos, am+1, red, 1), ans);
    else ans = min(dp(pos, am-1, red, 1), ans);
    return ans;
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    sort(rall(r));
    ll i = r.size()-1;
    ll j= b.size()-1;
    ll ans = 0;
    while(i+j){
        ans+=b[j]-r[i];
        if(i)i--;
        if(j)j--;
    }
    return ans;

    // fo(i, r.size()){
    //     v.pb({r[i], 1});
    // }
    // fo(i, b.size()){
    //     v.pb({b[i], 0});
    // }
    // sort(all(v));
    // n = v.size();
    // v.pb(v[n-1]);
    // memo.assign(n+1, vl(100, -1));
	// return dp(0, 0);
}

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