제출 #373828

#제출 시각아이디문제언어결과실행 시간메모리
373828victoriad선물상자 (IOI15_boxes)C++14
0 / 100
1 ms364 KiB
long long delivery(int N, int K, int L, int p[]) { if(K==N){ return L; } else if(K==1){ long long x=0; for(int i=0;i<N;i++){ x+=2*p[i]; } return x; } 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...