답안 #99100 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99100	2019-02-28T17:19:45 Z	eriksuenderhauf	선물상자 (IOI15_boxes)	C++11	100 / 100	796 ms	198008 KB

boxes

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "boxes.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e7 + 5;
const double eps = 1e-9;
ll dp[MAXN][2];

ll delivery(int n, int k, int l, int a[]) {
    sort(a, a + n);
    for (int i = 0; i < k; i++)
        dp[i][0] = min(a[i] * 2, l);
    for (int i = k; i < n; i++)
        dp[i][0] = dp[i - k][0] + min(a[i] * 2, l);
    for (int i = n - 1; i >= n - k; i--)
        dp[i][1] = min((l - a[i]) * 2, l);
    for (int i = n - k - 1; i >= 0; i--)
        dp[i][1] = dp[i + k][1] + min((l - a[i]) * 2, l);
    ll ret = dp[0][1];
    for (int i = 0; i < n; i++)
        ret = min(ret, dp[i][0] + dp[i + 1][1]);
    return ret;
}

/*int main()
{

    return 0;
}*/

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	256 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	3 ms	256 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	256 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	372 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	3 ms	256 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	3 ms	256 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	256 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	372 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	3 ms	256 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	81 ms	29736 KB	Output is correct
34	Correct	44 ms	21880 KB	Output is correct
35	Correct	48 ms	22364 KB	Output is correct
36	Correct	79 ms	29672 KB	Output is correct
37	Correct	74 ms	29684 KB	Output is correct
38	Correct	79 ms	29844 KB	Output is correct
39	Correct	70 ms	28100 KB	Output is correct
40	Correct	49 ms	23544 KB	Output is correct
41	Correct	81 ms	29840 KB	Output is correct
42	Correct	55 ms	23800 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	3 ms	256 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	256 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	372 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	3 ms	256 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	81 ms	29736 KB	Output is correct
34	Correct	44 ms	21880 KB	Output is correct
35	Correct	48 ms	22364 KB	Output is correct
36	Correct	79 ms	29672 KB	Output is correct
37	Correct	74 ms	29684 KB	Output is correct
38	Correct	79 ms	29844 KB	Output is correct
39	Correct	70 ms	28100 KB	Output is correct
40	Correct	49 ms	23544 KB	Output is correct
41	Correct	81 ms	29840 KB	Output is correct
42	Correct	55 ms	23800 KB	Output is correct
43	Correct	795 ms	197924 KB	Output is correct
44	Correct	506 ms	196472 KB	Output is correct
45	Correct	492 ms	196472 KB	Output is correct
46	Correct	738 ms	198008 KB	Output is correct
47	Correct	691 ms	197932 KB	Output is correct
48	Correct	740 ms	197892 KB	Output is correct
49	Correct	751 ms	197712 KB	Output is correct
50	Correct	570 ms	196828 KB	Output is correct
51	Correct	796 ms	197896 KB	Output is correct
52	Correct	541 ms	196828 KB	Output is correct

답안 #99100

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 30.0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
30.0 / 30.0