제출 #250073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
250073		hhh07	선물상자 (IOI15_boxes)	C++14	0 / 100	1 ms	384 KiB

boxes

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <set>
#include <cmath>
#include <climits>
#include <cstring>
 
using namespace std;
 
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
 
ll delivery(int n, int k, int l, int pos[]){
    ll dp1[n], dp2[n];
    for (ll i = 0; i < n; i++){
        if (i >= k)
            dp1[i] = dp1[i - k] + 2*pos[i];
        else
            dp1[i] = 2*pos[i];
    }
    
    for (ll i = n - 1; i >= 0; i--){
        int curr = (n - 1) - i;
        if (curr >= k)
            dp2[curr] = dp2[curr - k] + 2*(l - pos[i]);
        else
            dp2[curr] = 2*(l - pos[i]);
    }
    ll res = LLONG_MAX;
    for (ll i = 0; i < n; i++){
        int j = (n - i - 2);
        res = min(res, dp1[i] + dp2[j]);
        
        if (j >= k)
            res = min(res, dp1[i] + l + dp2[j - k]);
    }
    
    return res;
}

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

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:27:28: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         int curr = (n - 1) - i;
                    ~~~~~~~~^~~
boxes.cpp:35:24: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         int j = (n - i - 2);
                 ~~~~~~~^~~~

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