QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#149597#2785. Boxes with souvenirsAbdelmagedNour#Compile Error//C++20559b2023-08-24 22:39:042023-08-24 22:39:05

Judging History

你现在查看的是测评时间为 2023-08-24 22:39:05 的历史记录

  • [2024-07-04 01:51:30]
  • 管理员手动重测该提交记录
  • [2023-08-24 22:39:05]
  • 评测
  • [2023-08-24 22:39:04]
  • 提交

answer

#include <vector>
#include <cmath>
#include "algorithm"
#include "numeric"
using namespace std;
//#include "grader.cpp"
#include "boxes.h"

long long delivery(int N, int K, int L, int p[]){
    vector<long long>pre(K+1),suf(K+1);
    long long res=LLONG_MAX;
    for(int i=K-1;i<N;i++)suf[i%K]+=L-p[i];
    for(int i=K-1;i<N;i++){
        int l=p[i-K+1],r=p[i];
        suf[i%K]-=L-p[i];
        if(i>=K)pre[i%K]+=p[i-K];
        int cost=min({L,2*r,2*(L-l)});
        res=min(res,cost+2*pre[i%K]+2*suf[(i+1)%K]);
    }
    return res;
}

詳細信息

answer.code: In function ‘long long int delivery(int, int, int, int*)’:
answer.code:11:19: error: ‘LLONG_MAX’ was not declared in this scope
   11 |     long long res=LLONG_MAX;
      |                   ^~~~~~~~~
answer.code:8:1: note: ‘LLONG_MAX’ is defined in header ‘<climits>’; did you forget to ‘#include <climits>’?
    7 | #include "boxes.h"
  +++ |+#include <climits>
    8 |