oj.uz

Submission #304041

# Submission time Handle Problem Language Result Execution time Memory
304041 2020-09-21T01:25:51 Z Fdg Counting Mushrooms (IOI20_mushrooms) C++14
80.1418 / 100
 10 ms 512 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include "mushrooms.h"

using namespace std;

const int VAL = 150;

vector<int> a, b;

int count_mushrooms(int n) {
  a.clear(); b.clear();

  srand(time(NULL));
  vector<int> v;
  for (int i = 1; i < n; ++i)
    v.push_back(i);
  random_shuffle(v.begin(), v.end());

  int ans = 0, pos = 0;

  a.push_back(0);
  while (a.size() < VAL && b.size() < VAL && pos < (int) v.size()) {
    if (a.size() > 1) {
      vector<int> arr = {a[0]};
      if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;
      arr.push_back(a[1]); 
      if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;

      int ret = use_machine(arr);
      if (ret & 2) {
        b.push_back(arr[1]);
      } else {
        a.push_back(arr[1]);
      }
      if (arr.size() > 3) {
        if (ret & 1) {
          b.push_back(arr[3]);
        } else {
          a.push_back(arr[3]);
        }
      }
    } else if (b.size() > 1) {
      vector<int> arr = {b[0]};
      if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;
      arr.push_back(b[1]); 
      if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;

      int ret = use_machine(arr);
      if (ret & 2) {
        a.push_back(arr[1]);
      } else {
        b.push_back(arr[1]);
      }
      if (arr.size() > 3) {
        if (ret & 1) {
          a.push_back(arr[3]);
        } else {
          b.push_back(arr[3]);
        }
      }
    } else {
      vector<int> arr = {a[0]};
      if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;

      int ret = use_machine(arr);
      if (ret & 1) {
        b.push_back(arr[1]);
      } else {
        a.push_back(arr[1]);
      }
    }
  }

  ans = a.size();

  if (a.size() >= b.size()) {
    while (pos < (int) v.size()) {
      vector<int> arr;
      int used = 0;
      for (int i = 0; i < (int) a.size(); ++i) {
        arr.push_back(a[i]);
        if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos, ++used;
        else break;
      }
      int ret = use_machine(arr);
      int diff = (ret / 2) + (ret & 1);
      ans += used - diff;
    }
  } else {
    while (pos < (int) v.size()) {
      vector<int> arr;
      int used = 0;
      for (int i = 0; i < (int) b.size(); ++i) {
        arr.push_back(b[i]);
        if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos, ++used;
        else break;
      }
      int ret = use_machine(arr);
      int diff = (ret / 2) + (ret & 1);
      ans += diff;
    }
  }

  return ans;
}

// int count_mushrooms(int n) {
//   int ans = 1;
//   for (int i = 1; i < n; i += 2) {
//     vector<int> v;
//     if (i + 1 < n) v = {i, 0, i + 1};
//     else v = {i, 0};
//     int ret = use_machine(v);
//     ans += (v.size() - 1) - ret;
//   }
//   return ans;
// }

// int main() {
//   ios::sync_with_stdio(false);

//   return 0; 
// }

Subtask #1
80.1418 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 8 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Partially correct 8 ms 512 KB Output is partially correct
11 Partially correct 8 ms 512 KB Output is partially correct
12 Partially correct 8 ms 512 KB Output is partially correct
13 Correct 8 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Partially correct 10 ms 512 KB Output is partially correct
16 Partially correct 9 ms 512 KB Output is partially correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 8 ms 512 KB Output is correct
19 Partially correct 10 ms 512 KB Output is partially correct
20 Partially correct 8 ms 512 KB Output is partially correct
21 Partially correct 8 ms 512 KB Output is partially correct
22 Partially correct 8 ms 512 KB Output is partially correct
23 Partially correct 8 ms 512 KB Output is partially correct
24 Correct 5 ms 384 KB Output is correct
25 Partially correct 9 ms 512 KB Output is partially correct
26 Partially correct 8 ms 512 KB Output is partially correct
27 Partially correct 7 ms 512 KB Output is partially correct
28 Partially correct 9 ms 512 KB Output is partially correct
29 Partially correct 9 ms 512 KB Output is partially correct
30 Partially correct 9 ms 512 KB Output is partially correct
31 Partially correct 10 ms 512 KB Output is partially correct
32 Partially correct 8 ms 512 KB Output is partially correct
33 Partially correct 8 ms 512 KB Output is partially correct
34 Partially correct 9 ms 512 KB Output is partially correct
35 Partially correct 9 ms 512 KB Output is partially correct
36 Partially correct 10 ms 512 KB Output is partially correct
37 Partially correct 9 ms 512 KB Output is partially correct
38 Partially correct 9 ms 512 KB Output is partially correct
39 Partially correct 8 ms 512 KB Output is partially correct
40 Partially correct 10 ms 512 KB Output is partially correct
41 Partially correct 8 ms 512 KB Output is partially correct
42 Partially correct 9 ms 512 KB Output is partially correct
43 Partially correct 8 ms 512 KB Output is partially correct
44 Partially correct 9 ms 512 KB Output is partially correct
45 Partially correct 9 ms 512 KB Output is partially correct
46 Partially correct 9 ms 512 KB Output is partially correct
47 Partially correct 9 ms 512 KB Output is partially correct
48 Partially correct 8 ms 512 KB Output is partially correct
49 Partially correct 8 ms 512 KB Output is partially correct
50 Partially correct 8 ms 512 KB Output is partially correct
51 Partially correct 9 ms 512 KB Output is partially correct
52 Partially correct 10 ms 512 KB Output is partially correct
53 Partially correct 9 ms 512 KB Output is partially correct
54 Partially correct 9 ms 512 KB Output is partially correct
55 Partially correct 9 ms 512 KB Output is partially correct
56 Partially correct 7 ms 512 KB Output is partially correct
57 Partially correct 9 ms 512 KB Output is partially correct
58 Partially correct 8 ms 512 KB Output is partially correct
59 Partially correct 8 ms 512 KB Output is partially correct
60 Partially correct 9 ms 512 KB Output is partially correct
61 Partially correct 8 ms 512 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 1 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 1 ms 256 KB Output is correct
73 Correct 0 ms 256 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 1 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 1 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 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 1 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 1 ms 256 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct