oj.uz

Submission #945488

# Submission time Handle Problem Language Result Execution time Memory
945488 2024-03-14T00:36:14 Z yeediot Kitchen (BOI19_kitchen) C++14
100 / 100
 29 ms 1180 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=305*305;
int dp[mxn];
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    int a[n+1];
    int b[m+1];
    int need=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        need+=a[i];
        if(a[i]<k){
            cout<<"Impossible\n";
            return 0;
        }
    }
    for(int i=1;i<=m;i++){
        cin>>b[i];
    }
    memset(dp,-0x3f3f3f3f,sizeof(dp));
    dp[0]=0;
    int ans=1e18;
    for(int i=1;i<=m;i++){
        for(int j=mxn-1;j>=0;j--){
            if(j-b[i]<0)break;
            chmax(dp[j],dp[j-b[i]]+min(n,b[i]));
            if(j>=need and dp[j]>=n*k){
                chmin(ans,j-need);
            }
        }
    }
    if(ans==1e18){
        cout<<"Impossible\n";
    }
    else{
        cout<<ans<<'\n';
    }
}
 /*
 input:
 
 */

Compilation message

kitchen.cpp: In function 'void setIO(std::string)':
kitchen.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1112 KB Output is correct
13 Correct 3 ms 1116 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1112 KB Output is correct
2 Correct 22 ms 1116 KB Output is correct
3 Correct 29 ms 1112 KB Output is correct
4 Correct 28 ms 1112 KB Output is correct
5 Correct 27 ms 1116 KB Output is correct
6 Correct 21 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1112 KB Output is correct
2 Correct 4 ms 1176 KB Output is correct
3 Correct 4 ms 1180 KB Output is correct
4 Correct 4 ms 1116 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1112 KB Output is correct
13 Correct 3 ms 1116 KB Output is correct
14 Correct 25 ms 1112 KB Output is correct
15 Correct 22 ms 1116 KB Output is correct
16 Correct 29 ms 1112 KB Output is correct
17 Correct 28 ms 1112 KB Output is correct
18 Correct 27 ms 1116 KB Output is correct
19 Correct 21 ms 1116 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct
21 Correct 4 ms 1176 KB Output is correct
22 Correct 4 ms 1180 KB Output is correct
23 Correct 4 ms 1116 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 23 ms 1116 KB Output is correct
26 Correct 24 ms 1116 KB Output is correct
27 Correct 17 ms 1116 KB Output is correct
28 Correct 24 ms 1116 KB Output is correct
29 Correct 24 ms 1116 KB Output is correct
30 Correct 29 ms 1112 KB Output is correct