Submission #980916

#	Time	Username	Problem	Language	Result	Execution time	Memory
980916		FZ_Melo	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

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

int buc[200000];

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C){
    int n=N, m=M;
    vector<int> ans(n);
    for(int i=n-1; i>=0; i--){
        for(int j=1; i<=m; j++){
            if(buc[j]==n-i-1){
                ans[i]=1;
                break;
            }
        }
        buc[C[i]]++;
    }
    return ans;
}

• 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