Submission #1156594

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156594		brianhdzmdo	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include <algorithm>
#include <cmath>
#include <iostream>
#include <deque>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <map>
#include <string>
#include <utility>
#include <vector>
#include <climits>

#define all(a) (a).begin(), (a).end()
#define allr(a) (a).rbegin(), (a).rend()
#define ll long long
#define ld long double
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define fr1(i, a, b) for (ll i = a - 1; i >= b; i--)
#define fi first
#define se second
#define mp(j, k) make_pair(j, k)
#define pb(x) push_back(x)
#define in(x) insert(x)
#define vec vector<ll>
#define vecv vector<vector<ll> >
#define veb vector<bool>
#define vecp vector<pair<ll,ll>>
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define ac 1e-7
#define fauto(a)   \
  for (auto i : a) \
    cout << i << " ";
#define fautop(a)  \
  for (auto i : a) \
    cout << i.fi << " " << i.se << endl;

const ll INF = 1e9;

using namespace std;

ll solve(vector<int>& arr, int K)
{
    ll cost = 0;
    while(!arr.empty())
    {
        int farthest = arr.back();
        cost += 2 * farthest;
        arr.resize(max(0, (int)arr.size() - K));
    }

    return cost;
}

int delivery(int N, int K, int L, int *positions)
{
    vector<int> left, right;

    for(int i = 0; i < N; ++i)
    {
        if(positions[i] <= L / 2)
            left.pb(positions[i]);
        else 
            right.pb(L - positions[i]);
    }

    sort(all(left));
    sort(all(right));

    ll cost = solve(left, K) + solve(right, K);

    return cost;
}

/*int32_t main()
{
    int n, k, l; cin >> n >> k >> l;

    int positions[n];

    for(int i = 0; i < n; ++i)
        cin >> positions[i];
    
    cout << delivery(n, k, l, positions) << "\n";
}*/

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