oj.uz

답안 #923691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923691 2024-02-07T15:15:32 Z sleepntsheep Brunhilda’s Birthday (BOI13_brunhilda) C++17
0 / 100
 1000 ms 76636 KB 
#include <iostream>
#include <queue>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>

using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,tune=native")

#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);

#if 1
#define M 100005
#define N 10000005
#else
#define M 20000
#define N 20000
#endif

int m, q, dp[N], yes[N], freq[N], i;

priority_queue<int, vector<int>, greater<int>> pq;

int si[4000];
vector<int> prime;

struct Precalc {
    unsigned char divisor[1<<16];

    constexpr Precalc() : divisor{} {
        for (int i = 0; i < (1<<16); i++)
            divisor[i] = 1;
        for (int i = 2; i * i < (1<<16); i++)
            if (divisor[i] == 1)
                for (int k = i * i; k < (1<<16); k += i)
                    divisor[k] = i;
    }
};

auto push = [](int x){
    pq.push(x);
};

auto del = [](int x){
    ++freq[x];
};

auto top = [](){
    while (pq.size())
    {
        int top = pq.top();
        if (freq[top]) --freq[top], pq.pop();
        else return top;
    }
    return int(1e9);
};


int main()
{

    for (int i = 2; i < 4000; ++i)
    {
        if (si[i]) continue;
        for (int j = 2 * i; j < 4000; j += i) si[j] = 1;
    }
    for (int i = 2; i < 4000; ++i) if (!si[i]) prime.push_back(i);

    memset(dp, 63, sizeof dp);
    ShinLena;

    dp[0] = 0;
    cin >> m >> q;
    for (int p, i = 1; i <= m; ++i)
    {
        cin >> p;
        yes[p] = 1;
    }

    constexpr Precalc P{};

    auto f = +[](int d){};
    decltype(f) ff = nullptr;

    auto factorize2 = [&](int n) {
        using u64 = unsigned long long;
        auto find_factor = [&](u64 n){
            if (n < (1 << 16)) return u64(P.divisor[n]);
            for (u64 d : prime)
                if (d * n < d)
                    return u64(-1) / d + 1;
            return 1ull;
        };


        u64 d;
        do {
            ff(int(d = find_factor(n)));
            n /= d;
        } while (d != 1);
    };


    ff = +[](volatile int x){};
    for (int i = 1; i < N; ++i) factorize2(i);
    return 0;

    for (int i = 0; i < m; ++i) push(0);

    for (i = 1; i < N; ++i)
    {
        ff = +[](int x) { if(yes[x] and dp[i-x] < N) del(dp[i-x]); };
        factorize2(i);
    
        dp[i] = min(dp[i], top() + 1);

        if (dp[i] < 1e9)
        {
            ff = +[](int x) { if(yes[x]) push(dp[i]); };
            factorize2(i);
        }
    }

    for (int x, i = 1; i <= q; ++i)
    {
        cin >> x;
        if (dp[x] >= 1e9) cout << "oo\n";
        else cout << dp[x] << '\n';
    }


    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1072 ms 41820 KB Time limit exceeded
2 Execution timed out 1068 ms 41820 KB Time limit exceeded
3 Execution timed out 1060 ms 41820 KB Time limit exceeded
4 Execution timed out 1062 ms 41820 KB Time limit exceeded
5 Execution timed out 1063 ms 41820 KB Time limit exceeded
6 Execution timed out 1066 ms 41820 KB Time limit exceeded
7 Execution timed out 1032 ms 42072 KB Time limit exceeded
8 Execution timed out 1040 ms 41816 KB Time limit exceeded
9 Execution timed out 1042 ms 41816 KB Time limit exceeded
10 Execution timed out 1051 ms 41820 KB Time limit exceeded
11 Execution timed out 1055 ms 41820 KB Time limit exceeded
12 Execution timed out 1024 ms 41816 KB Time limit exceeded
13 Execution timed out 1058 ms 41820 KB Time limit exceeded
14 Execution timed out 1045 ms 41820 KB Time limit exceeded
15 Execution timed out 1050 ms 41816 KB Time limit exceeded
16 Execution timed out 1035 ms 41816 KB Time limit exceeded
17 Execution timed out 1016 ms 41816 KB Time limit exceeded
18 Execution timed out 1073 ms 41820 KB Time limit exceeded

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 43868 KB Time limit exceeded
2 Execution timed out 1069 ms 76636 KB Time limit exceeded
3 Execution timed out 1047 ms 46072 KB Time limit exceeded
4 Execution timed out 1044 ms 41816 KB Time limit exceeded
5 Execution timed out 1058 ms 45916 KB Time limit exceeded
6 Execution timed out 1022 ms 41820 KB Time limit exceeded
7 Execution timed out 1097 ms 43864 KB Time limit exceeded
8 Execution timed out 1071 ms 41820 KB Time limit exceeded
9 Execution timed out 1079 ms 45912 KB Time limit exceeded
10 Execution timed out 1070 ms 45916 KB Time limit exceeded
11 Execution timed out 1086 ms 43868 KB Time limit exceeded
12 Execution timed out 1064 ms 41820 KB Time limit exceeded
13 Execution timed out 1033 ms 42072 KB Time limit exceeded
14 Execution timed out 1047 ms 41788 KB Time limit exceeded
15 Execution timed out 1045 ms 43864 KB Time limit exceeded
16 Execution timed out 1055 ms 76636 KB Time limit exceeded
17 Execution timed out 1024 ms 41816 KB Time limit exceeded
18 Execution timed out 1068 ms 50012 KB Time limit exceeded

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1097 ms 43864 KB Time limit exceeded
2 Execution timed out 1012 ms 43864 KB Time limit exceeded
3 Execution timed out 1032 ms 43864 KB Time limit exceeded
4 Execution timed out 1045 ms 41816 KB Time limit exceeded
5 Execution timed out 1059 ms 58204 KB Time limit exceeded
6 Execution timed out 1046 ms 41820 KB Time limit exceeded
7 Execution timed out 1053 ms 52060 KB Time limit exceeded
8 Execution timed out 1057 ms 43868 KB Time limit exceeded
9 Execution timed out 1039 ms 43864 KB Time limit exceeded
10 Execution timed out 1077 ms 41820 KB Time limit exceeded
11 Execution timed out 1043 ms 41820 KB Time limit exceeded
12 Execution timed out 1062 ms 41820 KB Time limit exceeded
13 Execution timed out 1083 ms 43856 KB Time limit exceeded
14 Execution timed out 1064 ms 41816 KB Time limit exceeded
15 Execution timed out 1062 ms 41820 KB Time limit exceeded
16 Execution timed out 1052 ms 41816 KB Time limit exceeded
17 Execution timed out 1052 ms 43868 KB Time limit exceeded
18 Execution timed out 1034 ms 43864 KB Time limit exceeded
19 Execution timed out 1027 ms 43864 KB Time limit exceeded
20 Execution timed out 1029 ms 43868 KB Time limit exceeded
21 Execution timed out 1008 ms 41820 KB Time limit exceeded
22 Execution timed out 1037 ms 46540 KB Time limit exceeded
23 Execution timed out 1070 ms 44120 KB Time limit exceeded
24 Execution timed out 1044 ms 41820 KB Time limit exceeded
25 Execution timed out 1010 ms 41816 KB Time limit exceeded
26 Execution timed out 1069 ms 41820 KB Time limit exceeded
27 Execution timed out 1027 ms 46680 KB Time limit exceeded
28 Execution timed out 1061 ms 41820 KB Time limit exceeded
29 Execution timed out 1056 ms 46664 KB Time limit exceeded
30 Execution timed out 1062 ms 44380 KB Time limit exceeded
31 Execution timed out 1038 ms 41820 KB Time limit exceeded
32 Execution timed out 1018 ms 41820 KB Time limit exceeded
33 Execution timed out 1049 ms 41820 KB Time limit exceeded
34 Execution timed out 1014 ms 52824 KB Time limit exceeded
35 Execution timed out 1031 ms 42072 KB Time limit exceeded
36 Execution timed out 1057 ms 46684 KB Time limit exceeded
37 Execution timed out 1027 ms 59224 KB Time limit exceeded
38 Execution timed out 1052 ms 42076 KB Time limit exceeded
39 Execution timed out 1100 ms 41816 KB Time limit exceeded
40 Execution timed out 1014 ms 42076 KB Time limit exceeded
41 Execution timed out 1038 ms 57152 KB Time limit exceeded
42 Execution timed out 1022 ms 41816 KB Time limit exceeded