oj.uz

답안 #304028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304028 2020-09-21T01:12:04 Z Fdg 버섯 세기 (IOI20_mushrooms) C++14
10 / 100
 243 ms 804 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include "mushrooms.h"

using namespace std;

const int VAL = 141;

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 (pos < (int) v.size()/*a.size() < VAL || b.size() < VAL*/) {
    // 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 (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 (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();

  return ans;
}

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Partially correct 18 ms 384 KB Output is partially correct
7 Partially correct 188 ms 636 KB Output is partially correct
8 Partially correct 163 ms 712 KB Output is partially correct
9 Partially correct 130 ms 796 KB Output is partially correct
10 Partially correct 180 ms 584 KB Output is partially correct
11 Partially correct 168 ms 584 KB Output is partially correct
12 Partially correct 167 ms 636 KB Output is partially correct
13 Partially correct 224 ms 636 KB Output is partially correct
14 Partially correct 53 ms 492 KB Output is partially correct
15 Partially correct 132 ms 624 KB Output is partially correct
16 Partially correct 162 ms 512 KB Output is partially correct
17 Partially correct 129 ms 384 KB Output is partially correct
18 Partially correct 172 ms 632 KB Output is partially correct
19 Partially correct 189 ms 512 KB Output is partially correct
20 Partially correct 193 ms 564 KB Output is partially correct
21 Partially correct 185 ms 632 KB Output is partially correct
22 Partially correct 162 ms 644 KB Output is partially correct
23 Partially correct 186 ms 632 KB Output is partially correct
24 Partially correct 108 ms 492 KB Output is partially correct
25 Partially correct 161 ms 676 KB Output is partially correct
26 Partially correct 191 ms 580 KB Output is partially correct
27 Partially correct 200 ms 588 KB Output is partially correct
28 Partially correct 151 ms 624 KB Output is partially correct
29 Partially correct 185 ms 632 KB Output is partially correct
30 Partially correct 229 ms 640 KB Output is partially correct
31 Partially correct 125 ms 676 KB Output is partially correct
32 Partially correct 178 ms 680 KB Output is partially correct
33 Partially correct 178 ms 512 KB Output is partially correct
34 Partially correct 134 ms 632 KB Output is partially correct
35 Partially correct 181 ms 632 KB Output is partially correct
36 Partially correct 148 ms 628 KB Output is partially correct
37 Partially correct 199 ms 512 KB Output is partially correct
38 Partially correct 195 ms 676 KB Output is partially correct
39 Partially correct 183 ms 632 KB Output is partially correct
40 Partially correct 149 ms 804 KB Output is partially correct
41 Partially correct 172 ms 632 KB Output is partially correct
42 Partially correct 190 ms 512 KB Output is partially correct
43 Partially correct 211 ms 632 KB Output is partially correct
44 Partially correct 204 ms 632 KB Output is partially correct
45 Partially correct 182 ms 632 KB Output is partially correct
46 Partially correct 227 ms 512 KB Output is partially correct
47 Partially correct 210 ms 632 KB Output is partially correct
48 Partially correct 232 ms 628 KB Output is partially correct
49 Partially correct 185 ms 584 KB Output is partially correct
50 Partially correct 202 ms 632 KB Output is partially correct
51 Partially correct 179 ms 632 KB Output is partially correct
52 Partially correct 116 ms 628 KB Output is partially correct
53 Partially correct 196 ms 632 KB Output is partially correct
54 Partially correct 193 ms 632 KB Output is partially correct
55 Partially correct 243 ms 512 KB Output is partially correct
56 Partially correct 205 ms 692 KB Output is partially correct
57 Partially correct 186 ms 632 KB Output is partially correct
58 Partially correct 186 ms 760 KB Output is partially correct
59 Partially correct 220 ms 512 KB Output is partially correct
60 Partially correct 214 ms 632 KB Output is partially correct
61 Partially correct 190 ms 512 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 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 1 ms 256 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 1 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 0 ms 256 KB Output is correct
73 Correct 1 ms 256 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 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 1 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 1 ms 256 KB Output is correct
86 Correct 0 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 1 ms 256 KB Output is correct