oj.uz

답안 #836853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
836853 2023-08-24T16:20:32 Z alvingogo Cookies (JOI23_cookies) C++14
0 / 100
 102 ms 142240 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

int main(){
    AquA;
    int n;
    cin >> n;
    vector<int> a(n);
    int s=0;
    const int gd=15005;
    vector<int> c(gd);
    for(int i=0;i<n;i++){
        cin >> a[i];
        c[a[i]]++;
        s+=a[i];
    }
    for(int i=gd-2;i>=1;i--){
        c[i]+=c[i+1];
    }
    for(int i=2;i<gd;i++){
        c[i]+=c[i-1];
    }
    int m;
    cin >> m;
    vector<int> b(m+1);
    for(int i=1;i<=m;i++){
        cin >> b[i];
    }
    sort(b.begin()+1,b.end(),greater<int>());
    vector<vector<bitset<gd> > > bt(gd);
    vector<bitset<gd> > lp(gd);
    for(int i=1;i<gd;i++){
        lp[i]|=lp[i-1];
        for(int j=c[i-1]+1;j<=c[i];j++){
            lp[i][j]=1;
        }
    }
    bt[0].resize(m+1);
    bt[0][0][0]=1;
    for(int i=0;i<gd;i++){
        for(int j=0;j<m && i*(b[j+1])<gd;j++){
            bt[i][j+1]|=bt[i][j];
        }
        int cnt=0;
        for(int j=1;j<=m && (i+1)*b[j]<gd;j++){
            cnt=j;
        }
        bt[i+1].resize(cnt+1);
        for(int j=1;j<=m && (i+1)*b[j]<gd;j++){
            bt[i+1][j]|=(bt[i][j]<<b[j])&lp[i+1];
        }
    }
    for(int i=0;i<gd;i++){
        for(int j=0;j<=m;j++){
            if(bt[i][j][s]){
                vector<int> k;
                while(i>0 && j>0){
                    if(i>0 && bt[i-1][j][s-b[j]]){
                        k.push_back(b[j]);
                        s-=b[j];
                        i--;
                    }
                    else{
                        j--;
                    }
                }
                p_q<pair<int,int> > pq;
                for(int f=0;f<n;f++){
                    pq.push({a[f],f});
                }
                cout << k.size() << "\n";
                for(auto h:k){
                    vector<pair<int,int> > d;
                    cout << h << ' ';
                    for(int p=0;p<h;p++){
                        d.push_back(pq.top());
                        pq.pop();
                    }
                    for(auto z:d){
                        pq.push({z.fs-1,z.sc});
                        cout << z.sc+1 << " ";
                    }
                    cout << "\n";
                }
                return 0;
            }
        }
    }
    cout << -1 << "\n";
    return 0;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 83656 KB Output is correct
2 Correct 42 ms 83656 KB Output is correct
3 Correct 44 ms 83660 KB Output is correct
4 Correct 34 ms 69844 KB Output is correct
5 Correct 41 ms 83572 KB Output is correct
6 Correct 38 ms 74316 KB Output is correct
7 Correct 38 ms 72532 KB Output is correct
8 Correct 47 ms 83764 KB Output is correct
9 Correct 33 ms 56020 KB Output is correct
10 Correct 42 ms 84556 KB Output is correct
11 Runtime error 102 ms 142240 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 62932 KB Output is correct
2 Correct 44 ms 83660 KB Output is correct
3 Correct 44 ms 83700 KB Output is correct
4 Correct 35 ms 69844 KB Output is correct
5 Correct 44 ms 83660 KB Output is correct
6 Correct 29 ms 56012 KB Output is correct
7 Correct 44 ms 83660 KB Output is correct
8 Correct 47 ms 83660 KB Output is correct
9 Correct 47 ms 83788 KB Output is correct
10 Correct 47 ms 83916 KB Output is correct
11 Correct 43 ms 83660 KB Output is correct
12 Correct 34 ms 69828 KB Output is correct
13 Correct 36 ms 69812 KB Output is correct
14 Incorrect 31 ms 65220 KB Number of cookies does not match with A_i
15 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 83788 KB Output is correct
2 Correct 30 ms 62932 KB Output is correct
3 Correct 43 ms 83680 KB Output is correct
4 Correct 45 ms 83664 KB Output is correct
5 Correct 34 ms 69836 KB Output is correct
6 Correct 42 ms 83540 KB Output is correct
7 Correct 37 ms 74444 KB Output is correct
8 Correct 35 ms 72520 KB Output is correct
9 Correct 44 ms 83668 KB Output is correct
10 Correct 45 ms 83660 KB Output is correct
11 Correct 34 ms 69844 KB Output is correct
12 Correct 34 ms 69844 KB Output is correct
13 Incorrect 52 ms 65228 KB Number of cookies does not match with A_i
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 83656 KB Output is correct
2 Correct 42 ms 83656 KB Output is correct
3 Correct 44 ms 83660 KB Output is correct
4 Correct 34 ms 69844 KB Output is correct
5 Correct 41 ms 83572 KB Output is correct
6 Correct 38 ms 74316 KB Output is correct
7 Correct 38 ms 72532 KB Output is correct
8 Correct 47 ms 83764 KB Output is correct
9 Correct 33 ms 56020 KB Output is correct
10 Correct 42 ms 84556 KB Output is correct
11 Runtime error 102 ms 142240 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 83656 KB Output is correct
2 Correct 42 ms 83656 KB Output is correct
3 Correct 44 ms 83660 KB Output is correct
4 Correct 34 ms 69844 KB Output is correct
5 Correct 41 ms 83572 KB Output is correct
6 Correct 38 ms 74316 KB Output is correct
7 Correct 38 ms 72532 KB Output is correct
8 Correct 47 ms 83764 KB Output is correct
9 Correct 33 ms 56020 KB Output is correct
10 Correct 42 ms 84556 KB Output is correct
11 Runtime error 102 ms 142240 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 83656 KB Output is correct
2 Correct 42 ms 83656 KB Output is correct
3 Correct 44 ms 83660 KB Output is correct
4 Correct 34 ms 69844 KB Output is correct
5 Correct 41 ms 83572 KB Output is correct
6 Correct 38 ms 74316 KB Output is correct
7 Correct 38 ms 72532 KB Output is correct
8 Correct 47 ms 83764 KB Output is correct
9 Correct 33 ms 56020 KB Output is correct
10 Correct 42 ms 84556 KB Output is correct
11 Runtime error 102 ms 142240 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -