Submission #310806

#	Time	Username	Problem	Language	Result	Execution time	Memory
310806		VROOM_VARUN	Brunhilda’s Birthday (BOI13_brunhilda)	C++14	100 / 100	606 ms	119160 KiB

brunhilda

/*
ID: varunra2
LANG: C++
TASK: birthday
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

const int N = (int)(1.5e7);
// int dp[N];
// int best[N];
VI dp(N, INF);
VI best(N, 0);

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("birthday.in", "r", stdin);
  // freopen("birthday.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int m, q;
  cin >> m >> q;

  dp[0] = 0;

  while (m--) {
    int p;
    cin >> p;

    for (int j = p - 1; j < N; j += p) {
      best[j] = max(best[j], p - 1);
    }
  }

  for (int i = N - 1; i > 0; i--) {
    best[i - 1] = max(best[i - 1], best[i] - 1);
  }

  for (int i = 1; i < N; i++) {
    dp[i] = dp[i - best[i]] + 1;
  }

  while (q--) {
    int n;
    cin >> n;
    if (dp[n] >= N) {
      cout << "oo\n";
    } else
      cout << dp[n] << '\n';
  }

  return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 60 / 60