oj.uz

Submission #927760

# Submission time Handle Problem Language Result Execution time Memory
927760 2024-02-15T10:03:18 Z haxorman Counting Mushrooms (IOI20_mushrooms) C++14
10 / 100
 65 ms 1504 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;

int count_mushrooms(int n) {
    vector<int> arr = {0};
    for (int i = 0; i < n - 3; i += 3) {
        vector<int> check = {i, i + 1, i + 2, i + 3};
        int res = use_machine(check);

        if (!res) {
            for (int k = 0; k < 3; ++k) {
                arr.push_back(arr[i]);
            }
        }
        else if (res == 3) {
            for (int k = 0; k < 3; ++k) {
                arr.push_back(arr[i] ^ (k&1^1));
            }
        }
        else if (res == 1) {
            check = {i + 1, i + 3, i + 2};
            res = use_machine(check);

            if (!res) {
                for (int k = 0; k < 3; ++k) {
                    arr.push_back(arr[i] ^ 1);
                }
            }
            else if (res == 1) {
                arr.push_back(arr[i]);
                arr.push_back(arr[i] ^ 1);
                arr.push_back(arr[i] ^ 1);
            }
            else {
                arr.push_back(arr[i]);
                arr.push_back(arr[i]);
                arr.push_back(arr[i] ^ 1);
            }
        }
        else {
            check = {i, i + 1, i + 3, i + 2};
            res = use_machine(check);

            if (res == 1) {
                for (int k = 0; k < 3; ++k) {
                    arr.push_back(arr[i] ^ (k&1));
                }
            }
            else if (res == 2) {
                arr.push_back(arr[i] ^ 1);
                arr.push_back(arr[i]);
                arr.push_back(arr[i]);
            }
            else {
                arr.push_back(arr[i] ^ 1);
                arr.push_back(arr[i] ^ 1);
                arr.push_back(arr[i]);
            }
        }
    }
    
    while (arr.size() < n) {
        arr.push_back(arr.back() ^
                     use_machine({(int)arr.size() - 1, (int)arr.size()}));
    }

    int cnt = 0;
    for (int i = 0; i < arr.size(); ++i) {
        cnt += !arr[i];
    }
    return cnt;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:18:42: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   18 |                 arr.push_back(arr[i] ^ (k&1^1));
      |                                         ~^~
mushrooms.cpp:63:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |     while (arr.size() < n) {
      |            ~~~~~~~~~~~^~~
mushrooms.cpp:69:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (int i = 0; i < arr.size(); ++i) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory 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 440 KB Output is correct
6 Partially correct 6 ms 704 KB Output is partially correct
7 Partially correct 33 ms 1048 KB Output is partially correct
8 Partially correct 37 ms 1296 KB Output is partially correct
9 Partially correct 37 ms 1048 KB Output is partially correct
10 Partially correct 62 ms 1020 KB Output is partially correct
11 Partially correct 57 ms 1060 KB Output is partially correct
12 Partially correct 58 ms 976 KB Output is partially correct
13 Partially correct 40 ms 1284 KB Output is partially correct
14 Partially correct 27 ms 744 KB Output is partially correct
15 Partially correct 58 ms 892 KB Output is partially correct
16 Partially correct 65 ms 876 KB Output is partially correct
17 Partially correct 28 ms 780 KB Output is partially correct
18 Partially correct 42 ms 1048 KB Output is partially correct
19 Partially correct 58 ms 892 KB Output is partially correct
20 Partially correct 57 ms 1012 KB Output is partially correct
21 Partially correct 54 ms 784 KB Output is partially correct
22 Partially correct 54 ms 1044 KB Output is partially correct
23 Partially correct 56 ms 792 KB Output is partially correct
24 Partially correct 16 ms 1040 KB Output is partially correct
25 Partially correct 54 ms 1388 KB Output is partially correct
26 Partially correct 56 ms 792 KB Output is partially correct
27 Partially correct 56 ms 1140 KB Output is partially correct
28 Partially correct 64 ms 1056 KB Output is partially correct
29 Partially correct 60 ms 884 KB Output is partially correct
30 Partially correct 62 ms 1008 KB Output is partially correct
31 Partially correct 55 ms 996 KB Output is partially correct
32 Partially correct 62 ms 884 KB Output is partially correct
33 Partially correct 32 ms 988 KB Output is partially correct
34 Partially correct 37 ms 1016 KB Output is partially correct
35 Partially correct 29 ms 1300 KB Output is partially correct
36 Partially correct 34 ms 992 KB Output is partially correct
37 Partially correct 32 ms 1000 KB Output is partially correct
38 Partially correct 28 ms 1052 KB Output is partially correct
39 Partially correct 31 ms 1040 KB Output is partially correct
40 Partially correct 33 ms 1388 KB Output is partially correct
41 Partially correct 31 ms 1024 KB Output is partially correct
42 Partially correct 29 ms 1228 KB Output is partially correct
43 Partially correct 32 ms 772 KB Output is partially correct
44 Partially correct 29 ms 884 KB Output is partially correct
45 Partially correct 30 ms 996 KB Output is partially correct
46 Partially correct 28 ms 1032 KB Output is partially correct
47 Partially correct 30 ms 1060 KB Output is partially correct
48 Partially correct 31 ms 1296 KB Output is partially correct
49 Partially correct 37 ms 796 KB Output is partially correct
50 Partially correct 36 ms 892 KB Output is partially correct
51 Partially correct 34 ms 1052 KB Output is partially correct
52 Partially correct 30 ms 896 KB Output is partially correct
53 Partially correct 33 ms 1504 KB Output is partially correct
54 Partially correct 37 ms 800 KB Output is partially correct
55 Partially correct 29 ms 880 KB Output is partially correct
56 Partially correct 33 ms 1136 KB Output is partially correct
57 Partially correct 30 ms 804 KB Output is partially correct
58 Partially correct 39 ms 744 KB Output is partially correct
59 Partially correct 36 ms 800 KB Output is partially correct
60 Partially correct 33 ms 976 KB Output is partially correct
61 Partially correct 37 ms 764 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 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 1 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 340 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct