| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 925640 |
2024-02-12T06:46:36 Z |
vjudge1 |
Kitchen (BOI19_kitchen) |
C++17 |
|
106 ms |
7768 KB |
// By ObeliX
#include <bits/stdc++.h>
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <unordered_map>
#include <cstddef>
#include <cassert>
#include <bitset>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;
const long long N = 1e6 + 5;
const long long mod = 1e7 + 7;
const long long INF = 1e18;
long long n , m , k;
long long a[N] , b[N];
long long dp[3][N];
int main(){
//freopen( "cinema.in" , "r" , stdin );
//freopen( "cinema.out" , "w" , stdout );
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k;
for ( int i = 1 ; i <= n ; i++ ) {
cin >> a[i];
}
for ( int i = 1 ; i <= m ; i++ ) {
cin >> b[i];
}
if ( k > m ) {
cout << "Impossible";
return 0;
}
if ( k == 1 ) {
sort( b + 1 , b + 1 + m );
long long sum = 0;
for ( int i = 1 ; i <= n ; i++ ) {
sum += a[i];
}
dp[1][0] = 1;
for ( int i = 1 ; i <= m ; i++ ) {
for ( int j = b[i] ; j <= 100000 ; j++ ) {
dp[2][j] = max( dp[2][j] , dp[1][j-b[i]] );
}
for ( int j = 0 ; j <= 100000 ; j++ ) {
dp[1][j] = max( dp[2][j] , dp[1][j] );
dp[2][j] = 0;
}
}
long long ans = -1;
for ( int i = sum ; i <= 100000 ; i++ ) {
if ( dp[1][i] == 1 ) {
ans = i;
break;
}
}
if ( ans == -1 ) {
cout << "Impossible";
}
else {
cout << ans - sum;
}
}
else {
sort( b + 1 , b + 1 + m );
long long sum1 = 0 , sum3 = 0;
for ( int i = 1 ; i <= n ; i++ ) {
sum1 += a[i];
if ( a[i] < k ) {
sum1 = -1;
break;
}
}
for ( int i = 1 ; i <= m ; i++ ) {
sum3 += b[i];
}
if ( sum1 == -1 || sum3 < sum1 ) {
cout << "Impossible";
return 0;
}
long long ans = INF;
for ( int mask = 0 ; mask <= ( ( 1 << m ) - 1 ) ; mask++ ) {
vector <long long> v;
long long sum2 = 0;
for ( int i = 0 ; i < m ; i++ ) {
if ( ((mask >> i) & 1) ) {
v.push_back( b[i+1] );
sum2 += b[i+1];
}
}
if ( v.size() < k || sum1 > sum2 ) {
continue;
}
long long can = 0;
for ( int j = 1 ; j <= n ; j++ ) {
if ( a[j] < k ) {
can = 1;
break;
}
else {
a[j] -= k;
long long cnt = 0;
for ( int i = v.size() - 1 ; i >= 0 ; i-- ) {
if ( v[i] != 0 ) {
v[i]--;
cnt++;
}
else {
cnt = -1;
break;
}
if ( cnt == k ) {
break;
}
}
if ( cnt != k ) {
can = 1;
break;
}
sort( v.begin() , v.end() );
}
}
if ( can == 1 ) {
continue;
}
long long sum = 0;
for ( auto it : v ) {
sum += it;
}
for ( int i = 1 ; i <= n ; i++ ) {
sum -= a[i];
}
if ( sum < 0 ) {
continue;
}
ans = min( sum , ans );
}
if ( ans == INF ) {
cout << "Impossible";
}
else {
cout << ans;
}
}
}
Compilation message
kitchen.cpp: In function 'int main()':
kitchen.cpp:101:27: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
101 | if ( v.size() < k || sum1 > sum2 ) {
| ~~~~~~~~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 3 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
2 ms |
7512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 3 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
2 ms |
7512 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4440 KB |
Output is correct |
| 10 |
Incorrect |
6 ms |
4444 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
99 ms |
7764 KB |
Output is correct |
| 2 |
Correct |
80 ms |
7768 KB |
Output is correct |
| 3 |
Correct |
106 ms |
7612 KB |
Output is correct |
| 4 |
Correct |
106 ms |
7512 KB |
Output is correct |
| 5 |
Correct |
103 ms |
7612 KB |
Output is correct |
| 6 |
Correct |
80 ms |
7608 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 2 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 3 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
2 ms |
7516 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
2 ms |
7512 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4440 KB |
Output is correct |
| 10 |
Incorrect |
6 ms |
4444 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
