제출 #1247675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247675		sarora	Brunhilda’s Birthday (BOI13_brunhilda)	C++20	8.10 / 100	1096 ms	3796 KiB

brunhilda

#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <functional>
#include <unordered_set>

using namespace std;

// Macros for convenience
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(a) ll((a).size())
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'


// Loops
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = a; i >= b; --i)
#define trav(a, x) for (auto &a : x)

// Data Type Shortcuts
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using vi =  vector<ll>;
using vvi = vector<vector<ll>>;
using pii = pair<ll, ll>;
using vpii = vector<pii>;

// Utility Functions
void fastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}


ll m, q;
vi p; // ascending

ll solve(ll n) {
    ll k, calls = 0;
    while (n != 0) {
        // next k
        k = -1;
        rrep(i, m-1, 0) {
            if (n % p[i] != 0) {
                k = p[i];
                break;
            }
        }
        if (k == -1) return -1; // n is positive and no k

        // elimination
        calls++;
        n -= n % k;
    }
    return calls;
}

int main() {
    fastIO();

    cin >> m >> q;
    rep(i, 0, m) {
        ll e;
        cin >> e;
        p.pb(e);
    }
    rep(i, 0, q) {
        ll n;
        cin >> n;
        ll res = solve(n);
        if (res == -1) cout << "oo" << endl;
        else cout << res << endl;
    }
    return 0;
}

• Subtask 1: 1.1111 / 20
• Subtask 2: 5.5556 / 20
• Subtask 3: 1.4286 / 60