제출 #800512

#제출 시각아이디문제언어결과실행 시간메모리
800512firewater선물상자 (IOI15_boxes)C++14
0 / 100
1 ms212 KiB
#include "boxes.h"
#include <stdio.h>
#include <stdlib.h>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;



















#define N 100100
ll n,k,m,ans,a[N];
long long delivery(int NN, int K, int L, int ppp[]) {
    n=NN;
    k=K;
    m=L;
    for(ll i=1;i<=n;++i)
        a[i]=ppp[i-1];

    
    return min(min(m-a[0],a[n])*2,m);
}






#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...