제출 #574967

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

boxes

#include <bits/stdc++.h>
#include "boxes.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
ll delivery(int N, int K, int D, int pos[]) {
    ll n = N; ll k = K; ll d = D;
    vector<ll> a(n + 2);
    for (int i = 1; i <= n; i++) a[i] = pos[i - 1];
    a[n + 1] = d;
    vector<ll> p(n + 2), s(n + 2);
    for (int i = 0; i <= n + 1; i++) {
        p[i] = 2 * a[i];
        s[i] = 2 * (d - a[i]);
    }
    for (int i = k; i <= n + 1; i++) p[i] += p[i - k];
    for (int i = n - k + 1; i >= 0; i--) s[i] += s[i + k];
    ll ans = 1e18;
    for (int l = 1; l <= n; l++) {
        for (int r = l - 1; r <= n; r++) {
            ll kolko = r - l + 1;
            kolko = (kolko + k - 1) / k;
            smin(ans, p[l - 1] + s[r + 1] + kolko * d);
        }
    }
    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   20 |     for (int i = k; i <= n + 1; i++) p[i] += p[i - k];
      |                  ^
boxes.cpp:21:24: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   21 |     for (int i = n - k + 1; i >= 0; i--) s[i] += s[i + k];
      |                  ~~~~~~^~~

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