Submission #1236686

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

deque<ll> deq;

ll delivery(int n, int k, int L, int p[]) 
{
    rep(i,n)
    {
        deq.push_front(p[i]);
    }
    ll ans = 0;
    while(siz(deq) > 0)
    {
        ll poz = 0;
        bool type = 0;
        if(deq.back() > (L - deq.back()))
        {
            type = 1;
        }
        int moves = min(k,siz(deq));
        rep(i,moves)
        {
            if(type == 0)
            {
                ans += abs(poz - deq.back());
                poz = deq.back();
                deq.pop_back();
            }
            else
            {
                ans += min(abs(poz - deq.front()),L-abs(poz - deq.front()));
                poz = deq.front();
                deq.pop_front();
            }
        }
        ans += min(poz,L-poz);
    }
    return ans;
}

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