Submission #619571

#	Time	Username	Problem	Language	Result	Execution time	Memory
619571		Mounir	선물상자 (IOI15_boxes)	C++14	100 / 100	556 ms	197912 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define chmax(x, v) x = max(x, v)
#define chmin(x, v) x = min(x, v)
#define pii pair<int, int>
#define pb push_back
#define sz(x) (int)x.size()
#define x first
#define y second
#define int long long
using namespace std;
 
const int OO = 1e18;
 
int delivery(signed nTeams, signed bSup, signed nSections, signed p[]) {
    int doGauche[nTeams], doDroite[nTeams];
    for (int i = 0; i < nTeams; ++i){
        doGauche[i] = min(nSections, 2 * p[i]);
        if (i >= bSup)
            doGauche[i] += doGauche[i - bSup];
    }

    for (int i = nTeams - 1; i >= 0; --i){
        doDroite[i] = min(nSections, 2 * (nSections - p[i]));
        if (i + bSup <= nTeams - 1)
            doDroite[i] += doDroite[i + bSup];
    }

    int mini = OO;
    for (int i = -1; i < nTeams; ++i){
        int cur = 0;
        if (i != -1)
            cur += doGauche[i];
        if (i != nTeams - 1)    
            cur += doDroite[i + 1];
        chmin(mini, cur);
    }
    return mini;
}
 

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