답안 #835678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
835678	2023-08-23T17:35:07 Z	azberjibiou	Cookies (JOI23_cookies)	C++17	6 / 100	50 ms	2260 KB

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define pdd pair<long double, long double>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ppi pair<pii, pii>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
const int mxN=505;
const int mxM=10004;
const int MOD=1e9+7;
const ll INF=8e18;
int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
int N, M, K;
int A[mxN], B[mxN];
int cnt[mxN], S[mxN];
pii dp[mxN][mxN];
int ans;
void solv(vector <int> v)
{
    int cnt=0;
    for(int ele : v)    cnt+=ele;
    cout << v.size() << '\n';
    priority_queue <pii> pq;
    for(int i=1;i<=N;i++)   pq.emplace(A[i], i);
    for(int x : v)
    {
        cout << B[x] << " ";
        vector <pii> tmp;
        for(int i=0;i<B[x];i++)
        {
            tmp.push_back(pq.top());
            pq.pop();
        }
        for(auto [a, b] : tmp)  cout << b << " ";
        cout << '\n';
        for(auto [a, b] : tmp)  if(a!=1)    pq.emplace(a-1, b);
    }
}
int main()
{
    gibon
    cin >> N;
    for(int i=1;i<=N;i++)   cin >> A[i], K+=A[i];
    for(int i=1;i<=N;i++)   for(int j=1;j<=A[i];j++)    cnt[j]++;
    for(int i=1;i<=K;i++)   S[i]=S[i-1]+cnt[i];
    cin >> M;
    for(int i=1;i<=M;i++)   cin >> B[i];
    dp[0][0]=pii(M, 0);
    for(int i=1;i<=K;i++)
    {
        for(int j=0;j<=K;j++)   if(i>N || j<=S[i])
        {
            for(int k=M;k>=1;k--)
            {
                if(j>=B[k] && dp[i-1][j-B[k]].fi>=k)
                {
                    dp[i][j]=pii(k, j-B[k]);
                    break;
                }
            }
        }
        //for(int j=0;j<=K;j++)   printf("dp[%d][%d]=(%d, %d)\n", i, j, dp[i][j].fi, dp[i][j].se);
        if(dp[i][K].fi!=0)
        {
            ans=i;
            break;
        }
    }
    if(ans==0)
    {
        cout << -1;
        return 0;
    }
    vector <int> v;
    int cur=K;
    for(int i=ans;i>=1;i--)
    {
        v.push_back(dp[i][cur].fi);
        cur=dp[i][cur].se;
    }
    solv(v);
}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	2 ms	2260 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	34 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	13 ms	1236 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	5 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	50 ms	1364 KB	Output is correct
23	Correct	43 ms	724 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	2 ms	2260 KB	Output is correct
6	Correct	0 ms	464 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	2 ms	2260 KB	Output is correct
9	Runtime error	1 ms	592 KB	Execution killed with signal 11
10	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Runtime error	1 ms	468 KB	Execution killed with signal 6
17	Halted	0 ms	0 KB	-

Subtask #4
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	2 ms	2260 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	34 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	13 ms	1236 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	5 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	50 ms	1364 KB	Output is correct
23	Correct	43 ms	724 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	336 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	0 ms	340 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	0 ms	340 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Runtime error	1 ms	468 KB	Execution killed with signal 6
45	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	2 ms	2260 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	34 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	13 ms	1236 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	5 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	50 ms	1364 KB	Output is correct
23	Correct	43 ms	724 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	336 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	0 ms	340 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	0 ms	340 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Runtime error	1 ms	468 KB	Execution killed with signal 6
45	Halted	0 ms	0 KB	-

Subtask #6
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	2 ms	2260 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	34 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	13 ms	1236 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	5 ms	468 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	50 ms	1364 KB	Output is correct
23	Correct	43 ms	724 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	2 ms	2260 KB	Output is correct
34	Correct	0 ms	464 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	2 ms	2260 KB	Output is correct
37	Runtime error	1 ms	592 KB	Execution killed with signal 11
38	Halted	0 ms	0 KB	-

답안 #835678

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 0 / 7.0

Subtask #3 0 / 12.0

Subtask #4 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
0 / 12.0

Subtask #4
0 / 45.0

Subtask #5
0 / 15.0

Subtask #6
0 / 15.0