제출 #118938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118938		oolimry	선물상자 (IOI15_boxes)	C++14	25 / 100	2 ms	512 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
    long long n, k, l;
    n = N, k = K, l = L;
    long long left[n];
    long long right[n];
    for(int i = 0;i < n;i++){
        if(i < k) left[i] = 2*p[i];
        else left[i] = left[i-k] + p[i] * 2;
    }
    for(int i = n-1;i >= 0;i--){
        if(i + k >= n) right[i] = (l - p[i]) * 2;
        else right[i] = right[i+k] + (l - p[i]) * 2;
    }

    //for(int i = 0;i < n;i++){
    //    cout << left[i] << " " << right[i] << "\n";
    //}

    long long circles = n;
    long long ans = min(left[n-1], right[0]);
    for(int i = -1;i < n;i++){
        long long value = 0;
        if(i != -1) value += left[i];

        while(true){
            if(circles == 0) break;

            int pnt2 = i + 1 + k * (circles - 1);
            if(pnt2 > n){
                circles--;
            }
            else if(L >= 2 * L - 2 * p[pnt2]){
                circles--;
            }
            else{
                break;
            }
        }

        value += circles * l;
        int endpnt = i + 1 + k * circles;
        if(endpnt < n) value += right[endpnt];
        //cout << i << " " << circles << "\n";
        ans = min(ans,value);
    }
    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:13:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i = n-1;i >= 0;i--){
                 ~^~
boxes.cpp:31:30: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
             int pnt2 = i + 1 + k * (circles - 1);
                        ~~~~~~^~~~~~~~~~~~~~~~~~~
boxes.cpp:44:28: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         int endpnt = i + 1 + k * circles;
                      ~~~~~~^~~~~~~~~~~~~

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