Submission #1363924

#	Time	Username	Problem	Language	Result	Execution time	Memory
1363924		avighna	Beech Tree (IOI23_beechtree)	C++20	0 / 100	0 ms	344 KiB

beechtree

#include <bits/stdc++.h>

using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
  vector<int> res;
  set<int> st;
  for (int i = N - 1; i >= 0; --i) {
    st.insert(C[i]);
    res.push_back(st.size() == 1);
  }
  reverse(res.begin(), res.end());
  return res;
}

• 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