oj.uz

답안 #304311

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304311 2020-09-21T06:01:37 Z Fdg 버섯 세기 (IOI20_mushrooms) C++14
98.2609 / 100
 16 ms 640 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include "mushrooms.h"

using namespace std;

const int VAL = 110;

vector<int> a, b, missing;

map<int, vector<int>> diff, eq;
set<int> found;

void nextPos(const vector<int>& v, int& pos) {
  while (pos < (int) v.size()) {
    if (found.count(v[pos])) {
      ++pos;
    } else break;
  }
}

void process(int x, bool isA) {
  if (found.count(x)) return;
  found.insert(x);

  if (isA) a.push_back(x);
  else b.push_back(x);

  if (diff.count(x))
    for (int val : diff[x]) {
      process(val, !isA);
    }

  if (eq.count(x))
    for (int val : eq[x]) {
      process(val, isA);
    }
}

int count_mushrooms(int n) {
  a.clear(); b.clear(); diff.clear(); found.clear(); missing.clear();

  srand(time(NULL));
  vector<int> v;
  // for (int i = 0; i < n; ++i)
  //   v.push_back(i);
  // for (int it = 0; it < 1; ++it) {
  //   random_shuffle(v.begin(), v.end());
  //   use_machine(v);
  // }

  v.clear();
  for (int i = 1; i < n; ++i)
    v.push_back(i);
  random_shuffle(v.begin(), v.end());

  v.push_back(0);
  use_machine(v);
  v.pop_back();

  int ans = 0, pos = 0;

  bool doNextSimple = false;

  double COEF = 1.2;
  int iter = 1;

  a.push_back(0); found.insert(0);
  while (a.size() < VAL && b.size() < VAL && pos < (int) v.size()) {
    // if (a.size() > 100 && a.size() > COEF * b.size()) break;
    // if (b.size() > 100 && b.size() > COEF * a.size()) break;

    if ((n - a.size() - b.size()) / max(a.size(), b.size()) + iter <= 228) break;
    ++iter;
    if (iter >= VAL) break;

    if (a.size() > 2) {
      vector<int> arr;
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(a[0]);
        arr.push_back(v[pos]), ++pos;
      }
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(a[1]);
        arr.push_back(v[pos]), ++pos; 
      }
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(a[2]);
        arr.push_back(v[pos]), ++pos; 
      }

      doNextSimple = false;
      int ret = use_machine(arr);
      if (arr.size() == 2) {
        if (ret == 1) {
          process(arr[1], false);
        } else {
          process(arr[1], true);
        }
      } else if (arr.size() == 4) {
        if (ret == 3) {
          process(arr[1], false);
          process(arr[3], false);
        } else if (ret == 2) {
          process(arr[1], false);
          process(arr[3], true);
        } else if (ret == 1) {
          process(arr[1], true);
          process(arr[3], false); 
        } else {
          process(arr[1], true);
          process(arr[3], true);
        }
      } else if (arr.size() == 6) {
        if (ret == 5) {
          process(arr[1], false);
          process(arr[3], false);
          process(arr[5], false);
        } else if (ret == 4) {
          process(arr[1], false);
          process(arr[3], false);
          process(arr[5], true);
        } else if (ret == 3) {
          process(arr[5], false);
          diff[arr[1]].push_back(arr[3]);
          diff[arr[3]].push_back(arr[1]);
          missing.push_back(arr[1]);
          --pos;
          v[pos] = arr[3];
          if (pos + 2 < (int) v.size()) swap(v[pos], v[pos + 2]);
          doNextSimple = true;
        } else if (ret == 2) {
          process(arr[5], true);
          diff[arr[1]].push_back(arr[3]);
          diff[arr[3]].push_back(arr[1]);
          missing.push_back(arr[1]);
          --pos;
          v[pos] = arr[3];
          if (pos + 2 < (int) v.size()) swap(v[pos], v[pos + 2]);
          doNextSimple = true;
        } else if (ret == 1) {
          process(arr[1], true);
          process(arr[3], true);
          process(arr[5], false);
        } else {
          process(arr[1], true);
          process(arr[3], true);
          process(arr[5], true);
        }
      }
    } else if (b.size() > 2) {
      vector<int> arr;
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(b[0]);
        arr.push_back(v[pos]), ++pos;
      }
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(b[1]);
        arr.push_back(v[pos]), ++pos; 
      }
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(b[2]);
        arr.push_back(v[pos]), ++pos; 
      }

      doNextSimple = false;
      int ret = use_machine(arr);
      if (arr.size() == 2) {
        if (ret == 1) {
          process(arr[1], true);
        } else {
          process(arr[1], false);
        }
      } else if (arr.size() == 4) {
        if (ret == 3) {
          process(arr[1], true);
          process(arr[3], true);
        } else if (ret == 2) {
          process(arr[1], true);
          process(arr[3], false);
        } else if (ret == 1) {
          process(arr[1], false);
          process(arr[3], true); 
        } else {
          process(arr[1], false);
          process(arr[3], false);
        }
      } else if (arr.size() == 6) {
        if (ret == 5) {
          process(arr[1], true);
          process(arr[3], true);
          process(arr[5], true);
        } else if (ret == 4) {
          process(arr[1], true);
          process(arr[3], true);
          process(arr[5], false);
        } else if (ret == 3) {
          process(arr[5], true);
          diff[arr[1]].push_back(arr[3]);
          diff[arr[3]].push_back(arr[1]);
          missing.push_back(arr[3]);
          --pos;
          v[pos] = arr[1];
          if (pos + 2 < (int) v.size()) swap(v[pos], v[pos + 2]);
          doNextSimple = true;
        } else if (ret == 2) {
          process(arr[5], false);
          diff[arr[1]].push_back(arr[3]);
          diff[arr[3]].push_back(arr[1]);
          missing.push_back(arr[3]);
          --pos;
          v[pos] = arr[1];
          if (pos + 2 < (int) v.size()) swap(v[pos], v[pos + 2]);
          doNextSimple = true;
        } else if (ret == 1) {
          process(arr[1], false);
          process(arr[3], false);
          process(arr[5], true);
        } else {
          process(arr[1], false);
          process(arr[3], false);
          process(arr[5], false);
        }
      }
    } else

    /*if (a.size() > 1) {
      vector<int> arr;
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(v[pos]), ++pos;
        arr.push_back(a[0]);
      }
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(v[pos]), ++pos;
        arr.push_back(a[1]); 
      }
      if (!doNextSimple) {
        nextPos(v, pos);
        if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;
      }

      doNextSimple = false;
      int ret = use_machine(arr);
      if (arr.size() == 2) {
        if (ret == 1) {
          process(arr[0], false);
        } else {
          process(arr[0], true);
        }
      } else if (arr.size() == 4) {
        if (ret == 3) {
          process(arr[0], false);
          process(arr[2], false);
        } else if (ret == 2) {
          process(arr[0], true);
          process(arr[2], false);
        } else if (ret == 1) {
          process(arr[0], false);
          process(arr[2], true); 
        } else {
          process(arr[0], true);
          process(arr[2], true);
        }
      } else if (arr.size() == 5) {
        if (ret == 4) {
          process(arr[0], false);
          process(arr[2], false);
          process(arr[4], false);
        } else if (ret == 3) {
          process(arr[2], false);
          diff[arr[0]].push_back(arr[4]);
          diff[arr[4]].push_back(arr[0]);
          missing.push_back(arr[4]);
          --pos;
          v[pos] = arr[0];
          if (pos + 1 < (int) v.size()) swap(v[pos], v[pos + 1]);
          doNextSimple = true;
        } else if (ret == 2) {
          diff[arr[0]].push_back(arr[2]);
          diff[arr[2]].push_back(arr[0]);
          diff[arr[4]].push_back(arr[2]);
          diff[arr[2]].push_back(arr[4]);
          eq[arr[0]].push_back(arr[4]);
          eq[arr[4]].push_back(arr[0]);
          missing.push_back(arr[0]);
          missing.push_back(arr[4]);
          --pos;
          v[pos] = arr[2];
          if (pos + 1 < (int) v.size()) swap(v[pos], v[pos + 1]);
          doNextSimple = true;
        } else if (ret == 1) {
          process(arr[2], true);
          diff[arr[0]].push_back(arr[4]);
          diff[arr[4]].push_back(arr[0]);
          missing.push_back(arr[4]);
          --pos;
          v[pos] = arr[0];
          if (pos + 1 < (int) v.size()) swap(v[pos], v[pos + 1]);
          doNextSimple = true;
        } else {
          process(arr[0], true);
          process(arr[2], true);
          process(arr[4], true);
        }
      }
    } else if (b.size() > 1) {
      vector<int> arr;
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(v[pos]), ++pos;
        arr.push_back(b[0]);
      }
      nextPos(v, pos);
      if (pos < (int) v.size()) {
        arr.push_back(v[pos]), ++pos;
        arr.push_back(b[1]); 
      }
      if (!doNextSimple) {
        nextPos(v, pos);
        if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;
      }

      doNextSimple = false;
      int ret = use_machine(arr);
      if (arr.size() == 2) {
        if (ret == 1) {
          process(arr[0], true);
        } else {
          process(arr[0], false);
        }
      } else if (arr.size() == 4) {
        if (ret == 3) {
          process(arr[0], true);
          process(arr[2], true);
        } else if (ret == 2) {
          process(arr[0], false);
          process(arr[2], true);
        } else if (ret == 1) {
          process(arr[0], true);
          process(arr[2], false); 
        } else {
          process(arr[0], false);
          process(arr[2], false);
        }
      } else if (arr.size() == 5) {
        if (ret == 4) {
          process(arr[0], true);
          process(arr[2], true);
          process(arr[4], true);
        } else if (ret == 3) {
          process(arr[2], true);
          diff[arr[0]].push_back(arr[4]);
          diff[arr[4]].push_back(arr[0]);
          missing.push_back(arr[4]);
          --pos;
          v[pos] = arr[0];
          if (pos + 1 < (int) v.size()) swap(v[pos], v[pos + 1]);
          doNextSimple = true;
        } else if (ret == 2) {
          diff[arr[0]].push_back(arr[2]);
          diff[arr[2]].push_back(arr[0]);
          diff[arr[4]].push_back(arr[2]);
          diff[arr[2]].push_back(arr[4]);
          eq[arr[0]].push_back(arr[4]);
          eq[arr[4]].push_back(arr[0]);
          missing.push_back(arr[0]);
          missing.push_back(arr[4]);
          --pos;
          v[pos] = arr[2];
          if (pos + 1 < (int) v.size()) swap(v[pos], v[pos + 1]);
          doNextSimple = true;
        } else if (ret == 1) {
          process(arr[2], false);
          diff[arr[0]].push_back(arr[4]);
          diff[arr[4]].push_back(arr[0]);
          missing.push_back(arr[4]);
          --pos;
          v[pos] = arr[0];
          if (pos + 1 < (int) v.size()) swap(v[pos], v[pos + 1]);
          doNextSimple = true;
        } else {
          process(arr[0], false);
          process(arr[2], false);
          process(arr[4], false);
        }
      }
    } else */{
      vector<int> arr = {a[0]};
      nextPos(v, pos);
      if (pos < (int) v.size()) arr.push_back(v[pos]), ++pos;
      else break;

      doNextSimple = false;
      int ret = use_machine(arr);
      if (ret & 1) {
        process(arr[1], false);
      } else {
        process(arr[1], true);
      }
    }
  }

  ans = a.size();

  // if (a.size() + b.size() != n) exit(-1);

  for (int x : missing) {
    if (!found.count(x))
      v.push_back(x);
  }

  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]);
        nextPos(v, pos);
        if (pos < (int) v.size()) {
          if (i + 1 == (int) a.size()) {
            arr.push_back(v.back());
            v.pop_back();
          } else {
            arr.push_back(v[pos]), ++pos;
          }
          ++used;
        } else break;
      }
      int ret = use_machine(arr);
      int diff = (ret / 2) + (ret & 1);
      ans += used - diff;
      if (ret & 1) {
        b.push_back(arr.back());
      } else {
        a.push_back(arr.back());
      }
    }
  } 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]);
        nextPos(v, pos);
        if (pos < (int) v.size()) {
          if (i + 1 == (int) b.size()) {
            arr.push_back(v.back());
            v.pop_back();
          } else {
            arr.push_back(v[pos]), ++pos;
          }
          ++used;
        } else break;
      }
      int ret = use_machine(arr);
      int diff = (ret / 2) + (ret & 1);
      ans += diff;
      if (ret & 1) {
        a.push_back(arr.back());
      } else {
        b.push_back(arr.back());
      }
    }
  }

  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; 
// }

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:66:8: warning: variable 'doNextSimple' set but not used [-Wunused-but-set-variable]
   66 |   bool doNextSimple = false;
      |        ^~~~~~~~~~~~
mushrooms.cpp:68:10: warning: unused variable 'COEF' [-Wunused-variable]
   68 |   double COEF = 1.2;
      |          ^~~~

Subtask #1
98.2609 / 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 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 10 ms 512 KB Output is correct
8 Correct 10 ms 512 KB Output is correct
9 Correct 11 ms 512 KB Output is correct
10 Correct 11 ms 512 KB Output is correct
11 Correct 12 ms 512 KB Output is correct
12 Correct 14 ms 512 KB Output is correct
13 Correct 13 ms 512 KB Output is correct
14 Correct 8 ms 384 KB Output is correct
15 Correct 11 ms 512 KB Output is correct
16 Correct 12 ms 512 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 12 ms 512 KB Output is correct
20 Correct 10 ms 512 KB Output is correct
21 Correct 10 ms 512 KB Output is correct
22 Correct 12 ms 512 KB Output is correct
23 Correct 10 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Partially correct 11 ms 640 KB Output is partially correct
26 Correct 12 ms 640 KB Output is correct
27 Correct 12 ms 512 KB Output is correct
28 Correct 12 ms 512 KB Output is correct
29 Partially correct 11 ms 640 KB Output is partially correct
30 Correct 16 ms 512 KB Output is correct
31 Correct 11 ms 512 KB Output is correct
32 Correct 11 ms 512 KB Output is correct
33 Correct 12 ms 512 KB Output is correct
34 Correct 12 ms 512 KB Output is correct
35 Correct 14 ms 512 KB Output is correct
36 Correct 12 ms 640 KB Output is correct
37 Correct 11 ms 640 KB Output is correct
38 Correct 12 ms 512 KB Output is correct
39 Partially correct 11 ms 636 KB Output is partially correct
40 Partially correct 16 ms 512 KB Output is partially correct
41 Correct 13 ms 512 KB Output is correct
42 Partially correct 12 ms 512 KB Output is partially correct
43 Correct 11 ms 640 KB Output is correct
44 Correct 14 ms 512 KB Output is correct
45 Correct 12 ms 512 KB Output is correct
46 Partially correct 11 ms 636 KB Output is partially correct
47 Partially correct 11 ms 512 KB Output is partially correct
48 Correct 14 ms 512 KB Output is correct
49 Correct 12 ms 592 KB Output is correct
50 Correct 13 ms 512 KB Output is correct
51 Partially correct 11 ms 512 KB Output is partially correct
52 Correct 12 ms 512 KB Output is correct
53 Correct 14 ms 512 KB Output is correct
54 Correct 13 ms 616 KB Output is correct
55 Partially correct 13 ms 512 KB Output is partially correct
56 Partially correct 13 ms 512 KB Output is partially correct
57 Correct 15 ms 512 KB Output is correct
58 Correct 15 ms 512 KB Output is correct
59 Correct 10 ms 512 KB Output is correct
60 Correct 11 ms 616 KB Output is correct
61 Correct 15 ms 512 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 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 1 ms 256 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 1 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 0 ms 256 KB Output is correct
74 Correct 1 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 384 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 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 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 1 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