제출 #800504

#제출 시각아이디문제언어결과실행 시간메모리
800504firewater선물상자 (IOI15_boxes)C++14
0 / 100
1 ms308 KiB
#include "boxes.h" #include "boxes.h" #include <stdio.h> #include <stdlib.h> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define ll long long using namespace std; #define N 100100 ll n,k,l,ans,a[N]; long long delivery(int NN, int K, int L, int ppp[]) { n=NN; k=K; l=L; for(int i=1;i<=n;++i) a[i]=ppp[i]; ans=0; for(int i=1;i<=n;++i) ans+=min(a[i],l-a[i])*2; 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...