oj.uz

Submission #585270

# Submission time Handle Problem Language Result Execution time Memory
585270 2022-06-28T13:39:29 Z LucaIlie Counting Mushrooms (IOI20_mushrooms) C++17
80.1418 / 100
 13 ms 392 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

int use_machine( vector <int> x );

int count_mushrooms( int n ) {
    bool isA;
    const int k = min( n, max( 3, ((int)sqrt( 4 * n )) * 2 / 2 + 1 ) ), a = 0, b = 1;
    int nrA, pos1, pos2, bs;
    vector <int> s( n ), pos;

    if ( n <= 10 ) {
        nrA = 1;
        for ( int i = 1; i < n; i++ )
            nrA += 1 - use_machine( { 0, i } );
        return nrA;
    }

    s[0] = a;
    s[1] = use_machine( { 0, 1 } ) == 0 ? a : b;
    s[2] = use_machine( { 0, 2 } ) == 0 ? a : b;
    nrA = (s[0] == a) + (s[1] == a) + (s[2] == a);
    if ( nrA == 1 ) {
        isA = false;
        pos1 = 1;
        pos2 = 2;
    } else {
        isA = true;
        pos1 = 0;
        pos2 = (s[1] == a ? 1 : 2);
    }

    for ( int i = 3; i < k; i += 2 ) {
        int r = use_machine( { pos1, i, pos2, i + 1 } );
        if ( r == 0 )
            s[i] = s[i + 1] = (isA ? a : b);
        else if ( r == 1 ) {
            s[i] = (isA ? a : b);
            s[i + 1] = (isA ? b : a);
        } else if ( r == 2 ) {
            s[i] = (isA ? b : a);
            s[i + 1] = (isA ? a : b);
        } else
            s[i] = s[i + 1] = (isA ? b : a);
    }
    for ( int i = 3; i < k; i++ )
        nrA += (s[i] == a);
    if ( nrA > k / 2 ) {
        bs = nrA - 1;
        isA = true;
    } else {
        bs = k - nrA - 1;
        isA = false;
    }
    for ( int i = 0; i < k; i++ ) {
        if ( s[i] == (isA ? a : b) )
            pos.push_back( i );
    }

    for ( int i = k; i < n; i += bs ) {
        int j;
        vector <int> m;

        for ( j = 0; j + 1 < pos.size() && i + j < n; j++ ) {
            m.push_back( pos[j] );
            m.push_back( i + j );
        }
        m.push_back( pos.back() );

        if ( isA )
            nrA += j - use_machine( m ) / 2;
        else
            nrA += use_machine( m ) / 2;
    }

    return nrA;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:66:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for ( j = 0; j + 1 < pos.size() && i + j < n; j++ ) {
      |                      ~~~~~~^~~~~~~~~~~~

Subtask #1
80.1418 / 100.0

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