답안 #1094425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094425	2024-09-29T15:16:18 Z	_8_8_	Cookies (JOI23_cookies)	C++17	63 / 100	5 ms	2140 KB

#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 15e2 + 12, MOD = (int)1e9 + 7;
    
int n, m, b[N], s = 0, val[N], c[N], p[N];
pair<int, int> a[N];
vector<bitset<N>> dp[N];
bool check(int j, int k) {
    return (val[k] >= j);
}
void out(int res) {
    vector<int> d;
    int i = m, j = s, k = res;
    while(j) {
        if(k < (int)dp[i - 1].size() && dp[i - 1][k][j]) {
            i--;
            continue;
        }
        assert(j - b[i] >= 0);
        j -= b[i];
        k--;
        d.push_back(b[i]);
        if(k < (int)dp[i - 1].size() && dp[i - 1][k][j]) {
            i--;
        }
    }
    cout << res << '\n';
    assert((int)d.size() == res);
    for(int i:d) {
        sort(a + 1, a + n + 1);
        reverse(a + 1, a + n + 1);
        cout << i << ' ';
        for(int j = 1; j <= i; j++) {
            a[j].first--;   
            cout << a[j].second << ' ';
        }
        cout << '\n';
    }
}
void test() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].first, c[i] = a[i].first;
        s += c[i];
        a[i].second = i;
    }
    sort(a + 1, a + n + 1);
    sort(c + 1, c + n + 1);
    for(int i = 1; i <= n; i++) {
        p[i] = p[i - 1] + c[i];
    }
    int it = n;
    for(int i = s; i >= 1; i--) {
        while(it >= 1 && c[it] >= i) {
            it--;
        }
        val[i] = p[it] + (n - it) * 1ll * i;
    }
    cin >> m;
    for(int i = 1; i <= m; i++) {
        cin >> b[i];
    }
    reverse(b + 1, b + m + 1);
    for(int i = 0; i <= m; ++i) {
        int t = (i ? (s + b[i] - 1) / b[i] + 1 : 1) + 10;
        dp[i].resize(t);
        dp[i][0][0] = 1;
    }
    for(int i = 1; i <= m; i++) {
        for(int k = 1; k < dp[i].size(); k++) {
            for(int j = k * b[i]; j <= s; j++) {
                if((int)dp[i - 1].size() > k) dp[i][k][j] = dp[i - 1][k][j];
                if(j - b[i] >= 0 && ((dp[i - 1].size() > k - 1 && dp[i - 1][k - 1][j - b[i]]) || dp[i][k - 1][j - b[i]]) && check(j, k)) {
                    dp[i][k][j] = 1;
                }
            }
        }
    }
    for(int i = 1; i < dp[m].size(); i++) {
        if(dp[m][i][s]) {
            out(i);
            return;
        }
    }
    cout << -1 << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
    
    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}

Compilation message

cookies.cpp: In function 'void test()':
cookies.cpp:73:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<1512> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int k = 1; k < dp[i].size(); k++) {
      |                        ~~^~~~~~~~~~~~~~
cookies.cpp:76:56: warning: comparison of integer expressions of different signedness: 'std::vector<std::bitset<1512> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |                 if(j - b[i] >= 0 && ((dp[i - 1].size() > k - 1 && dp[i - 1][k - 1][j - b[i]]) || dp[i][k - 1][j - b[i]]) && check(j, k)) {
      |                                       ~~~~~~~~~~~~~~~~~^~~~~~~
cookies.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::bitset<1512> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i = 1; i < dp[m].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	4 ms	2140 KB	Output is correct
11	Correct	1 ms	1116 KB	Output is correct
12	Correct	2 ms	860 KB	Output is correct
13	Correct	5 ms	860 KB	Output is correct
14	Correct	2 ms	1116 KB	Output is correct
15	Correct	2 ms	860 KB	Output is correct
16	Correct	1 ms	1116 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	2 ms	1116 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Incorrect	2 ms	604 KB	Number of cookies does not match with A_i
10	Halted	0 ms	0 KB	-

Subtask #3
12.0 / 12.0

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

Subtask #4
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	4 ms	2140 KB	Output is correct
11	Correct	1 ms	1116 KB	Output is correct
12	Correct	2 ms	860 KB	Output is correct
13	Correct	5 ms	860 KB	Output is correct
14	Correct	2 ms	1116 KB	Output is correct
15	Correct	2 ms	860 KB	Output is correct
16	Correct	1 ms	1116 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	2 ms	1116 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	344 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	1 ms	600 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	1 ms	604 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	1 ms	600 KB	Output is correct
72	Correct	1 ms	604 KB	Output is correct
73	Correct	1 ms	348 KB	Output is correct
74	Correct	1 ms	560 KB	Output is correct
75	Correct	1 ms	604 KB	Output is correct
76	Correct	1 ms	604 KB	Output is correct
77	Correct	2 ms	600 KB	Output is correct
78	Correct	1 ms	604 KB	Output is correct
79	Correct	2 ms	604 KB	Output is correct
80	Correct	1 ms	604 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	1 ms	604 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	2 ms	604 KB	Output is correct
85	Correct	1 ms	604 KB	Output is correct
86	Correct	2 ms	604 KB	Output is correct
87	Correct	2 ms	604 KB	Output is correct
88	Correct	2 ms	604 KB	Output is correct
89	Correct	2 ms	604 KB	Output is correct
90	Correct	2 ms	604 KB	Output is correct
91	Correct	2 ms	604 KB	Output is correct
92	Correct	2 ms	860 KB	Output is correct
93	Correct	4 ms	1628 KB	Output is correct
94	Correct	2 ms	1368 KB	Output is correct
95	Correct	2 ms	604 KB	Output is correct
96	Correct	1 ms	604 KB	Output is correct
97	Correct	1 ms	652 KB	Output is correct

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	4 ms	2140 KB	Output is correct
11	Correct	1 ms	1116 KB	Output is correct
12	Correct	2 ms	860 KB	Output is correct
13	Correct	5 ms	860 KB	Output is correct
14	Correct	2 ms	1116 KB	Output is correct
15	Correct	2 ms	860 KB	Output is correct
16	Correct	1 ms	1116 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	2 ms	1116 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	344 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	1 ms	600 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	1 ms	604 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	1 ms	600 KB	Output is correct
72	Correct	1 ms	604 KB	Output is correct
73	Correct	1 ms	348 KB	Output is correct
74	Correct	1 ms	560 KB	Output is correct
75	Correct	1 ms	604 KB	Output is correct
76	Correct	1 ms	604 KB	Output is correct
77	Correct	2 ms	600 KB	Output is correct
78	Correct	1 ms	604 KB	Output is correct
79	Correct	2 ms	604 KB	Output is correct
80	Correct	1 ms	604 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	1 ms	604 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	2 ms	604 KB	Output is correct
85	Correct	1 ms	604 KB	Output is correct
86	Correct	2 ms	604 KB	Output is correct
87	Correct	2 ms	604 KB	Output is correct
88	Correct	2 ms	604 KB	Output is correct
89	Correct	2 ms	604 KB	Output is correct
90	Correct	2 ms	604 KB	Output is correct
91	Correct	2 ms	604 KB	Output is correct
92	Correct	2 ms	860 KB	Output is correct
93	Correct	4 ms	1628 KB	Output is correct
94	Correct	2 ms	1368 KB	Output is correct
95	Correct	2 ms	604 KB	Output is correct
96	Correct	1 ms	604 KB	Output is correct
97	Correct	1 ms	652 KB	Output is correct
98	Incorrect	2 ms	604 KB	Number of cookies does not match with A_i
99	Halted	0 ms	0 KB	-

Subtask #6
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	4 ms	2140 KB	Output is correct
11	Correct	1 ms	1116 KB	Output is correct
12	Correct	2 ms	860 KB	Output is correct
13	Correct	5 ms	860 KB	Output is correct
14	Correct	2 ms	1116 KB	Output is correct
15	Correct	2 ms	860 KB	Output is correct
16	Correct	1 ms	1116 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	2 ms	1116 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	604 KB	Output is correct
37	Incorrect	2 ms	604 KB	Number of cookies does not match with A_i
38	Halted	0 ms	0 KB	-

답안 #1094425

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 0 / 7.0

Subtask #3 12.0 / 12.0

Subtask #4 45.0 / 45.0

Subtask #5 0 / 15.0

Subtask #6 0 / 15.0

Subtask #1
6.0 / 6.0

Subtask #2
0 / 7.0

Subtask #3
12.0 / 12.0

Subtask #4
45.0 / 45.0

Subtask #5
0 / 15.0

Subtask #6
0 / 15.0