제출 #1195710

#제출 시각아이디문제언어결과실행 시간메모리
1195710clementine선물상자 (IOI15_boxes)C++20
0 / 100
0 ms324 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 ans = 0;
    for(int i = 0; i <n; i ++)
    {
        ans += 2 * (min(p[i], n - p[i]));
    }
    return ans;
}
#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...