제출 #96781

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96781		updown1	선물상자 (IOI15_boxes)	C++17	100 / 100	805 ms	281124 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, N)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e endl//"\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
//500,000,000 operations
const int MAXN = 10000000;
//Global Variables
ll vals[MAXN], N2, dpfor[MAXN], dpbck[MAXN];

long long delivery(int N, int K, int L, int p[]) {
    /// remove 0s
    ffj if (p[j] != 0) {
        vals[N2] = p[j];
        N2++;
    }
    N = N2;
    ffi {
        if (i < K) dpfor[i] = min((ll)L, 2*vals[i]); /// 1 trip is always optimal
        else dpfor[i] = min((ll)L, 2*vals[i]) + dpfor[i-K];
        //w<< i c dpfor[i]<<e;
    }
    for (int i=N-1; i>=0; i--) {
        if (i >= N-K) dpbck[i] = min((ll) L, 2*(L-vals[i]));
        else dpbck[i] = min((ll) L, 2*(L-vals[i])) + dpbck[i+K];
        //w<< i c dpbck[i]<<e;
    }
    ll ret = min(dpfor[N-1], dpbck[0]);
    For (i, 1, N) ret = min(ret, dpfor[i-1]+dpbck[i]);
    return ret;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:29:9: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     N = N2;
         ^~

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