Submission #330683

#	Time	Username	Problem	Language	Result	Execution time	Memory
330683		monkey8	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	364 KiB

boxes

#include "boxes.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cstdio>
#include <utility> 
#include <queue>
#include <math.h>
#include <set>
#include <bitset>
#include <cmath>
#include <bitset>
#include <stack>
#include <cstring>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 10000010;
ll pre1[MAXN];
ll pre2[MAXN];
ll delivery(int n, int k, int l, int p[]) {
    for(int i = 0; i < n; i++) {
        if(i < k) pre1[i] = (ll)2 * (ll)p[i];
        else pre1[i] = (ll)2 * (ll)p[i] + pre1[i - k];
    }
    for(int i = n - 1; i >= 0; i--) {
        if(i > n - 1 - k) pre2[i] = (ll)2 * ((ll)l - (ll)p[i]);
        else pre2[i] = (ll)2 * ((ll)l - (ll)p[i]) + pre2[i - k];
    }
    ll ans = min(pre1[n - 1], pre2[0]);
    for(int i = 0; i < n - 1; i++)
        ans = min(ans, pre1[i] + pre2[i + 1]);
    if(n == k) return min(ans, (ll)l);
    ans = min(ans, min(pre1[n - k - 1] + (ll)l, pre2[k] + (ll)l));
    for(int i = 0; i < n - k - 1; i++)
        ans = min(ans, pre1[i] + (ll)l + pre2[i + k + 1]);
    return ans;
}

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