제출 #115355

#제출 시각아이디문제언어결과실행 시간메모리
115355socho선물상자 (IOI15_boxes)C++14
10 / 100
4 ms384 KiB
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    if (K == 1) {
        long long sm = 0;
        for (int i=0; i<N; i++) {
            long long res = min(p[i], L-p[i]);
            sm += res;
        }
        return sm * 2;
    }
    return 0;
}

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