This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "beechtree.h"
#include<bits/stdc++.h>
using namespace std;
#define vec vector
std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
vec<set<int>> cs(N);
vec<int> ans(N, 1);
bool ok = true;
for(int i = 1; i<N; i++) {
if(cs[P[i]].count(C[i])) {
ok = false;
ans[P[i]] = 0;
}
cs[P[i]].insert(C[i]);
}
ans[0] = ok;
if(!ok) return ans;
sort(cs.begin()+1, cs.end(), [&](auto& s1, auto& s2) { return s1.size()>s2.size(); });
for(int i = 1; i<N; i++) {
for(int val : cs[i]) {
if(!cs[i-1].count(val)) {
ans[0] = false;
return ans;
}
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |