oj.uz

Submission #633965

# Submission time Handle Problem Language Result Execution time Memory
633965 2022-08-23T14:10:22 Z ghostwriter Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 703 ms 293876 KB 
#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];
ll 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);
    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) {
        rs = min(rs, 1LL * (i + k - 1) / k * l + d1[i + 1] + d2[(k - i % k) % k + 1]);
        // debug(i, 1LL * (i + k - 1) / k * l);
    }
    return rs;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:41:38: warning: declaration of 'p' shadows a global declaration [-Wshadow]
   41 | ll 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:17: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   41 | ll 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:50:5: note: in expansion of macro 'FOS'
   50 |     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:55:5: note: in expansion of macro 'FOS'
   55 |     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:62:5: note: in expansion of macro 'FOR'
   62 |     FOR(i, 1, m1) {
      |     ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 312 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 312 KB Output is correct
33 Correct 59 ms 29604 KB Output is correct
34 Correct 32 ms 21764 KB Output is correct
35 Correct 32 ms 22356 KB Output is correct
36 Correct 49 ms 29624 KB Output is correct
37 Correct 49 ms 29700 KB Output is correct
38 Correct 64 ms 29728 KB Output is correct
39 Correct 51 ms 28172 KB Output is correct
40 Correct 33 ms 23592 KB Output is correct
41 Correct 50 ms 29656 KB Output is correct
42 Correct 27 ms 23772 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 312 KB Output is correct
33 Correct 59 ms 29604 KB Output is correct
34 Correct 32 ms 21764 KB Output is correct
35 Correct 32 ms 22356 KB Output is correct
36 Correct 49 ms 29624 KB Output is correct
37 Correct 49 ms 29700 KB Output is correct
38 Correct 64 ms 29728 KB Output is correct
39 Correct 51 ms 28172 KB Output is correct
40 Correct 33 ms 23592 KB Output is correct
41 Correct 50 ms 29656 KB Output is correct
42 Correct 27 ms 23772 KB Output is correct
43 Correct 600 ms 292688 KB Output is correct
44 Correct 271 ms 215584 KB Output is correct
45 Correct 332 ms 223476 KB Output is correct
46 Correct 703 ms 293772 KB Output is correct
47 Correct 544 ms 293752 KB Output is correct
48 Correct 514 ms 293876 KB Output is correct
49 Correct 533 ms 278496 KB Output is correct
50 Correct 329 ms 232464 KB Output is correct
51 Correct 519 ms 293652 KB Output is correct
52 Correct 266 ms 235076 KB Output is correct