oj.uz

Submission #885444

# Submission time Handle Problem Language Result Execution time Memory
885444 2023-12-09T17:58:48 Z epicci23 Counting Mushrooms (IOI20_mushrooms) C++17
79.021 / 100
 6 ms 700 KB 
#include "mushrooms.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define pb push_back
#define sz(x) ((int)(x).size())

const int BL = 120;

int count_mushrooms(int n){

  int ans=1,p=1;
  vector<int> ind_a,ind_b;
  ind_a.pb(0);

  for(int i=p;i<=min(n-1,BL);i++){
    p++;
    int xd = use_machine({0,i});
    if(xd==0){
      ans++;
      ind_a.pb(i);
    }
    else ind_b.pb(i);
    if(sz(ind_b)==2 || sz(ind_a)==2) break;
  }

  if(p>=n) return ans;

  for(int i=p;i<=min(n-1,2*BL);i+=2){
    if(i==n-1){
      p++;
      int xd = use_machine({0,i});
      if(xd==0){
       ans++;
       ind_a.pb(i);
      }
      else ind_b.pb(i);
      break;
    }
    p+=2;
    if(sz(ind_a)>=2){
      int xd = use_machine({i+1,ind_a[0],i,ind_a[1]});
      if(xd&2LL) ind_b.pb(i);
      else {ans++;ind_a.pb(i);}
      if(xd&1LL) ind_b.pb(i+1);
      else {ans++;ind_a.pb(i+1);}
    }
    else{
      int xd = use_machine({i+1,ind_b[0],i,ind_b[1]});
      if(xd&2LL) {ans++;ind_a.pb(i);}
      else ind_b.pb(i);
      if(xd&1LL) {ans++;ind_a.pb(i+1);}
      else ind_b.pb(i+1);
    }
  }

  if(p>=n) return ans;
  
  for(int i=p;i<n;i+=BL){
  	vector<int> que;
    for(int j=i;j<min(n,i+BL);j++) que.pb(j);

    if(sz(ind_a)>=BL){
      vector<int> haha;
      for(int j=0;j<sz(que);j++){
        haha.pb(que[j]);
        haha.pb(ind_a[j]);
      }
      int res = use_machine(haha);
      ans += sz(que) - 1 - res/2;
      ans += 1 - (res&1);
    }
    else{
      vector<int> haha;
      for(int j=0;j<sz(que);j++){
        haha.pb(que[j]);
        haha.pb(ind_b[j]);
      }
      int res = use_machine(haha);
      ans += res/2;
      ans += (res&1);
    } 
  }

  return ans;
}

Subtask #1
79.021 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 Correct 1 ms 452 KB Output is correct
7 Partially correct 4 ms 444 KB Output is partially correct
8 Partially correct 5 ms 444 KB Output is partially correct
9 Partially correct 5 ms 444 KB Output is partially correct
10 Partially correct 5 ms 700 KB Output is partially correct
11 Partially correct 4 ms 440 KB Output is partially correct
12 Partially correct 5 ms 696 KB Output is partially correct
13 Partially correct 5 ms 436 KB Output is partially correct
14 Correct 3 ms 444 KB Output is correct
15 Partially correct 4 ms 452 KB Output is partially correct
16 Partially correct 5 ms 440 KB Output is partially correct
17 Correct 3 ms 440 KB Output is correct
18 Partially correct 6 ms 444 KB Output is partially correct
19 Partially correct 4 ms 448 KB Output is partially correct
20 Partially correct 5 ms 444 KB Output is partially correct
21 Partially correct 6 ms 444 KB Output is partially correct
22 Partially correct 4 ms 444 KB Output is partially correct
23 Partially correct 4 ms 444 KB Output is partially correct
24 Correct 3 ms 444 KB Output is correct
25 Partially correct 6 ms 444 KB Output is partially correct
26 Partially correct 5 ms 444 KB Output is partially correct
27 Partially correct 6 ms 448 KB Output is partially correct
28 Partially correct 5 ms 440 KB Output is partially correct
29 Partially correct 5 ms 448 KB Output is partially correct
30 Partially correct 4 ms 448 KB Output is partially correct
31 Partially correct 5 ms 696 KB Output is partially correct
32 Partially correct 5 ms 440 KB Output is partially correct
33 Partially correct 5 ms 440 KB Output is partially correct
34 Partially correct 4 ms 444 KB Output is partially correct
35 Partially correct 5 ms 444 KB Output is partially correct
36 Partially correct 5 ms 440 KB Output is partially correct
37 Partially correct 5 ms 440 KB Output is partially correct
38 Partially correct 4 ms 440 KB Output is partially correct
39 Partially correct 5 ms 440 KB Output is partially correct
40 Partially correct 5 ms 444 KB Output is partially correct
41 Partially correct 5 ms 440 KB Output is partially correct
42 Partially correct 5 ms 500 KB Output is partially correct
43 Partially correct 5 ms 440 KB Output is partially correct
44 Partially correct 4 ms 444 KB Output is partially correct
45 Partially correct 4 ms 444 KB Output is partially correct
46 Partially correct 5 ms 440 KB Output is partially correct
47 Partially correct 5 ms 444 KB Output is partially correct
48 Partially correct 4 ms 440 KB Output is partially correct
49 Partially correct 4 ms 448 KB Output is partially correct
50 Partially correct 4 ms 448 KB Output is partially correct
51 Partially correct 5 ms 440 KB Output is partially correct
52 Partially correct 6 ms 440 KB Output is partially correct
53 Partially correct 5 ms 444 KB Output is partially correct
54 Partially correct 5 ms 444 KB Output is partially correct
55 Partially correct 6 ms 444 KB Output is partially correct
56 Partially correct 5 ms 444 KB Output is partially correct
57 Partially correct 5 ms 440 KB Output is partially correct
58 Partially correct 5 ms 448 KB Output is partially correct
59 Partially correct 5 ms 440 KB Output is partially correct
60 Partially correct 4 ms 444 KB Output is partially correct
61 Partially correct 5 ms 440 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 1 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 1 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 0 ms 352 KB Output is correct
70 Correct 0 ms 352 KB Output is correct
71 Correct 0 ms 352 KB Output is correct
72 Correct 1 ms 356 KB Output is correct
73 Correct 0 ms 352 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 1 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 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 384 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