Submission #1241333

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241333		mychecksedad	Beech Tree (IOI23_beechtree)	C++17	0 / 100	0 ms	324 KiB

beechtree

#include "beechtree.h"
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second

std::vector<int> beechtree(int n, int m, std::vector<int> P, std::vector<int> C)
{
  vi res(n);
  res[n - 1] = 1;
  for(int i = n-2; i >= 0; --i){
    if(res[i + 1] == 0){
      res[i] = 0;
      continue;
    }
    if(C[i] == C[i + 1]){
      res[i] = 1;
    }else{
      res[i] = 0;
    }
  }

  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