제출 #1241558

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241558		noyancanturk	Beech Tree (IOI23_beechtree)	C++17	0 / 100	3 ms	4936 KiB

beechtree

#include "beechtree.h"

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

#define pb push_back

const int lim=2e5+100;

int n,m;

vector<int>p,c,v[lim];

int state[lim],have[lim][2];


vector<int>beechtree(int N,int M,vector<int>P,vector<int>C){
  n=N,m=M;
  p=P,c=C;
  vector<int>ans(n,1);
  set<int>guys[n];
  for(int i=1;i<n;i++){
    guys[p[i]].insert(c[i]);
  }
  sort(guys,guys+n,[&](set<int>&x,set<int>&y)->bool {
    if(x.size()!=y.size())return x.size()>y.size();
    return x<y;
  });
  for(int i=1;i<n;i++){
    for(int j:guys[i]){
      ans[0]&=guys[i-1].count(j);
    }
  }
  return ans;
}

// std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
// {
//     return {};
// }

• 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