oj.uz

답안 #1032614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032614 2024-07-24T03:53:25 Z sleepntsheep 버섯 세기 (IOI20_mushrooms) C++17
80.1418 / 100
 5 ms 600 KB 
#include "mushrooms.h"
#include <cassert>

int count_mushrooms(int n) {
    if (n <= 227) {
        int count = 1, cur = 0;
        for (int i = 1; i < n; ++i) {
            cur ^= (use_machine({i - 1, i}));
            count += !cur;
        }
        return count;
    }

	std::vector<int> A = {0}, B;

    int X = 269, reach = 0;

    for (int i = 1; B.size() < 2 && i < X; i += 2) {
        int y = use_machine({0, i, i + 1});
        if (y == 0) {
            A.push_back(i);
            A.push_back(i + 1);
        } else if (y == 2) {
            B.push_back(i);
            A.push_back(i + 1);
        } else if (y == 1) {
            if (use_machine({0, i})) {
                B.push_back(i);
                B.push_back(i + 1);
            } else {
                A.push_back(i);
                B.push_back(i + 1);
            }
        } else
            __builtin_unreachable();
        reach = i + 1;
    }

    for (int i = reach + 1; i < X; i += 2) {
        int y = use_machine({i, 0, B[0], i + 1, B[1]});
        if (y == 1) {
            A.push_back(i);
            B.push_back(i + 1);
        } else if (y == 2) {
            B.push_back(i);
            B.push_back(i + 1);
        } else if (y == 3) {
            A.push_back(i);
            A.push_back(i + 1);
        } else if (y == 4) {
            B.push_back(i);
            A.push_back(i + 1);
        } else
            __builtin_unreachable();
    }

    int count = A.size();
    int amogus = std::max(A.size(), B.size());
    int chosen = A.size() >= B.size() ? 0 : 1;

    int l = X;
    while (l < n) {
        int r = std::min(n, l + amogus) - 1;

        std::vector<int> m;

        if (0 == chosen) {
            for (int j = l, k = 0; j <= r; ++j, ++k) {
                m.push_back(j);
                m.push_back(A[k]);
            }
            count += (r - l + 1) - (use_machine(m) + 1) / 2;
        } else {
            for (int j = l, k = 0; j <= r; ++j, ++k) {
                m.push_back(j);
                m.push_back(B[k]);
            }
            count += (use_machine(m) + 1) / 2;
        }

        l = r + 1;
    }

	return count;
}

Subtask #1
80.1418 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 352 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Partially correct 5 ms 344 KB Output is partially correct
11 Partially correct 5 ms 344 KB Output is partially correct
12 Partially correct 3 ms 344 KB Output is partially correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Partially correct 4 ms 348 KB Output is partially correct
16 Partially correct 3 ms 344 KB Output is partially correct
17 Correct 2 ms 428 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Partially correct 3 ms 344 KB Output is partially correct
21 Partially correct 4 ms 344 KB Output is partially correct
22 Partially correct 5 ms 348 KB Output is partially correct
23 Partially correct 2 ms 344 KB Output is partially correct
24 Correct 2 ms 600 KB Output is correct
25 Partially correct 3 ms 352 KB Output is partially correct
26 Partially correct 3 ms 348 KB Output is partially correct
27 Partially correct 3 ms 348 KB Output is partially correct
28 Partially correct 3 ms 344 KB Output is partially correct
29 Partially correct 3 ms 344 KB Output is partially correct
30 Partially correct 3 ms 348 KB Output is partially correct
31 Partially correct 3 ms 348 KB Output is partially correct
32 Partially correct 3 ms 348 KB Output is partially correct
33 Partially correct 3 ms 348 KB Output is partially correct
34 Partially correct 4 ms 600 KB Output is partially correct
35 Partially correct 3 ms 344 KB Output is partially correct
36 Partially correct 3 ms 344 KB Output is partially correct
37 Partially correct 3 ms 352 KB Output is partially correct
38 Partially correct 5 ms 348 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 4 ms 344 KB Output is partially correct
42 Partially correct 3 ms 348 KB Output is partially correct
43 Partially correct 3 ms 352 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 3 ms 344 KB Output is partially correct
46 Partially correct 3 ms 356 KB Output is partially correct
47 Partially correct 3 ms 352 KB Output is partially correct
48 Partially correct 3 ms 344 KB Output is partially correct
49 Partially correct 5 ms 348 KB Output is partially correct
50 Partially correct 3 ms 348 KB Output is partially correct
51 Partially correct 3 ms 348 KB Output is partially correct
52 Partially correct 3 ms 344 KB Output is partially correct
53 Partially correct 5 ms 440 KB Output is partially correct
54 Partially correct 3 ms 344 KB Output is partially correct
55 Partially correct 4 ms 344 KB Output is partially correct
56 Partially correct 4 ms 344 KB Output is partially correct
57 Partially correct 3 ms 344 KB Output is partially correct
58 Partially correct 3 ms 344 KB Output is partially correct
59 Partially correct 3 ms 348 KB Output is partially correct
60 Partially correct 3 ms 344 KB Output is partially correct
61 Partially correct 4 ms 344 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 352 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct