oj.uz

답안 #1004397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004397 2024-06-21T08:34:25 Z 0pt1mus23 Kitchen (BOI19_kitchen) C++14
0 / 100
 47 ms 4956 KB 
/*
    k=1
*/
#pragma GCC optimize("O3", "inline")
#include <bits/stdc++.h>
using namespace std;
#define ins insert
#define pb push_back
#define int long long int
#define pii pair<int, int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl; return;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7, sze = 1e5, inf = 2e18, prime = 23;

int mn = inf;
multiset<int> var[sze+1];
        
void mal(){
    int n,m,k;
    cin>>n>>m>>k;
    vector<int> arr(n);
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    vector<int> chefs(m);
    for(int i=0;i<m;i++){
        cin>>chefs[i];
    } 
    if(k>m){
        drop("Impossible");
    }
    
    if(m==1){
        for(auto v:arr){
            chefs[0]-=v;
            if(chefs[0]<0){
                drop("Impossible");
            }
        }
        drop(chefs[0]);
    }
    else{
        if(k==1){
            int ans=0;
            for(auto &v:arr){
                while(v){
                    sort(all(chefs),greater<int>());
                    if(!chefs[0]){
                        while(true){
                            
                        }
                        drop("Impossible");
                    }
                    if(chefs[0]){
                        v--;
                        chefs[0]--;
                    }
                    if(chefs[1]){
                        if(!v){
                            ans++;
                        }
                        else{
                            v--;
                            chefs[1]--;
                        }
                    }

                }
            }
            drop(ans);
        }
        else{
            int ans=0;
            for(auto& v:arr){
                if(v<2){
                    drop("Impossible");
                }
                if(!chefs[0] || chefs[1]){
                    drop("Impossible");
                }
                v-=chefs[0];
                v-=chefs[1];
                chefs[0]--;
                chefs[1]--;
                while(v){
                    sort(all(chefs),greater<int>());
                    if(!chefs[0]){
                        drop("Impossible");
                    }
                    v--;
                    chefs[0]--;
                    if(chefs[1]){
                        if(v){
                            v--;
                            chefs[1]--;
                        }
                        else{
                            ans++;
                        }
                    }

                }
            }
            drop(chefs[0]+chefs[1]);
        }
    }

}   

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    // cin>>tt;
    
    while(tt--){
        mal();        
    }
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -