Submission #1247497

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247497		nvujica	Beech Tree (IOI23_beechtree)	C++20	5 / 100	40 ms	4544 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c){
    bool ok = 1;
    int b = -1;

    vector <int> ans;

    for(int i = n - 1; i >= 0; i--){
        ans.push_back(ok);
        
        if(b == -1){
            b = c[i];
        }
        else if(c[i] != b) ok = 0;
    }

    reverse(ans.begin(), ans.end());

    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