제출 #440313

#제출 시각아이디문제언어결과실행 시간메모리
440313ToroTN선물상자 (IOI15_boxes)C++14
0 / 100
1 ms332 KiB
#include<bits/stdc++.h>
using namespace std;
#include "boxes.h"
long long n,m,l,a[10000005],dp1[10000005],dp2[10000005],ans=1e18;
long long delivery(int N, int K, int L, int p[]) {
    n=N;
    m=K;
    l=L;
    for(int i=1;i<=n;i++)
    {
        a[i]=p[i];
    }
    dp1[0]=0;
    dp2[0]=0;
    for(int i=1;i<min(n,m);i++)
    {
        dp1[i]=min(l,2*(long long)i);
    }
    for(int i=m;i<n;i++)
    {
        dp1[i]=dp1[i-m]+min(l,2*(long long)i);
    }
    for(int i=n-1;i>max((long long)0,n-m+1);i--)
    {
        dp2[i]=min(l,(n-(long long)i)*2);
    }
    for(int i=n-m;i>=1;i--)
    {
        dp2[i]=dp2[i+m]+min(l,2*(n-(long long)i));
    }
    ans=min(ans,dp1[n-1]+dp2[0]);
    for(int i=0;i<n-1;i++)
    {
        ans=min(ans,dp1[i]+dp2[i+1]);
    }
    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:19:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   19 |     for(int i=m;i<n;i++)
      |               ^
boxes.cpp:23:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   23 |     for(int i=n-1;i>max((long long)0,n-m+1);i--)
      |               ~^~
boxes.cpp:27:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   27 |     for(int i=n-m;i>=1;i--)
      |               ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...