oj.uz

답안 #968951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968951 2024-04-24T10:10:40 Z Mher777 Brunhilda’s Birthday (BOI13_brunhilda) C++17
100 / 100
 439 ms 157524 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 20000005;
int mx[N], ans[N];

void slv() {
    int n, q;
    cin >> n >> q;
    vi v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    v.erase(unique(all(v)), v.end());
    sort(all(v));
    for (auto elem : v) {
        for (int i = elem - 1; i <= N - 5; i += elem) {
            mx[i] = max(mx[i], elem - 1);
        }
    }
    for (int i = N - 5; i >= 1; --i) {
        mx[i] = max(mx[i], mx[i + 1] - 1);
    }
    for (int i = 1; i <= N - 5; ++i) {
        if (mx[i] == 0) {
            ans[i] = -1;
            continue;
        }
        ans[i] = ans[i - mx[i]];
        if (ans[i] != -1) ++ans[i];
    }
    while (q--) {
        int x;
        cin >> x;
        if (ans[x] == -1) {
            cout << "oo" << '\n';
        }
        else {
            cout << ans[x] << '\n';
        }
    }
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

brunhilda.cpp: In function 'll range_sum(ll, ll)':
brunhilda.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
brunhilda.cpp: In function 'll bin_to_dec(std::string)':
brunhilda.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 156752 KB Output is correct
2 Correct 177 ms 156752 KB Output is correct
3 Correct 161 ms 156796 KB Output is correct
4 Correct 143 ms 156784 KB Output is correct
5 Correct 159 ms 156800 KB Output is correct
6 Correct 147 ms 156756 KB Output is correct
7 Correct 162 ms 156984 KB Output is correct
8 Correct 170 ms 156752 KB Output is correct
9 Correct 189 ms 156992 KB Output is correct
10 Correct 211 ms 157008 KB Output is correct
11 Correct 193 ms 156756 KB Output is correct
12 Correct 143 ms 156916 KB Output is correct
13 Correct 325 ms 156808 KB Output is correct
14 Correct 334 ms 156804 KB Output is correct
15 Correct 184 ms 156872 KB Output is correct
16 Correct 177 ms 156772 KB Output is correct
17 Correct 179 ms 156820 KB Output is correct
18 Correct 144 ms 157012 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 157012 KB Output is correct
2 Correct 181 ms 157268 KB Output is correct
3 Correct 384 ms 157096 KB Output is correct
4 Correct 193 ms 156992 KB Output is correct
5 Correct 296 ms 157024 KB Output is correct
6 Correct 172 ms 156988 KB Output is correct
7 Correct 161 ms 157012 KB Output is correct
8 Correct 189 ms 156756 KB Output is correct
9 Correct 334 ms 157264 KB Output is correct
10 Correct 396 ms 157096 KB Output is correct
11 Correct 400 ms 157008 KB Output is correct
12 Correct 235 ms 156808 KB Output is correct
13 Correct 151 ms 157012 KB Output is correct
14 Correct 192 ms 156820 KB Output is correct
15 Correct 332 ms 156988 KB Output is correct
16 Correct 180 ms 157264 KB Output is correct
17 Correct 343 ms 156928 KB Output is correct
18 Correct 324 ms 157268 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 334 ms 157268 KB Output is correct
2 Correct 413 ms 157268 KB Output is correct
3 Correct 410 ms 157268 KB Output is correct
4 Correct 259 ms 157012 KB Output is correct
5 Correct 203 ms 157460 KB Output is correct
6 Correct 347 ms 157092 KB Output is correct
7 Correct 298 ms 157464 KB Output is correct
8 Correct 336 ms 157264 KB Output is correct
9 Correct 329 ms 157276 KB Output is correct
10 Correct 284 ms 157240 KB Output is correct
11 Correct 243 ms 157080 KB Output is correct
12 Correct 312 ms 157008 KB Output is correct
13 Correct 391 ms 157384 KB Output is correct
14 Correct 235 ms 157524 KB Output is correct
15 Correct 334 ms 157300 KB Output is correct
16 Correct 366 ms 157084 KB Output is correct
17 Correct 325 ms 157176 KB Output is correct
18 Correct 403 ms 157264 KB Output is correct
19 Correct 165 ms 156820 KB Output is correct
20 Correct 410 ms 157264 KB Output is correct
21 Correct 274 ms 157524 KB Output is correct
22 Correct 418 ms 157464 KB Output is correct
23 Correct 208 ms 157268 KB Output is correct
24 Correct 179 ms 157320 KB Output is correct
25 Correct 287 ms 157268 KB Output is correct
26 Correct 266 ms 157264 KB Output is correct
27 Correct 439 ms 157500 KB Output is correct
28 Correct 186 ms 157076 KB Output is correct
29 Correct 403 ms 157524 KB Output is correct
30 Correct 378 ms 157352 KB Output is correct
31 Correct 200 ms 157080 KB Output is correct
32 Correct 219 ms 157260 KB Output is correct
33 Correct 163 ms 157080 KB Output is correct
34 Correct 298 ms 157264 KB Output is correct
35 Correct 182 ms 157268 KB Output is correct
36 Correct 394 ms 157520 KB Output is correct
37 Correct 203 ms 157456 KB Output is correct
38 Correct 342 ms 157048 KB Output is correct
39 Correct 193 ms 157264 KB Output is correct
40 Correct 303 ms 157100 KB Output is correct
41 Correct 271 ms 157272 KB Output is correct
42 Correct 372 ms 157268 KB Output is correct