oj.uz

Submission #1065896

# Submission time Handle Problem Language Result Execution time Memory
1065896 2024-08-19T12:43:03 Z n1k Counting Mushrooms (IOI20_mushrooms) C++17
50.2222 / 100
 7 ms 600 KB 
    #include <bits/stdc++.h>
	#include "mushrooms.h"
     
    #define ll long long
    #define vt vector
    #define pb push_back
    #define ar array
    #define all(x) (x).begin(), (x).end()
    #define sz(x) (x).size()
     
    using namespace std;
     
    /*
     1. simplify
     2. add new elements
     3. brute force solution
     4. optimize
     5. start implementing
    */
     
    // --- templates ---
     
    // --- code ---
     
     
    const int take = 144 * 2;
     
    int count_mushrooms(int n){
    	vt<vt<int>> shrom(2);
     
    	shrom[0].pb(0);
     
    	for(int i = 1; i < min(3, n); i++){
    		shrom[use_machine({0, i})].pb(i);
    	}
     
    	vt<int> find(4);
     
    	bool isb = shrom[1].size() >= 2;
     
    	find[1] = shrom[isb][0];
    	find[3] = shrom[isb][1];
     
    	for(int i = 3; i < take + 3 && i < n; i+=2){
    		if(i == n - 1){
    			shrom[use_machine({0, i})].pb(i);
    		}else{
    			find[0] = i; find[2] = i + 1;
    			int res = use_machine(find);
    			
    			shrom[(res & 1) ^ isb].pb(i);
     
    			shrom[((res & 2) >> 1) ^ isb].pb(i + 1);	
    		}
    	}
     
    	int cnta = sz(shrom[0]);
     
    	for(int i = take + 3; i < n; i += sz(shrom[isb])){
    		find.clear();
    		for(int j = 0; j < sz(shrom[isb]) && i + j < n; j++){
    			find.pb(shrom[isb][j]);
    			find.pb(i + j);
    		}
    		int res = use_machine(find);
    		if(isb){
    			cnta += (res + 1) / 2;
    		}else{
    			cnta += sz(find) / 2 - (res + 1) / 2;
    		}
    	}
     
    	return cnta;
    }

Compilation message

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

Subtask #1
50.2222 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 416 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Partially correct 4 ms 344 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 7 ms 344 KB Output is partially correct
13 Correct 6 ms 444 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 3 ms 344 KB Output is partially correct
17 Correct 2 ms 344 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 4 ms 444 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Partially correct 4 ms 344 KB Output is partially correct
24 Correct 3 ms 344 KB Output is correct
25 Partially correct 5 ms 344 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 3 ms 344 KB Output is partially correct
29 Partially correct 4 ms 344 KB Output is partially correct
30 Partially correct 6 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 4 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 4 ms 344 KB Output is partially correct
35 Partially correct 3 ms 344 KB Output is partially correct
36 Partially correct 6 ms 344 KB Output is partially correct
37 Partially correct 6 ms 344 KB Output is partially correct
38 Partially correct 4 ms 344 KB Output is partially correct
39 Partially correct 4 ms 344 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 4 ms 344 KB Output is partially correct
42 Partially correct 4 ms 344 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 3 ms 596 KB Output is partially correct
45 Partially correct 4 ms 344 KB Output is partially correct
46 Partially correct 3 ms 344 KB Output is partially correct
47 Partially correct 3 ms 344 KB Output is partially correct
48 Partially correct 5 ms 344 KB Output is partially correct
49 Partially correct 4 ms 344 KB Output is partially correct
50 Partially correct 6 ms 452 KB Output is partially correct
51 Partially correct 3 ms 340 KB Output is partially correct
52 Partially correct 3 ms 344 KB Output is partially correct
53 Partially correct 3 ms 344 KB Output is partially correct
54 Partially correct 6 ms 344 KB Output is partially correct
55 Partially correct 4 ms 340 KB Output is partially correct
56 Partially correct 6 ms 344 KB Output is partially correct
57 Partially correct 3 ms 344 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 4 ms 344 KB Output is partially correct
60 Partially correct 4 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 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 1 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 1 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 1 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 344 KB Output is correct
81 Correct 0 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 1 ms 340 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