oj.uz

Submission #205744

# Submission time Handle Problem Language Result Execution time Memory
205744 2020-02-29T17:08:41 Z cheetose Kitchen (BOI19_kitchen) C++11
100 / 100
 85 ms 107128 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 d[303][90001];
int main() {
	fill(&d[0][0],&d[302][90001],-INF);
	d[0][0]=0;
	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)
	{
		int x;
		scanf("%d",&x);
		fup(j,0,300*i,1)
		{
			d[i][j]=d[i-1][j];
			if(j-x>=0)d[i][j]=max(d[i][j],d[i-1][j-x]+min(n,x));
		}
	}
	fup(i,sum,90000,1)if(d[m][i]>=n*k)return !printf("%d",i-sum);
	puts("Impossible");
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:49: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:55:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~
kitchen.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 107000 KB Output is correct
2 Correct 67 ms 107000 KB Output is correct
3 Correct 64 ms 107000 KB Output is correct
4 Correct 64 ms 107000 KB Output is correct
5 Correct 65 ms 107000 KB Output is correct
6 Correct 65 ms 107000 KB Output is correct
7 Correct 66 ms 107000 KB Output is correct
8 Correct 67 ms 107024 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 107000 KB Output is correct
2 Correct 67 ms 107000 KB Output is correct
3 Correct 64 ms 107000 KB Output is correct
4 Correct 64 ms 107000 KB Output is correct
5 Correct 65 ms 107000 KB Output is correct
6 Correct 65 ms 107000 KB Output is correct
7 Correct 66 ms 107000 KB Output is correct
8 Correct 67 ms 107024 KB Output is correct
9 Correct 65 ms 107128 KB Output is correct
10 Correct 66 ms 107000 KB Output is correct
11 Correct 64 ms 107000 KB Output is correct
12 Correct 62 ms 107000 KB Output is correct
13 Correct 66 ms 107000 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 107000 KB Output is correct
2 Correct 76 ms 107000 KB Output is correct
3 Correct 85 ms 107000 KB Output is correct
4 Correct 85 ms 107004 KB Output is correct
5 Correct 84 ms 107000 KB Output is correct
6 Correct 74 ms 107128 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 107000 KB Output is correct
2 Correct 68 ms 107000 KB Output is correct
3 Correct 64 ms 107000 KB Output is correct
4 Correct 66 ms 107000 KB Output is correct
5 Correct 71 ms 107000 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 107000 KB Output is correct
2 Correct 67 ms 107000 KB Output is correct
3 Correct 64 ms 107000 KB Output is correct
4 Correct 64 ms 107000 KB Output is correct
5 Correct 65 ms 107000 KB Output is correct
6 Correct 65 ms 107000 KB Output is correct
7 Correct 66 ms 107000 KB Output is correct
8 Correct 67 ms 107024 KB Output is correct
9 Correct 65 ms 107128 KB Output is correct
10 Correct 66 ms 107000 KB Output is correct
11 Correct 64 ms 107000 KB Output is correct
12 Correct 62 ms 107000 KB Output is correct
13 Correct 66 ms 107000 KB Output is correct
14 Correct 81 ms 107000 KB Output is correct
15 Correct 76 ms 107000 KB Output is correct
16 Correct 85 ms 107000 KB Output is correct
17 Correct 85 ms 107004 KB Output is correct
18 Correct 84 ms 107000 KB Output is correct
19 Correct 74 ms 107128 KB Output is correct
20 Correct 64 ms 107000 KB Output is correct
21 Correct 68 ms 107000 KB Output is correct
22 Correct 64 ms 107000 KB Output is correct
23 Correct 66 ms 107000 KB Output is correct
24 Correct 71 ms 107000 KB Output is correct
25 Correct 76 ms 107000 KB Output is correct
26 Correct 82 ms 107068 KB Output is correct
27 Correct 69 ms 107000 KB Output is correct
28 Correct 79 ms 107000 KB Output is correct
29 Correct 77 ms 107000 KB Output is correct
30 Correct 85 ms 107004 KB Output is correct