Submission #848266

#	Time	Username	Problem	Language	Result	Execution time	Memory
848266		Plurm	Beech Tree (IOI23_beechtree)	C++17	5 / 100	53 ms	4792 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
  vector<int> ret;
  bool ok = true;
  ret.push_back(1);
  ret.push_back(1);
  for (int i = N - 3; i >= 0; i--) {
    if (C[i + 1] != C[i + 2])
      ok = false;
    if (ok)
      ret.push_back(1);
    else
      ret.push_back(0);
  }
  reverse(ret.begin(), ret.end());
  return ret;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 5 / 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