제출 #992659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992659		whatthemomooofun1729	선물상자 (IOI15_boxes)	C++17	0 / 100	188 ms	524288 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);
}

int delivery(int n, int k, int l, int positions[]) {
    int N, K, L;
    N = n, K = k, L = l;
    vi a(L);
    for (int i = 0; i < N; ++i) {
        a[positions[i]]++;
    }
    int m = L/2, lend = -1, rend = -1, moves = 0;
    for (int i = m; i >= 1; --i) {
        if (a[i] > 0) {
            lend = i + 1;
            break;
        }
    }
    for (int i = m+1; i < L; ++i) {
        if (a[i] > 0) {
            rend = i - 1;
            break;
        }
    }
//    debug(a);
//    debug(lend, rend);
    if (lend != -1) { // otherwise we are done
        while (1) {
            int left = K, i;
            for (i = 1; i < lend; i++) {
                int diff = min(left, a[i]);
                a[i] -= diff;
                left -= diff;
                //debug(diff, left);
                if (left == 0) break;
            }
            //debug(i);
            if (i == lend || (i == lend - 1 && a[i] == 0)) {
                moves += 2 * (lend - 1);
                break;
            }
            moves += 2 * i;
        }
    }
    //debug(moves);
    if (rend != -1) {
        while (1) {
            int left = K, i;
            for (i = L - 1; i > rend; i--) {
                int diff = min(left, a[i]);
                a[i] -= diff;
                left -= diff;
                if (left == 0) break;
            }
            //debug(i);
            if (i == rend || (i == rend + 1 && a[i] == 0)) {
                moves += 2 * (L - (rend + 1));
                break;
            }
            moves += 2 * (L - i);
        }
    }
    return moves;
}

/*
signed main() { // TIME YOURSELF !!!
    setIO("");
    int n, k, l;
    int positions[20];
    cin >> n >> k >> l;
    for (int i = 0; i < n; ++i) {
        cin >> positions[i];
    }
    cout << delivery(n, k, l, positions);
    return 0;
}
 */

// 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