제출 #998423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
998423		whatthemomooofun1729	선물상자 (IOI15_boxes)	C++17	0 / 100	1 ms	444 KiB

boxes

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
//#define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

vll t1, t2;

void update(vll& t, int u, int tl, int tr, int pos, ll val) {
    if (tl == tr && tl == pos) {
        ckmin(t[u], val);
        return;
    }
    int mid = (tl + tr)/2;
    if (pos <= mid) update(t, 2 * u, tl, mid, pos, val);
    else update(t, 2 * u + 1, mid+1, tr, pos, val);
    t[u] = min(t[2 * u], t[2 * u + 1]);
}

ll query(vll& t, int u, int tl, int tr, int l, int r) {
    if (l > r) return INF;
    if (tl == l && tr == r) return t[u];
    int mid = (tl + tr)/2;
    ll left = query(t, 2 * u, tl, mid, l, min(mid, r));
    ll right = query(t, 2 * u + 1, mid+1, tr, max(mid+1, l), r);
    return min(left, right);
}

ll delivery(int n, int k, int l, int* positions) {
    vi p;
    for (int i = 0; i < n; ++i) {
        p.PB(positions[i]);
    }
    sort(all(p));
    vc<pii> teams{{0, 0}};
    for (int i = 0; i < n; ++i) {
        if (teams.back().ff == positions[i]) {
            teams.back().ss++;
        } else {
            teams.PB({positions[i], 1});
        }
    }
    int M = sz(teams);
    vll psum(M, 0), dp(M, INF);
    t1.rsz(4 * M, INF), t2.rsz(4 * M, INF);
    for (int i = 0; i < M; ++i) {
        psum[i] = (i > 0 ? psum[i-1] : 0) + teams[i].ss;
    }
    //debug(teams);
    int middle = int(lower_bound(all(teams), pii{l/2, INF}) - teams.begin());
    middle--; // [0, middle] U [middle+1, L-1]
    //debug(middle);
    dp[0] = 0; // position 0 means nothing
    auto check = [&](const int& j, const int& i) {
        ll sum = psum[i] - psum[j];
        return sum <= k;
    };
    update(t1, 1, 0, M-1, 0, 0);
    update(t2, 1, 0, M-1, 0, 2 * (l - 1));
    for (int i = 1; i < M; ++i) {
        //debug(i);
        int lj = 0, rj = i - 1;
        while (lj <= rj) {
            int mj = (lj + rj)/2;
            if (check(mj, i)) {
                rj = mj - 1;
            } else {
                lj = mj + 1;
            }
        }
        rj++;
        //debug(rj);
        if (i > middle) {
            ckmin(dp[i], query(t1, 1, 0, M - 1, rj, middle - 1) + l);
            ckmin(dp[i], query(t2, 1, 0, M-1, max(rj, middle), i - 1));
        } else {
            ckmin(dp[i], query(t1, 1, 0, M-1, rj, i - 1) + 2 * teams[i].ff);
        }
        //debug(dp[i]);
        update(t1, 1, 0, M-1, i, dp[i]);
        if (i < M - 1) update(t2, 1, 0, M - 1, i, dp[i] + 2 * (l - teams[i+1].ff));
    }
    return dp[M-1];
}
/*
int N, K, L;
int positions[10000];

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> K >> L;
    for (int i = 0; i < N; ++i) {
        cin >> positions[i];
    }
    cout << delivery(N, K, L, positions);
}*/

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

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

boxes.cpp: In function 'void setIO(const string&)':
boxes.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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