oj.uz

Submission #835959

# Submission time Handle Problem Language Result Execution time Memory
835959 2023-08-24T01:01:24 Z azberjibiou Cookies (JOI23_cookies) C++17
0 / 100
 13 ms 12500 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=3003;
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)
{
    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);
    int idx=M;
    for(int i=0;i<K/B[1];i++)
    {
        while(i>=K/B[idx])  idx--;
        for(int j=0;j<=S[i];j++)    if(dp[i][j].fi!=0)
        {
            for(int k=idx;k>=1;k--)
            {
                if(j+B[k]<=S[i+1])
                {
                    dp[i+1][j+B[k]]=max(dp[i+1][j+B[k]], pii(k, j));
                    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+1][K].fi!=0)
        {
            ans=i+1;
            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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 13 ms 12500 KB Output is correct
10 Runtime error 2 ms 468 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -