제출 #1305173

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