제출 #393216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393216		definitelynotmee	선물상자 (IOI15_boxes)	C++98	100 / 100	583 ms	293944 KiB

boxes

#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const int MAXN = 0;



ll delivery (int n, int k, int l, int p[]){
    
    vector<ll> respl(n), respr(n);
    
    for(int i = 0; i < n; i++){
        respl[i] = p[i]*2;
        if(i-k >= 0){
            respl[i]+=respl[i-k];
        }
    }
    //cerr << 'a' << endl;
    for(int i = n-1; i >= 0; i--){
        respr[i] = (l-p[i])*2;
        if(i+k < n){
            respr[i]+= respr[i+k];
        }
    }
    //cerr << 'a' << endl;
    ll resp = INFL;
    for(int i = 0; i <= n; i++){ // testando para não ter ciclo
        resp = min(resp, (i > 0? respl[i-1] : 0) + (i< n ? respr[i] : 0));
    }
    //cerr << 'a' << endl;
    for(int i = 0; i < n; i++){ // intervalo vai de i até i+k-1
        if(i+k > n)
            break;
        resp = min(resp, (i > 0? respl[i-1] : 0) + (i+k < n? respr[i+k] : 0) + l);
    }
    return resp;
}

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