oj.uz

Submission #205742

# Submission time Handle Problem Language Result Execution time Memory
205742 2020-02-29T16:26:36 Z cheetose Kitchen (BOI19_kitchen) C++11
51 / 100
 215 ms 3832 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

int a[303];
bitset<90001> bs[303];
int main() {
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	if(m<k)return !printf("Impossible");
	int sum=0;
	fup(i,0,n-1,1)
	{
		int x;
		scanf("%d",&x);
		if(x<k)return !printf("Impossible");
		sum+=x;
	}
	fup(i,1,m,1)
	{
		scanf("%d",a+i);
		if(m==k && a[i]<n)return !printf("Impossible");
	}
	sort(a+1,a+m+1);
	int ans=INF,tt=0;
	bs[0][0]=1;
	bitset<90001> res=1;
	fup(i,1,m,1)
	{
		int tmp=max((k-1)*n+a[i],sum)-a[i];
		fup(x,tmp,tt,1)
		{
			if(res[x])
			{
				ans=min(ans,x+a[i]-sum);
				break;
			}
		}
		tt+=a[i];
		fdn(x,i,1,1)bs[x]|=bs[x-1]<<a[i];
		bitset<90001> tbs;
		fup(x,k-1,i,1)tbs|=bs[x];
		res=tbs;
	}
	if(ans==INF)return !printf("Impossible");
	printf("%d",ans);
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~
kitchen.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~
kitchen.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a+i);
   ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 3196 KB Output is correct
2 Correct 139 ms 2936 KB Output is correct
3 Correct 215 ms 3832 KB Output is correct
4 Correct 213 ms 3832 KB Output is correct
5 Correct 211 ms 3576 KB Output is correct
6 Correct 108 ms 2684 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 169 ms 3196 KB Output is correct
15 Correct 139 ms 2936 KB Output is correct
16 Correct 215 ms 3832 KB Output is correct
17 Correct 213 ms 3832 KB Output is correct
18 Correct 211 ms 3576 KB Output is correct
19 Correct 108 ms 2684 KB Output is correct
20 Incorrect 8 ms 760 KB Output isn't correct
21 Halted 0 ms 0 KB -