oj.uz

답안 #304126

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

using namespace std;

const int VAL = 144;

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 < 2; ++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());

  int ans = 0, pos = 0;

  bool doNextSimple = false;

  double COEF = 1.2;

  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 (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()) 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]);
        nextPos(v, pos);
        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
78.7456 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Partially correct 15 ms 604 KB Output is partially correct
8 Partially correct 19 ms 512 KB Output is partially correct
9 Partially correct 15 ms 604 KB Output is partially correct
10 Partially correct 15 ms 608 KB Output is partially correct
11 Partially correct 14 ms 604 KB Output is partially correct
12 Partially correct 15 ms 604 KB Output is partially correct
13 Partially correct 21 ms 512 KB Output is partially correct
14 Correct 10 ms 384 KB Output is correct
15 Partially correct 16 ms 604 KB Output is partially correct
16 Partially correct 15 ms 600 KB Output is partially correct
17 Correct 8 ms 384 KB Output is correct
18 Partially correct 15 ms 604 KB Output is partially correct
19 Partially correct 16 ms 604 KB Output is partially correct
20 Partially correct 15 ms 640 KB Output is partially correct
21 Partially correct 15 ms 608 KB Output is partially correct
22 Partially correct 16 ms 608 KB Output is partially correct
23 Partially correct 15 ms 604 KB Output is partially correct
24 Correct 8 ms 484 KB Output is correct
25 Partially correct 15 ms 604 KB Output is partially correct
26 Partially correct 16 ms 604 KB Output is partially correct
27 Partially correct 15 ms 608 KB Output is partially correct
28 Partially correct 14 ms 604 KB Output is partially correct
29 Partially correct 15 ms 604 KB Output is partially correct
30 Partially correct 16 ms 604 KB Output is partially correct
31 Partially correct 17 ms 608 KB Output is partially correct
32 Partially correct 16 ms 608 KB Output is partially correct
33 Partially correct 15 ms 604 KB Output is partially correct
34 Partially correct 16 ms 604 KB Output is partially correct
35 Partially correct 14 ms 604 KB Output is partially correct
36 Partially correct 16 ms 604 KB Output is partially correct
37 Partially correct 16 ms 604 KB Output is partially correct
38 Partially correct 16 ms 604 KB Output is partially correct
39 Partially correct 16 ms 756 KB Output is partially correct
40 Partially correct 15 ms 604 KB Output is partially correct
41 Partially correct 15 ms 604 KB Output is partially correct
42 Partially correct 17 ms 512 KB Output is partially correct
43 Partially correct 16 ms 608 KB Output is partially correct
44 Partially correct 20 ms 512 KB Output is partially correct
45 Partially correct 16 ms 604 KB Output is partially correct
46 Partially correct 15 ms 604 KB Output is partially correct
47 Partially correct 16 ms 608 KB Output is partially correct
48 Partially correct 15 ms 604 KB Output is partially correct
49 Partially correct 15 ms 604 KB Output is partially correct
50 Partially correct 15 ms 604 KB Output is partially correct
51 Partially correct 15 ms 640 KB Output is partially correct
52 Partially correct 16 ms 604 KB Output is partially correct
53 Partially correct 15 ms 608 KB Output is partially correct
54 Partially correct 15 ms 640 KB Output is partially correct
55 Partially correct 14 ms 604 KB Output is partially correct
56 Partially correct 18 ms 604 KB Output is partially correct
57 Partially correct 16 ms 616 KB Output is partially correct
58 Partially correct 15 ms 604 KB Output is partially correct
59 Partially correct 16 ms 608 KB Output is partially correct
60 Partially correct 15 ms 604 KB Output is partially correct
61 Partially correct 17 ms 732 KB Output is partially correct
62 Correct 1 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 1 ms 384 KB Output is correct
66 Correct 0 ms 256 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 1 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 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 0 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 1 ms 256 KB Output is correct
81 Correct 1 ms 256 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 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 1 ms 256 KB Output is correct
89 Correct 1 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct