oj.uz

Submission #559610

# Submission time Handle Problem Language Result Execution time Memory
559610 2022-05-10T09:27:27 Z Sam_a17 Kitchen (BOI19_kitchen) C++14
100 / 100
 27 ms 1032 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) x.clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define pf push_front
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque<T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }

  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 301, M = N * N;
int n, m, k;
long long dp[M];

void solve_() {
  cin >> n >> m >> k;

  vector<int> a(n + 1), b(m + 1);

  int s = 0;
  for(int i = 1; i <= n; i++) {
    cin >> a[i], s += a[i];
    if(a[i] < k) {
      printf("Impossible\n");
      return;
    }
  }

  for(int i = 1; i <= m; i++) {
    cin >> b[i];
  }

  memset(dp, -1, sizeof(dp));

  dp[0] = 0;
  for(int i = 1; i <= m; i++) {
    for(int j = M - b[i] - 1; j >= 0; j--) {
      if(dp[j] != -1) {
        dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(b[i], n));
      }
    }
  }

  for(int i = s; i < M; i++) {
    if(dp[i] >= n * k) {
      printf("%d\n", i - s);
      return;
    }
  }

  printf("Impossible\n");
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 992 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 980 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 992 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 2 ms 968 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 968 KB Output is correct
13 Correct 3 ms 980 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 980 KB Output is correct
2 Correct 17 ms 980 KB Output is correct
3 Correct 25 ms 980 KB Output is correct
4 Correct 27 ms 968 KB Output is correct
5 Correct 24 ms 980 KB Output is correct
6 Correct 15 ms 1032 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 968 KB Output is correct
2 Correct 3 ms 972 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 992 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 2 ms 968 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 968 KB Output is correct
13 Correct 3 ms 980 KB Output is correct
14 Correct 19 ms 980 KB Output is correct
15 Correct 17 ms 980 KB Output is correct
16 Correct 25 ms 980 KB Output is correct
17 Correct 27 ms 968 KB Output is correct
18 Correct 24 ms 980 KB Output is correct
19 Correct 15 ms 1032 KB Output is correct
20 Correct 5 ms 968 KB Output is correct
21 Correct 3 ms 972 KB Output is correct
22 Correct 3 ms 980 KB Output is correct
23 Correct 3 ms 980 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 15 ms 1032 KB Output is correct
26 Correct 19 ms 980 KB Output is correct
27 Correct 12 ms 1032 KB Output is correct
28 Correct 20 ms 1020 KB Output is correct
29 Correct 23 ms 980 KB Output is correct
30 Correct 26 ms 980 KB Output is correct