제출 #1265729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1265729		bangchan	선물상자 (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <limits.h>
#include <set>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef map<int, int> mii;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pll> vpl;

#define F first
#define S second
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define pb push_back
#define forn(i, x, n) for (ll i = x; i < n; i++)
#define fornl(i, x, n) for(ll i = x; i >= n; i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define inf 10000000000000

long long delivery(int n, int k, int l, int p[]) {
    vl x;
    set<ll> st;

    x.pb(0); x.pb(l);
    st.insert(0); st.insert(1);
    forn(i, 0, n){ 
        ll c = st.size();
        x.pb(p[i]);
        if(st.size() > c) x.pb(p[i]);
    }

    sort(all(x));

    ll mint = l;
    forn(i, 0, x.size() - 1){
        mint = min(mint, 2 * (ll(l) - (ll(p[i + 1]) - ll(p[i]))));
    }
    
    return mint;

    /*int ans = 0, t = 0, tt = 0;
    forn(i, 0, n){
       t += max(t, p[i]);
       tt += min(tt, p[i]);
    }
    ans = min(t, tt);
    return ans * 2;*/
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30