제출 #134772

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134772		tinjyu	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	2 ms	376 KiB

boxes

#include "boxes.h"
#include <iostream>
long long int n,k,l,sum[10000005][2];
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
    
    n=N;
    k=K;
    l=L;
	int mid=n;
    for(int i=0;i<n;i++)
    {
        if(l/2<p[i])
        {
            mid=i;
            break;
        }
    }
    long long tmp=0;
	for(int i=0;i<mid;i++)
    {
        if(i%k==0)tmp+=p[i];
        //cout<<tmp<<" "; 
        sum[i][0]=tmp;
    }
    //cout<<endl;
    tmp=0;
    for(int i=n-1;i>=mid;i--)
    {
        if((n-1-i)%k==0)tmp+=(l-p[i]);
        //cout<<tmp<<endl;
        sum[i][1]=tmp;
    }
    long long int ans=sum[mid-1][0]*2+sum[mid][1]*2;
    for(int i=mid-1;i>=mid-k && i>=0;i--)
    {
        tmp=sum[i][0]*2;
        if(i+k<n)tmp+=sum[i+k][1]*2;
        tmp+=l;
        ans=min(tmp,ans);
    }
    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:10:10: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  int mid=n;
          ^
boxes.cpp:28:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i=n-1;i>=mid;i--)
               ~^~

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