oj.uz

Submission #1115689

# Submission time Handle Problem Language Result Execution time Memory
1115689 2024-11-20T19:17:56 Z Numberz Counting Mushrooms (IOI20_mushrooms) C++14
90.0398 / 100
 11 ms 952 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long

int count_mushrooms(int n) {
  vector<int> A_count = {0};
  vector<int> B_count;
  int total = 1;
  //check the small cases
  if (n <= 90) {
    int sum = 1;
    for (int i = 1; i < n; i++) {
      if (use_machine({0, i}) == 0) sum++;
    }
    return sum;
  }

  
  //first we want to reach a decent ammount of a, b fast with x A y A
  //forework
  if (use_machine({0, 1}) == 0) {
    A_count.push_back(1);
    total++;
  } else {
    B_count.push_back(1);
  }
  //same for 2
  if (use_machine({0, 2}) == 0) {
    A_count.push_back(2);
    total++;
  } else {
    B_count.push_back(2);
  }
  //if a == b
  if (A_count.size() > 1) {
    for (int j = 3; j < 88; j+=2) {
      int sum = use_machine({j, 0, j+1, A_count[1]});
      if (sum == 3) {
        B_count.push_back(j);
        B_count.push_back(j+1);
      } else if (sum == 2) {
        A_count.push_back(j);
        B_count.push_back(j+1);
        total++;
      } else if (sum == 1) {
        B_count.push_back(j);
        A_count.push_back(j+1);
        total++;
      } else {
        A_count.push_back(j);
        A_count.push_back(j+1);
        total+=2;
      }
    }
  } else {
    for (int j = 3; j < 88; j+=2) {
      int sum = use_machine({j, B_count[0], j+1, B_count[1]});
      if (sum == 3) {
        A_count.push_back(j);
        A_count.push_back(j+1);
        total+=2;
      } else if (sum == 2) {
        B_count.push_back(j);
        A_count.push_back(j+1);
        total++;
      } else if (sum == 1) {
        A_count.push_back(j);
        B_count.push_back(j+1);
        total++;
      } else {
        B_count.push_back(j);
        B_count.push_back(j+1);
      }
    }
  }
  int i = 89;
  while (i < n) {
    vector<int> temp;
    int d = 0;
    if (A_count.size() >= B_count.size()) {
      while (i < n && d < A_count.size()) {
        temp.push_back(i);
        temp.push_back(A_count[d]);
        i++;
        d++;
      }
      int sum = use_machine(temp);
      if (sum % 2 == 1) {
        B_count.push_back(temp[0]);
      } else {
        A_count.push_back(temp[0]);
      }
      total += (temp.size()/2 - ((sum+1)/2));
      temp.clear();
      //do the same with B
    } else {
      while (i < n && d < B_count.size()) {
        temp.push_back(i);
        temp.push_back(B_count[d]);
        i++;
        d++;
      }
      int sum = use_machine(temp);
      if (sum % 2 == 1) {
        A_count.push_back(temp[0]);
      } else {
        B_count.push_back(temp[0]);
      }
      total += ((sum+1)/2);
      temp.clear();
    }
  }
  
  return total;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:82:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |       while (i < n && d < A_count.size()) {
      |                       ~~^~~~~~~~~~~~~~~~
mushrooms.cpp:98:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |       while (i < n && d < B_count.size()) {
      |                       ~~^~~~~~~~~~~~~~~~

Subtask #1
90.0398 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 6 ms 336 KB Output is correct
8 Correct 8 ms 592 KB Output is correct
9 Correct 6 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Partially correct 7 ms 336 KB Output is partially correct
12 Partially correct 9 ms 592 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 7 ms 336 KB Output is partially correct
16 Partially correct 8 ms 336 KB Output is partially correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 10 ms 452 KB Output is correct
19 Partially correct 11 ms 952 KB Output is partially correct
20 Correct 7 ms 336 KB Output is correct
21 Correct 10 ms 336 KB Output is correct
22 Partially correct 9 ms 336 KB Output is partially correct
23 Correct 6 ms 336 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Partially correct 7 ms 336 KB Output is partially correct
26 Partially correct 8 ms 336 KB Output is partially correct
27 Partially correct 9 ms 592 KB Output is partially correct
28 Partially correct 10 ms 704 KB Output is partially correct
29 Partially correct 10 ms 336 KB Output is partially correct
30 Partially correct 6 ms 336 KB Output is partially correct
31 Partially correct 7 ms 336 KB Output is partially correct
32 Partially correct 7 ms 500 KB Output is partially correct
33 Partially correct 9 ms 592 KB Output is partially correct
34 Partially correct 8 ms 592 KB Output is partially correct
35 Partially correct 8 ms 468 KB Output is partially correct
36 Partially correct 7 ms 336 KB Output is partially correct
37 Partially correct 9 ms 472 KB Output is partially correct
38 Partially correct 7 ms 336 KB Output is partially correct
39 Partially correct 8 ms 848 KB Output is partially correct
40 Partially correct 8 ms 336 KB Output is partially correct
41 Partially correct 7 ms 336 KB Output is partially correct
42 Partially correct 6 ms 336 KB Output is partially correct
43 Partially correct 6 ms 504 KB Output is partially correct
44 Partially correct 7 ms 716 KB Output is partially correct
45 Partially correct 7 ms 336 KB Output is partially correct
46 Partially correct 7 ms 464 KB Output is partially correct
47 Partially correct 9 ms 336 KB Output is partially correct
48 Partially correct 6 ms 336 KB Output is partially correct
49 Partially correct 9 ms 484 KB Output is partially correct
50 Partially correct 10 ms 336 KB Output is partially correct
51 Partially correct 9 ms 468 KB Output is partially correct
52 Partially correct 6 ms 336 KB Output is partially correct
53 Partially correct 6 ms 504 KB Output is partially correct
54 Partially correct 6 ms 336 KB Output is partially correct
55 Partially correct 7 ms 592 KB Output is partially correct
56 Partially correct 7 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 6 ms 336 KB Output is partially correct
60 Partially correct 7 ms 592 KB Output is partially correct
61 Partially correct 6 ms 336 KB Output is partially correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 1 ms 508 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct
73 Correct 1 ms 336 KB Output is correct
74 Correct 1 ms 336 KB Output is correct
75 Correct 1 ms 336 KB Output is correct
76 Correct 1 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 1 ms 336 KB Output is correct
79 Correct 1 ms 336 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 1 ms 336 KB Output is correct
91 Correct 1 ms 336 KB Output is correct