Submission #1241556

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241556		SalihSahin	Beech Tree (IOI23_beechtree)	C++20	5 / 100	73 ms	5036 KiB

beechtree

#include "bits/stdc++.h"
#include "beechtree.h"
#define pb push_back
using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C){
   vector<int> cnt(M+1);
   int val = 0;
   for(int i = 1; i < N; i++){
      cnt[C[i]]++;
      if(cnt[C[i]] == 1) val++;
   }

   vector<int> ans(N, 1);
   for(int i = 0; i < N; i++){
      if(val > 1) ans[i] = 0;
      if(i != N-1){
         cnt[C[i+1]]--;
         if(cnt[C[i+1]] == 0) val--;
      }
   }
   return ans;
}

• 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