제출 #931958

#제출 시각아이디문제언어결과실행 시간메모리
931958skyvn97선물상자 (IOI15_boxes)C++14
0 / 100
1 ms2400 KiB
#ifndef SKY #include "boxes.h" #endif // SKY #include<bits/stdc++.h> using namespace std; #define MAX 10001000 int numTeam, maxCapa, numPos, pos[MAX]; int dp[MAX], ahihi[MAX]; long long result; void solve(void) { result = 0; for (int i = 0; i < numTeam; i++) result += pos[i]; } long long delivery(int NN, int KK, int LL, int positions[]) { // doc du lieu numTeam = NN; maxCapa = KK; numPos = LL; for (int i = 0; i < numTeam; i++) pos[i] = positions[i]; solve(); return result; } #ifdef SKY int main(void) { cout << 123 << endl; } #endif // SKY
#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...