oj.uz

Submission #305236

# Submission time Handle Problem Language Result Execution time Memory
305236 2020-09-22T18:57:05 Z oscarsierra12 Counting Mushrooms (IOI20_mushrooms) C++14
80.7143 / 100
 10 ms 508 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std ;

int count_mushrooms(int n) {
	std::vector<int> m;
	vector <int> A, B ;
	A.push_back ( 0 ) ;
	int id = 0 ;
	int ans = 1;
    for ( int i = 1 ; i < n ; ++i ) {
        m.push_back ( i ) ;
        if ( A.size() > B.size() )
            m.push_back ( A[id] ) ;
        else m.push_back ( B[id] ) ;
        id++ ;
        if ( m.size() == max ( A.size(), B.size() ) * 2 ) {
            if ( A.size() > B.size() ) {
                int x = use_machine (m) ;
                ans += A.size() - (x+1)/2 ;
                if ( x % 2 ) B.push_back (m[0]);
                else A.push_back (m[0]) ;
            }
            else {
                int x = use_machine (m) ;
                if ( x % 2 ) A.push_back (m[0]);
                else B.push_back (m[0]) ;
                ans += (x+1)/2 ;
            }
            m.clear() ;
            id = 0 ;
        }
    }
    if ( m.size() ) {
        if ( A.size() > B.size() ) ans += m.size()/2 - (use_machine(m)+1)/2 ;
        else ans += (use_machine(m)+1)/2 ;
    }
	return ans;
}

Subtask #1
80.7143 / 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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 10 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Partially correct 7 ms 256 KB Output is partially correct
11 Partially correct 7 ms 384 KB Output is partially correct
12 Partially correct 8 ms 256 KB Output is partially correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Partially correct 7 ms 256 KB Output is partially correct
16 Partially correct 7 ms 256 KB Output is partially correct
17 Correct 6 ms 256 KB Output is correct
18 Correct 6 ms 508 KB Output is correct
19 Partially correct 7 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 Correct 6 ms 256 KB Output is correct
24 Correct 4 ms 256 KB Output is correct
25 Partially correct 7 ms 256 KB Output is partially correct
26 Partially correct 8 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 8 ms 256 KB Output is partially correct
30 Partially correct 8 ms 256 KB Output is partially correct
31 Partially correct 7 ms 256 KB Output is partially correct
32 Partially correct 9 ms 256 KB Output is partially correct
33 Partially correct 7 ms 256 KB Output is partially correct
34 Partially correct 7 ms 256 KB Output is partially correct
35 Partially correct 7 ms 256 KB Output is partially correct
36 Partially correct 7 ms 384 KB Output is partially correct
37 Partially correct 7 ms 256 KB Output is partially correct
38 Partially correct 9 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 7 ms 256 KB Output is partially correct
42 Partially correct 7 ms 256 KB Output is partially correct
43 Partially correct 7 ms 256 KB Output is partially correct
44 Partially correct 9 ms 384 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 8 ms 256 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 10 ms 256 KB Output is partially correct
51 Partially correct 7 ms 384 KB Output is partially correct
52 Partially correct 7 ms 384 KB Output is partially correct
53 Partially correct 9 ms 256 KB Output is partially correct
54 Partially correct 7 ms 376 KB Output is partially correct
55 Partially correct 7 ms 256 KB Output is partially correct
56 Partially correct 9 ms 256 KB Output is partially correct
57 Partially correct 7 ms 256 KB Output is partially correct
58 Partially correct 7 ms 256 KB Output is partially correct
59 Partially correct 7 ms 384 KB Output is partially correct
60 Partially correct 7 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 0 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 1 ms 256 KB Output is correct
74 Correct 1 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 0 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 1 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 1 ms 384 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