oj.uz

답안 #968942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968942 2024-04-24T09:57:39 Z Mher777 Brunhilda’s Birthday (BOI13_brunhilda) C++17
40 / 100
 1000 ms 1852 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 -------------------- */

void slv() {
    int n, q;
    cin >> n >> q;
    vi v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    while (q--) {
        int x;
        cin >> x;
        int ans = 0;
        while (x) {
            int mx = 0;
            for (int i = 0; i < n; ++i) {
                mx = max(mx, x % v[i]);
            }
            if (!mx) {
                break;
            }
            x -= mx;
            ++ans;
        }
        if (x) {
            cout << "oo" << '\n';
        }
        else {
            cout << ans << '\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 4 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 9 ms 472 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 42 ms 344 KB Output is correct
15 Correct 1 ms 516 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 28 ms 344 KB Output is correct
18 Correct 7 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 7 ms 1376 KB Output is correct
3 Correct 5 ms 1112 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 4 ms 856 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 2 ms 352 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 6 ms 1120 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 7 ms 1372 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 9 ms 1488 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1046 ms 1112 KB Time limit exceeded
2 Execution timed out 1020 ms 1112 KB Time limit exceeded
3 Execution timed out 1067 ms 1116 KB Time limit exceeded
4 Execution timed out 1087 ms 592 KB Time limit exceeded
5 Execution timed out 1094 ms 1484 KB Time limit exceeded
6 Execution timed out 1069 ms 604 KB Time limit exceeded
7 Execution timed out 1008 ms 1624 KB Time limit exceeded
8 Execution timed out 1060 ms 1116 KB Time limit exceeded
9 Execution timed out 1054 ms 1032 KB Time limit exceeded
10 Execution timed out 1068 ms 568 KB Time limit exceeded
11 Execution timed out 1056 ms 596 KB Time limit exceeded
12 Execution timed out 1062 ms 348 KB Time limit exceeded
13 Execution timed out 1065 ms 860 KB Time limit exceeded
14 Execution timed out 1070 ms 348 KB Time limit exceeded
15 Execution timed out 1058 ms 348 KB Time limit exceeded
16 Execution timed out 1061 ms 348 KB Time limit exceeded
17 Execution timed out 1045 ms 860 KB Time limit exceeded
18 Execution timed out 1081 ms 1048 KB Time limit exceeded
19 Execution timed out 1062 ms 664 KB Time limit exceeded
20 Execution timed out 1058 ms 984 KB Time limit exceeded
21 Execution timed out 1028 ms 348 KB Time limit exceeded
22 Execution timed out 1066 ms 1628 KB Time limit exceeded
23 Execution timed out 1041 ms 856 KB Time limit exceeded
24 Execution timed out 1064 ms 468 KB Time limit exceeded
25 Execution timed out 1033 ms 572 KB Time limit exceeded
26 Execution timed out 1028 ms 560 KB Time limit exceeded
27 Execution timed out 1031 ms 1624 KB Time limit exceeded
28 Execution timed out 1064 ms 476 KB Time limit exceeded
29 Execution timed out 1045 ms 1628 KB Time limit exceeded
30 Execution timed out 1035 ms 1368 KB Time limit exceeded
31 Execution timed out 1008 ms 568 KB Time limit exceeded
32 Execution timed out 1010 ms 560 KB Time limit exceeded
33 Execution timed out 1065 ms 552 KB Time limit exceeded
34 Execution timed out 1030 ms 1488 KB Time limit exceeded
35 Execution timed out 1041 ms 512 KB Time limit exceeded
36 Execution timed out 1028 ms 1624 KB Time limit exceeded
37 Execution timed out 1049 ms 1624 KB Time limit exceeded
38 Execution timed out 1025 ms 600 KB Time limit exceeded
39 Execution timed out 1083 ms 656 KB Time limit exceeded
40 Execution timed out 1096 ms 712 KB Time limit exceeded
41 Execution timed out 1049 ms 1852 KB Time limit exceeded
42 Execution timed out 1074 ms 348 KB Time limit exceeded