Submission #1265685

#TimeUsernameProblemLanguageResultExecution timeMemory
1265685scalifrastico_098선물상자 (IOI15_boxes)C++20
0 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int n, int k, int l, int p[]) { int m=0; int y=0, u=INT_MAX; for(long long i=0; i<n; i++){m+=2*(min(p[i], l-p[i]));} y=min(m, l); if(k==1) return m; return y; }
#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...