oj.uz

Submission #1000733

# Submission time Handle Problem Language Result Execution time Memory
1000733 2024-06-18T07:52:19 Z modwwe Kitchen (BOI19_kitchen) C++17
100 / 100
 18 ms 1116 KB 
///https://www.instagram.com/_modwwe/
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
  //  fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
}
int dp[100001];
int b[301];
void solve1()
{
    for(int i=1;i<=m;i++){
        for(int j=s4-b[i];j>=0;--j)
        if(dp[j]!=inf)
        dp[j+b[i]]=max(dp[j+b[i]],dp[j]+min(b[i],n));
        }
        s3=inf;
        for(int j=s2;j<=s4;j++)
            if(dp[j]>=n*k)
            s3=min(s3,j-s2);
}
void phongbeo()
{
     cin>>n>>m>>k;
     s7=inf;
      for(int i=1;i<=n;i++)cin>>l,s2+=l,s7=min(s7,l);
      for(int i=1;i<=m;i++) cin>>b[i],s4+=b[i];
      for(int i=0;i<=s4;i++)
     dp[i]=-1e18;
     if(s7<k){cout<<"Impossible";exit(0);}
     dp[0]=0;
      solve1();
      if(s3!=inf) cout<<s3;
      else cout<<"Impossible";
}

Compilation message

kitchen.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 856 KB Output is correct
2 Correct 9 ms 860 KB Output is correct
3 Correct 10 ms 600 KB Output is correct
4 Correct 17 ms 1112 KB Output is correct
5 Correct 17 ms 1116 KB Output is correct
6 Correct 7 ms 604 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 464 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 12 ms 856 KB Output is correct
15 Correct 9 ms 860 KB Output is correct
16 Correct 10 ms 600 KB Output is correct
17 Correct 17 ms 1112 KB Output is correct
18 Correct 17 ms 1116 KB Output is correct
19 Correct 7 ms 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 9 ms 856 KB Output is correct
26 Correct 11 ms 968 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 9 ms 876 KB Output is correct
29 Correct 13 ms 1008 KB Output is correct
30 Correct 18 ms 1116 KB Output is correct