제출 #1265667

#제출 시각아이디문제언어결과실행 시간메모리
1265667martin_011선물상자 (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long delivery(int n, int k, int l, int p[]) {
    ll res=0;
    for (int i=0; i<n; i++) {
        ll x1, x2;
        x1 = p[i];
        x2 = l - p[i];
        res += min(x1, x2);
    }
    res *= 2;
    return res;
}
#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...