oj.uz

답안 #923683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923683 2024-02-07T15:01:24 Z sleepntsheep Brunhilda’s Birthday (BOI13_brunhilda) C++17
0 / 100
 1000 ms 78680 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];

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

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

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;
    }

    auto factorize = [&](int n) {
        vector<int> f, nf;
        for (int d : {2, 3, 5}) {
            if (n % d == 0) {
                f.push_back(d);
                n /= d;
                while (n % d == 0) n /= d;
            }
        }

        static array<int, 8> increments = {4, 2, 4, 2, 4, 6, 2, 6};
        int i = 0;

        for (long long d = 7; d * d <= n; d += increments[i++]) {
            if (n % d == 0) {
                f.push_back(d);
                n /= d;
                while (n % d == 0) n /= d;
            }
            if (i == 8) i = 0;
        }

        if (n > 1) f.push_back(n);

        return f;
    };

    auto factorize2 = [&](int n) {
        vector<int> f;
        for (auto d : prime) {
            if (d * d > n) break;
            if (n % d == 0)
            {
                f.push_back(d);
                n /= d;
                while (n % d == 0) n /=  d;
            }
        }

        if (n > 1) f.push_back(n);

        return f;
    };



    for (int i = 1; i < N; ++i) volatile auto F = factorize2(i);
    return 0;

    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);
    };

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

    for (int i = 1; i < N; ++i)
    {
        auto F = factorize(i);
        for (auto x : F) if (yes[x] and dp[i-x] < N)
            del(dp[i-x]);
    
        dp[i] = min(dp[i], top() + 1);

        if (dp[i] < 1e9)
            for (auto x : F) if (yes[x])
                push(dp[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 1030 ms 41560 KB Time limit exceeded
2 Execution timed out 1038 ms 41560 KB Time limit exceeded
3 Execution timed out 1033 ms 41560 KB Time limit exceeded
4 Execution timed out 1059 ms 43612 KB Time limit exceeded
5 Execution timed out 1053 ms 41564 KB Time limit exceeded
6 Execution timed out 1059 ms 41564 KB Time limit exceeded
7 Execution timed out 1038 ms 41560 KB Time limit exceeded
8 Execution timed out 1012 ms 41560 KB Time limit exceeded
9 Execution timed out 1075 ms 41564 KB Time limit exceeded
10 Execution timed out 1042 ms 41560 KB Time limit exceeded
11 Execution timed out 1070 ms 41564 KB Time limit exceeded
12 Execution timed out 1036 ms 41560 KB Time limit exceeded
13 Execution timed out 1026 ms 43608 KB Time limit exceeded
14 Execution timed out 1061 ms 43612 KB Time limit exceeded
15 Execution timed out 1056 ms 41564 KB Time limit exceeded
16 Execution timed out 1022 ms 41560 KB Time limit exceeded
17 Execution timed out 1050 ms 41560 KB Time limit exceeded
18 Execution timed out 1082 ms 43612 KB Time limit exceeded

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1043 ms 45656 KB Time limit exceeded
2 Execution timed out 1024 ms 78680 KB Time limit exceeded
3 Execution timed out 1061 ms 47964 KB Time limit exceeded
4 Execution timed out 1029 ms 43612 KB Time limit exceeded
5 Execution timed out 1056 ms 47964 KB Time limit exceeded
6 Execution timed out 1070 ms 43612 KB Time limit exceeded
7 Execution timed out 1039 ms 45912 KB Time limit exceeded
8 Execution timed out 1051 ms 43612 KB Time limit exceeded
9 Execution timed out 1056 ms 48116 KB Time limit exceeded
10 Execution timed out 1089 ms 47704 KB Time limit exceeded
11 Execution timed out 1043 ms 45656 KB Time limit exceeded
12 Execution timed out 1041 ms 43608 KB Time limit exceeded
13 Execution timed out 1025 ms 43868 KB Time limit exceeded
14 Execution timed out 1047 ms 43612 KB Time limit exceeded
15 Execution timed out 1025 ms 45860 KB Time limit exceeded
16 Execution timed out 1099 ms 78676 KB Time limit exceeded
17 Execution timed out 1076 ms 43868 KB Time limit exceeded
18 Execution timed out 1053 ms 52212 KB Time limit exceeded

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1058 ms 45916 KB Time limit exceeded
2 Execution timed out 1062 ms 45660 KB Time limit exceeded
3 Execution timed out 1053 ms 45916 KB Time limit exceeded
4 Execution timed out 1047 ms 43608 KB Time limit exceeded
5 Execution timed out 1051 ms 60248 KB Time limit exceeded
6 Execution timed out 1074 ms 43612 KB Time limit exceeded
7 Execution timed out 1056 ms 54108 KB Time limit exceeded
8 Execution timed out 1101 ms 45660 KB Time limit exceeded
9 Execution timed out 1052 ms 45916 KB Time limit exceeded
10 Execution timed out 1045 ms 43612 KB Time limit exceeded
11 Execution timed out 1066 ms 43612 KB Time limit exceeded
12 Execution timed out 1052 ms 43864 KB Time limit exceeded
13 Execution timed out 1025 ms 45660 KB Time limit exceeded
14 Execution timed out 1031 ms 41560 KB Time limit exceeded
15 Execution timed out 1067 ms 43612 KB Time limit exceeded
16 Execution timed out 1032 ms 43608 KB Time limit exceeded
17 Execution timed out 1018 ms 45912 KB Time limit exceeded
18 Execution timed out 1068 ms 45660 KB Time limit exceeded
19 Execution timed out 1085 ms 45912 KB Time limit exceeded
20 Execution timed out 1074 ms 45660 KB Time limit exceeded
21 Execution timed out 1056 ms 41564 KB Time limit exceeded
22 Execution timed out 1058 ms 47708 KB Time limit exceeded
23 Execution timed out 1049 ms 45856 KB Time limit exceeded
24 Execution timed out 1027 ms 43608 KB Time limit exceeded
25 Execution timed out 1027 ms 43764 KB Time limit exceeded
26 Execution timed out 1006 ms 43608 KB Time limit exceeded
27 Execution timed out 1057 ms 50012 KB Time limit exceeded
28 Execution timed out 1020 ms 43608 KB Time limit exceeded
29 Execution timed out 1071 ms 47708 KB Time limit exceeded
30 Execution timed out 1061 ms 45916 KB Time limit exceeded
31 Execution timed out 1065 ms 43612 KB Time limit exceeded
32 Execution timed out 1032 ms 43608 KB Time limit exceeded
33 Execution timed out 1063 ms 43612 KB Time limit exceeded
34 Execution timed out 1091 ms 54104 KB Time limit exceeded
35 Execution timed out 1045 ms 43608 KB Time limit exceeded
36 Execution timed out 1073 ms 47964 KB Time limit exceeded
37 Execution timed out 1077 ms 60252 KB Time limit exceeded
38 Execution timed out 1054 ms 43840 KB Time limit exceeded
39 Execution timed out 1070 ms 43612 KB Time limit exceeded
40 Execution timed out 1052 ms 43612 KB Time limit exceeded
41 Execution timed out 1069 ms 58204 KB Time limit exceeded
42 Execution timed out 1037 ms 43608 KB Time limit exceeded