제출 #1198999

#제출 시각아이디문제언어결과실행 시간메모리
1198999TroySer선물상자 (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; using ll = long long; ll delivery(int N, int K, int L, int p[]) { ll totSum = 0; for (ll i = 0; i < N; i++) { totSum += 2 * min(p[i], L - p[i]); } return totSum; }
#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...