Submission #848264

#	Time	Username	Problem	Language	Result	Execution time	Memory
848264		Plurm	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2029 ms	3880 KiB

beechtree

#include "beechtree.h"

std::vector<int> beechtree(int N, int M, std::vector<int> P,
                           std::vector<int> C) {
  std::vector<int> ret;
  for (int i = 0; i < N; i++) {
    bool ok = true;
    for (int j = i + 1; j < N; j++) {
      if (C[j] != C[i + 1])
        ok = false;
    }
    if (ok)
      ret.push_back(1);
    else
      ret.push_back(0);
  }
  return ret;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12