제출 #402919

#제출 시각아이디문제언어결과실행 시간메모리
402919EJOI2019Andrew선물상자 (IOI15_boxes)C++14
20 / 100
1 ms296 KiB
#include "boxes.h"

  #include<bits/stdc++.h>
using namespace std;
long long mn(int a,int b)
{
     if(a<b)
return a;

 return b;
}
long long delivery(int N, int K,int L, int p[]) {
    
    if(K==N)
    {
        
        sort(p, p+N);
        int mid = L/2;
        int sum = 0;
        for(int i = 0; i < N; i++)
            {
            if(p[i] <= mid)
            {
                
                sum = p[i]*2;
            }
            else if(p[i] > mid)
                {
                sum+=((L-p[i])*2);
            break;
            }
        }
        return min(sum, L);
    }
  if(K==1)
    {
       long long ans = 0;
        for(int i = 0; i < N; ++i)
            ans+=mn(p[i],L-p[i])*2;
        return ans;
    }
    
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:43:1: warning: control reaches end of non-void function [-Wreturn-type]
   43 | }
      | ^
#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...