제출 #415070

#제출 시각아이디문제언어결과실행 시간메모리
415070victoriadBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms284 KiB
#include "boxes.h"
#include <vector>

using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    long long int r=0;
    if(K==1){
        for(int i=0;i<N;i++){
            r+=2*min(p[i],L-p[i]);
        }
    }
    return r;
}
#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...