oj.uz

Submission #944903

# Submission time Handle Problem Language Result Execution time Memory
944903 2024-03-13T07:46:35 Z nguyentunglam Counting Mushrooms (IOI20_mushrooms) C++17
80.7143 / 100
 6 ms 984 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;

int count_mushrooms(int n) {
  int j = 1;
  vector<int> a, b;
  a.push_back(0);
  int ans = 0;
  while (j < n) {
    vector<int> query;
    int total = 0;
    if (a.size() > b.size()) {
      for(int i = 0; i < a.size(); i++) {
        query.push_back(a[i]);
        if (i + 1 < a.size() && j < n) query.push_back(j++), total++;
      }
      if (j < n) query.push_back(j);
      int result = use_machine(query);
      if (j < n) {
        if (result % 2) b.push_back(j);
        else a.push_back(j);
        j++;
      }
      ans += total - result / 2;
    }
    else {
      for(int i = 0; i < b.size(); i++) {
        query.push_back(b[i]);
        if (i + 1 < b.size() && j < n) query.push_back(j++), total++;
      }
      if (j < n) query.push_back(j);
      int result = use_machine(query);
      if (j < n) {
        if (result % 2) a.push_back(j);
        else b.push_back(j);
        j++;
      }
      ans += result / 2;
    }
  }

  return ans + a.size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:14:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |       for(int i = 0; i < a.size(); i++) {
      |                      ~~^~~~~~~~~~
mushrooms.cpp:16:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         if (i + 1 < a.size() && j < n) query.push_back(j++), total++;
      |             ~~~~~~^~~~~~~~~~
mushrooms.cpp:28:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |       for(int i = 0; i < b.size(); i++) {
      |                      ~~^~~~~~~~~~
mushrooms.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         if (i + 1 < b.size() && j < n) query.push_back(j++), total++;
      |             ~~~~~~^~~~~~~~~~

Subtask #1
80.7143 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 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 0 ms 344 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 5 ms 736 KB Output is correct
8 Correct 4 ms 624 KB Output is correct
9 Correct 4 ms 480 KB Output is correct
10 Partially correct 5 ms 480 KB Output is partially correct
11 Partially correct 4 ms 480 KB Output is partially correct
12 Partially correct 4 ms 476 KB Output is partially correct
13 Correct 4 ms 732 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Partially correct 5 ms 480 KB Output is partially correct
16 Partially correct 5 ms 480 KB Output is partially correct
17 Correct 3 ms 720 KB Output is correct
18 Correct 4 ms 480 KB Output is correct
19 Partially correct 4 ms 476 KB Output is partially correct
20 Partially correct 5 ms 480 KB Output is partially correct
21 Partially correct 4 ms 480 KB Output is partially correct
22 Partially correct 5 ms 480 KB Output is partially correct
23 Correct 4 ms 476 KB Output is correct
24 Correct 3 ms 464 KB Output is correct
25 Partially correct 5 ms 480 KB Output is partially correct
26 Partially correct 5 ms 476 KB Output is partially correct
27 Partially correct 5 ms 984 KB Output is partially correct
28 Partially correct 5 ms 480 KB Output is partially correct
29 Partially correct 4 ms 480 KB Output is partially correct
30 Partially correct 4 ms 732 KB Output is partially correct
31 Partially correct 4 ms 476 KB Output is partially correct
32 Partially correct 4 ms 472 KB Output is partially correct
33 Partially correct 4 ms 476 KB Output is partially correct
34 Partially correct 5 ms 480 KB Output is partially correct
35 Partially correct 4 ms 480 KB Output is partially correct
36 Partially correct 5 ms 480 KB Output is partially correct
37 Partially correct 4 ms 476 KB Output is partially correct
38 Partially correct 5 ms 480 KB Output is partially correct
39 Partially correct 6 ms 736 KB Output is partially correct
40 Partially correct 4 ms 732 KB Output is partially correct
41 Partially correct 5 ms 476 KB Output is partially correct
42 Partially correct 4 ms 476 KB Output is partially correct
43 Partially correct 5 ms 476 KB Output is partially correct
44 Partially correct 5 ms 484 KB Output is partially correct
45 Partially correct 5 ms 476 KB Output is partially correct
46 Partially correct 5 ms 480 KB Output is partially correct
47 Partially correct 5 ms 728 KB Output is partially correct
48 Partially correct 4 ms 480 KB Output is partially correct
49 Partially correct 5 ms 480 KB Output is partially correct
50 Partially correct 4 ms 484 KB Output is partially correct
51 Partially correct 6 ms 476 KB Output is partially correct
52 Partially correct 5 ms 484 KB Output is partially correct
53 Partially correct 5 ms 700 KB Output is partially correct
54 Partially correct 5 ms 456 KB Output is partially correct
55 Partially correct 5 ms 480 KB Output is partially correct
56 Partially correct 4 ms 488 KB Output is partially correct
57 Partially correct 4 ms 480 KB Output is partially correct
58 Partially correct 4 ms 464 KB Output is partially correct
59 Partially correct 4 ms 484 KB Output is partially correct
60 Partially correct 4 ms 732 KB Output is partially correct
61 Partially correct 5 ms 736 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 0 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 1 ms 344 KB Output is correct
73 Correct 0 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 1 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 344 KB Output is correct
86 Correct 1 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 1 ms 344 KB Output is correct