oj.uz

Submission #308022

# Submission time Handle Problem Language Result Execution time Memory
308022 2020-09-29T20:40:36 Z Tc14 Counting Mushrooms (IOI20_mushrooms) C++17
80.1418 / 100
 9 ms 384 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;

int count_mushrooms(int n) {

    int ans, l, x, k, u, v, r, a;
    bool z;
    ve<int> M, A, B, C;

    l = 141;
    x = 2 * l + 1;

    ans = 1;
    A.push_back(0);

    for (int i = 1; i <= 2; i++) {
        if (i >= n) return ans;
        M = {0, i};
        if (use_machine(M) == 0) {
            A.push_back(i);
            ans++;
        }
        else B.push_back(i);
    }

    if (A.size() >= 2) {
        z = false;
        C = A;
    }
    else {
        z = true;
        C = B;
    }

    k = 3;
    while (k < x) {
        if (k >= n) return ans;

        M = {C[0], k, C[1]};
        u = k;
        k++;

        if (k < n) {
            M.push_back(k);
            v = k;
            k++;
        }
        else v = -1;
        
        r = use_machine(M);

        if ((r / 2 == 1) == z) {
            ans++;
            A.push_back(u);
        }
        else B.push_back(u);

        if (v != -1) {
            if ((r % 2 == 1) == z) {
                ans++;
                A.push_back(v);
            }
            else B.push_back(v);
        }
    }

    if (A.size() >= l + 1) {
        z = false;
        C = A;
    }
    else {
        z = true;
        C = B;
    }

    while (k < n) {
        M = {};
        a = 0;
        for (int i = 0; i < l; i++) {
            if (k >= n) break;
            M.push_back(C[i]);
            M.push_back(k);
            k++;
            a++;
        }
        M.push_back(C[a]);

        r = use_machine(M);
        if (z) ans += r / 2;
        else ans += a - (r / 2);
    }

	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:73:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   73 |     if (A.size() >= l + 1) {
      |         ~~~~~~~~~^~~~~~~~

Subtask #1
80.1418 / 100.0

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