Submission #633939

#	Time	Username	Problem	Language	Result	Execution time	Memory
633939		ghostwriter	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	340 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Practising for VOI23 gold medal
*/
const int N = 1e7 + 5;
int n, m1, m2, k, l, p[N], a[N], b[N];
ll d1[N], d2[N];
long long delivery(int N, int K, int L, int p[]) {
    n = N;
    k = K;
    l = L;
    FOR(i, 0, n - 1) ::p[i] = p[i];
    FOR(i, 0, n - 1)
        if (p[i] <= l / 2) a[++m1] = p[i];
        else b[++m2] = p[i];
    reverse(a + 1, a + 1 + m1);
    // FOR(i, 1, m1) cerr << a[i] << ' ';
    // cerr << '\n';
    // FOR(i, 1, m2) cerr << b[i] << ' ';
    // cerr << '\n';
    FOS(i, m1, 1) {
        if (i + k <= m1) d1[i] = min(2 * a[i] + d1[i + k], l + d1[i + k]);
        else d1[i] = min(2 * a[i], l);
        // debug(i, d1[i]);
    }
    FOS(i, m2, 1) {
        if (i + k <= m2) d2[i] = min(2 * (l - b[i]) + d2[i + k], l + d2[i + k]);
        else d2[i] = min(2 * (l - b[i]), l);
        // debug(i, d2[i]);
    }
    ll rs = d1[1] + d2[1];
    // debug(rs);
    FOR(i, 1, m1) {
        if (k % i > m2) {
            rs = min(rs, l + d1[i + 1]);
            continue;
        }
        rs = min(rs, d1[i + 1] + 1LL * (i + k - 1) / k * l + d2[k % i + 1]);
    }
    return rs;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:41:45: warning: declaration of 'p' shadows a global declaration [-Wshadow]
   41 | long long delivery(int N, int K, int L, int p[]) {
      |                                         ~~~~^~~
boxes.cpp:39:22: note: shadowed declaration is here
   39 | int n, m1, m2, k, l, p[N], a[N], b[N];
      |                      ^
boxes.cpp:41:24: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   41 | long long delivery(int N, int K, int L, int p[]) {
      |                    ~~~~^
boxes.cpp:38:11: note: shadowed declaration is here
   38 | const int N = 1e7 + 5;
      |           ^
boxes.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boxes.cpp:45:5: note: in expansion of macro 'FOR'
   45 |     FOR(i, 0, n - 1) ::p[i] = p[i];
      |     ^~~
boxes.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boxes.cpp:46:5: note: in expansion of macro 'FOR'
   46 |     FOR(i, 0, n - 1)
      |     ^~~
boxes.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
boxes.cpp:54:5: note: in expansion of macro 'FOS'
   54 |     FOS(i, m1, 1) {
      |     ^~~
boxes.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
boxes.cpp:59:5: note: in expansion of macro 'FOS'
   59 |     FOS(i, m2, 1) {
      |     ^~~
boxes.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boxes.cpp:66:5: note: in expansion of macro 'FOR'
   66 |     FOR(i, 1, m1) {
      |     ^~~

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