Submission #931959

#	Time	Username	Problem	Language	Result	Execution time	Memory
931959		skyvn97	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	2396 KiB

boxes

#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

/**
  Input format:
  - Dong 1: N K L
  - Dong 2: pos[0] pos[1] ... pos[N - 1]
  Output format: in ra ket qua ham delivery.
**/

int main(void) {
//    freopen("sample.in", "r", stdin);

    int n, k, l; cin >> n >> k >> l;
    int pos[10000];
    for (int i = 0; i < n; i++) cin >> pos[i];

    cout << delivery(n, k, l, pos) << endl;
}

#endif // SKY

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30