← Back to Dashboard

DB Mode (No Cache)

0634-arvore-largura

arvore-largura

C Difficulty

Actions

Workflow do Problema

Local Workspace

Pasta criada no disco
Metadados

Informações básicas preenchidas
Validação

Soluções passam nos testes
4

Sincronização

Enviado para DB e GitLab

Components

Statements ✅
Solutions 2 ✅
Test Cases 12 ✅

Database Info

DB ID 634

Name Arvore Largura

Time Limit 1.0s

Mem Limit 195 MB

Test Cases 12

🚀 Quick Prompts

Structure Scaffolding

Generate metadata & folder structure

ID: 1.1

Context & Description

Draft description & editorial

ID: 1.2

Statements List

ID	Level	Natural Languages	Skills	Status	Action
a-arvore-largura	A	a b c d	wok	✅

Statement Details

Select a statement above to view details.

Actions

Statistics

1 Total Statements

By Type (ID)

a-arvore-largura 1

By Level

Level A 1

🚀 Quick Prompts

Statement Analysis

Analyze ambiguity & clarity

ID: 2.1

WOK Statement Generation

Rewrite in WOK Universe theme

ID: 2.2

Statement Expansion

Expand to 4 difficulty levels

ID: 2.3

Database Test Cases 12 cases

ID	Rank	Status	Scenario	Filename	MD5	Description	Image	Disk Sync
12556	10	Sample	`d-sample` TDD	`sample-01`	I `d3d9446802a44259755d38e6d163e820`	-	📷	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
12556	10	Sample	`d-sample` TDD	-	O `539cb7cf6708dbc7619cbec96d14b790`	-	📷	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
12557	20	Sample	`d-sample` TDD	`sample-02`	I `77ce164e170b2c847b47a208f21bde67`	-	📷	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
12557	20	Sample	`d-sample` TDD	-	O `a080d7a579473aee20829e16c70ece65`	-	📷	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
12558	30	Sample	`d-sample` TDD	`sample-03`	I `f29cc3b9088827fdab1d86ad0ec0c629`	-	📷	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
12558	30	Sample	`d-sample` TDD	-	O `59a307c7aea17be24f472e8362f747fe`	-	📷	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
14717	40		`c-logic-fragmented` TDD	`logic-fragmented-01`	I `ffb5f3ffe23e6a5cf656b0793686c69d`	-	-	✅ Linked
14717	40		`c-logic-fragmented` TDD	-	O `dadbe5c4d2586c442226d17078554898`	-	-	✅ Linked
14718	50		`c-logic-fragmented` TDD	`logic-fragmented-02`	I `46dbef1d294b44aaab0151df2835a385`	-	-	✅ Linked
14718	50		`c-logic-fragmented` TDD	-	O `bb66f3cab51e5a2cdd3db7dd95e0048f`	-	-	✅ Linked
14719	60		`c-logic-fragmented` TDD	`logic-fragmented-03`	I `28c7eaf4ed7f74cdc6af564ac84f572a`	-	-	✅ Linked
14719	60		`c-logic-fragmented` TDD	-	O `4217482628519b4c5f96757513dbf54a`	-	-	✅ Linked
14720	70		`b-edge-deep-skewed` TDD	`edge-deep-skewed-01`	I `2bb50031a36a085e145c3ddd31fa8b23`	-	-	✅ Linked
14720	70		`b-edge-deep-skewed` TDD	-	O `f1a88eb7cf266dc623205e4e4f144323`	-	-	✅ Linked
14721	80		`b-edge-deep-skewed` TDD	`edge-deep-skewed-02`	I `f4067c95c4ef2742ce2750aa980ddaf0`	-	-	✅ Linked
14721	80		`b-edge-deep-skewed` TDD	-	O `5547066ab52df7001967ce47752b57ea`	-	-	✅ Linked
14722	90		`b-edge-deep-skewed` TDD	`edge-deep-skewed-03`	I `22b6f5d3de4e639cfcd99c5dccf15207`	-	-	✅ Linked
14722	90		`b-edge-deep-skewed` TDD	-	O `7a1fa3a3fcdc15cc751d4fd2955e0511`	-	-	✅ Linked
14723	100		`a-performance-load` TDD	`performance-load-01`	I `bc8bd3c6321b6c8546e7fc0129fa70bb`	-	-	✅ Linked
14723	100		`a-performance-load` TDD	-	O `cd172ea362745ad7e22289b9d0a79c3f`	-	-	✅ Linked
14724	110		`a-performance-load` TDD	`performance-load-02`	I `77a461d8472b72417743d4ce04c510b6`	-	-	✅ Linked
14724	110		`a-performance-load` TDD	-	O `73e2c4e227768fa49acb70607404f8df`	-	-	✅ Linked
14725	120		`a-performance-load` TDD	`performance-load-03`	I `0703db1be07d8cce03b24396dff7a921`	-	-	✅ Linked
14725	120		`a-performance-load` TDD	-	O `743d12d0cce05f525034d72126715e0b`	-	-	✅ Linked

📊 Sync Statistics

Total (Disk) 12

Total (Database) 12

✓ Synchronized 9

⚠ Desynchronized 3

Duplicates (MD5)

Duplicates in (MD5) 0

Desync = (DB missing on Disk) + (Disk missing on DB)

Actions

Testcase Scenarios Sync

YAML Source vs Database

Slug	Level	Name	Type	Skills	Status	Actions
`a-performance-load`	A	Carga Máxima (O(N)) Árvore completa com 10.000 nós e IDs...	TDD	hashing 1pts complexity-analysis 1pts busca-largura 1pts	Synced
`b-edge-deep-skewed`	B	Árvore Degenerada Profunda Uma árvore com 10.000 nós em linha reta...	TDD	queues 1pts	Synced
`c-logic-fragmented`	C	Lógica de Reconstrução Fragmentada Testa a montagem de nós em ordem não...	TDD	logica 1pts binary-tree-traversals 1pts	Synced
`d-sample`	D	Exemplos do Enunciado Verifica a correção básica utilizando os...	TDD	binary-tree-traversals 1pts io-formatacao-parsing 1pts	Partial	Details

Local Test Cases (Disk)

Scenario: a-performance-load 3 cases

Name	Files (Input / Output)	Status	Actions
performance-load-01 #14723 📄 📷	Input `performance-load-01.in` bc8bd3c6321b6c8546e7fc0129fa70bb Output `performance-load-01.out` cd172ea362745ad7e22289b9d0a79c3f	✅ Synced (ID: 14723) ✅ Scenario: a-performance-load	🔍 Details
performance-load-02 #14724 📄 📷	Input `performance-load-02.in` 77a461d8472b72417743d4ce04c510b6 Output `performance-load-02.out` 73e2c4e227768fa49acb70607404f8df	✅ Synced (ID: 14724) ✅ Scenario: a-performance-load	🔍 Details
performance-load-03 #14725 📄 📷	Input `performance-load-03.in` 0703db1be07d8cce03b24396dff7a921 Output `performance-load-03.out` 743d12d0cce05f525034d72126715e0b	✅ Synced (ID: 14725) ✅ Scenario: a-performance-load	🔍 Details

Scenario: b-edge-deep-skewed 3 cases

Name	Files (Input / Output)	Status	Actions
edge-deep-skewed-01 #14720 📄 📷	Input `edge-deep-skewed-01.in` 2bb50031a36a085e145c3ddd31fa8b23 Output `edge-deep-skewed-01.out` f1a88eb7cf266dc623205e4e4f144323	✅ Synced (ID: 14720) ✅ Scenario: b-edge-deep-skewed	🔍 Details
edge-deep-skewed-02 #14721 📄 📷	Input `edge-deep-skewed-02.in` f4067c95c4ef2742ce2750aa980ddaf0 Output `edge-deep-skewed-02.out` 5547066ab52df7001967ce47752b57ea	✅ Synced (ID: 14721) ✅ Scenario: b-edge-deep-skewed	🔍 Details
edge-deep-skewed-03 #14722 📄 📷	Input `edge-deep-skewed-03.in` 22b6f5d3de4e639cfcd99c5dccf15207 Output `edge-deep-skewed-03.out` 7a1fa3a3fcdc15cc751d4fd2955e0511	✅ Synced (ID: 14722) ✅ Scenario: b-edge-deep-skewed	🔍 Details

Scenario: c-logic-fragmented 3 cases

Name	Files (Input / Output)	Status	Actions
logic-fragmented-01 #14717 📄 📷	Input `logic-fragmented-01.in` ffb5f3ffe23e6a5cf656b0793686c69d Output `logic-fragmented-01.out` dadbe5c4d2586c442226d17078554898	✅ Synced (ID: 14717) ✅ Scenario: c-logic-fragmented	🔍 Details
logic-fragmented-02 #14718 📄 📷	Input `logic-fragmented-02.in` 46dbef1d294b44aaab0151df2835a385 Output `logic-fragmented-02.out` bb66f3cab51e5a2cdd3db7dd95e0048f	✅ Synced (ID: 14718) ✅ Scenario: c-logic-fragmented	🔍 Details
logic-fragmented-03 #14719 📄 📷	Input `logic-fragmented-03.in` 28c7eaf4ed7f74cdc6af564ac84f572a Output `logic-fragmented-03.out` 4217482628519b4c5f96757513dbf54a	✅ Synced (ID: 14719) ✅ Scenario: c-logic-fragmented	🔍 Details

Scenario: d-sample 3 cases

Name	Files (Input / Output)	Status	Actions
sample-01 #12556 📄 📷 sample-01.png	Input `sample-01.in` d3d9446802a44259755d38e6d163e820 Output `sample-01.out` 5289b57579baa0c33dc5165ad8c6f97f	⚠️ Output Diff (ID: 12556)	🔍 Details
sample-02 #12557 📄 📷 sample-02.png	Input `sample-02.in` 77ce164e170b2c847b47a208f21bde67 Output `sample-02.out` 85a2b9aebedbb1c3a221c037bbd9ec42	⚠️ Output Diff (ID: 12557)	🔍 Details
sample-03 #12558 📄 📷 sample-03.png	Input `sample-03.in` f29cc3b9088827fdab1d86ad0ec0c629 Output `sample-03.out` 7c167ff1019c240909620b874001c30b	⚠️ Output Diff (ID: 12558)	🔍 Details

📊 Sync Statistics

Total (Disk) 12

Total (Database) 12

✓ Synchronized 9

⚠ Desynchronized 3

Duplicates (MD5)

Duplicates in (MD5) 0

Desync = (DB missing on Disk) + (Disk missing on DB)

Actions

Busca em Largura (BFS) O(N)

ID: a-optimal

Solução eficiente que utiliza um Mapa para construção linear da árvore e uma Fila para o percurso em largura.

Implementations

Busca Linear de Pai O(N²)

ID: b-brute-force

Abordagem sub-ótima que percorre a árvore a partir da raiz para localizar o pai de cada novo nó, resultando em desempenho quadrático.

Implementations

py Imperative

✅ brute.py

Solutions Check Report

## Solutions Check Report (Detalhado / Debug)
**Generated**: 2026-04-01T07:22:02.228607
**Solution**: `solutions/a-optimal/Solution.java`

### Compilation
✅ Compilation successful

### Resultados

<table class="results-table"><thead><tr><th>Test Case</th><th>Result</th><th>Time (s)</th></tr></thead><tbody>
<tr class="scenario-row"><td colspan="3"><strong>a-performance-load - TDD</strong></td></tr>
<tr id="row-a-performance-load-performance-load-01-in"><td>performance-load-01.in</td><td>✅ PASS</td><td>0.095</td></tr>
<tr id="row-a-performance-load-performance-load-02-in"><td>performance-load-02.in</td><td>✅ PASS</td><td>0.090</td></tr>
<tr id="row-a-performance-load-performance-load-03-in"><td>performance-load-03.in</td><td>✅ PASS</td><td>0.092</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-edge-deep-skewed - TDD</strong></td></tr>
<tr id="row-b-edge-deep-skewed-edge-deep-skewed-01-in"><td>edge-deep-skewed-01.in</td><td>✅ PASS</td><td>0.094</td></tr>
<tr id="row-b-edge-deep-skewed-edge-deep-skewed-02-in"><td>edge-deep-skewed-02.in</td><td>✅ PASS</td><td>0.103</td></tr>
<tr id="row-b-edge-deep-skewed-edge-deep-skewed-03-in"><td>edge-deep-skewed-03.in</td><td>✅ PASS</td><td>0.091</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-logic-fragmented - TDD</strong></td></tr>
<tr id="row-c-logic-fragmented-logic-fragmented-01-in"><td>logic-fragmented-01.in</td><td>✅ PASS</td><td>0.028</td></tr>
<tr id="row-c-logic-fragmented-logic-fragmented-02-in"><td>logic-fragmented-02.in</td><td>✅ PASS</td><td>0.031</td></tr>
<tr id="row-c-logic-fragmented-logic-fragmented-03-in"><td>logic-fragmented-03.in</td><td>✅ PASS</td><td>0.028</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>d-sample - TDD</strong></td></tr>
<tr id="row-d-sample-sample-01-in"><td>sample-01.in</td><td>✅ PASS</td><td>0.029</td></tr>
<tr id="row-d-sample-sample-02-in"><td>sample-02.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-d-sample-sample-03-in"><td>sample-03.in</td><td>✅ PASS</td><td>0.039</td></tr>
</tbody></table>

✅ Verification

Validate your solutions against test cases using the metadata rules.

🚀 Quick Prompts

Solution Generation

Create Optimal/Sub-optimal code

ID: 3.1

📄 Enunciados

A 1

Idiomas: pt

💡 Soluções

java: 1 py: 2 cpp: 1

✅ 0 ❌ 0

🧪 Casos de Teste

4 Scen.

Total no Disco 12

Total no Banco 12

Sincronização 75.0%

Metadata (form)

Version

Name

Slug

ID Beecrowd

Difficulty

Time Complexity

Space Complexity

Time Limit (s)

Memory Limit (MB)

Origin

Author (Problem)

Author (Editorial)

Default Statement

Topics

Skills

Description

Editorial

Success message

metadata.yaml

# yaml-language-server: $schema=https://api.mundodocodigo.com.br/api/public/json/wok-problem.json --- version: '1.0' id: 634 name: Árvore em Largura slug: arvore-largura timelimit: 1.0 memlimit: 195 difficultyLevelId: C author: Unknown testScenarios: - id: a-performance-load name: Carga Máxima (O(N)) description: Árvore completa com 10.000 nós e IDs aleatórios até 1.000.000. Força o uso de Tabelas de Espalhamento (Hashing) para acesso eficiente. helpTip: Utilize uma estrutura que associe o ID ao Nó em tempo O(1), como um Mapa ou Dicionário, para evitar buscas lineares repetitivas ao montar a árvore. level: A testType: TDD skills: - skill: hashing points: 1 - skill: complexity-analysis points: 1 - skill: busca-largura points: 1 - id: b-edge-deep-skewed name: Árvore Degenerada Profunda description: Uma árvore com 10.000 nós em linha reta (altura 10.000). Verifica se a implementação lida com profundidade extrema sem estourar limites de memória ou recursão. helpTip: Considere usar abordagens iterativas ou aumentar o limite de recursão se necessário. A travessia em largura deve ser estável com o uso de uma fila. level: B testType: TDD skills: - skill: queues points: 1 - id: c-logic-fragmented name: Lógica de Reconstrução Fragmentada description: Testa a montagem de nós em ordem não sequencial e com filhos únicos espalhados por várias linhas de parentesco. helpTip: Garanta que seu programa aceita linhas com 1, 2 ou 3 inteiros corretamente, respeitando a regra do filho da esquerda sendo prioridade quando há apenas dois valores. level: C testType: TDD skills: - skill: logica points: 1 - skill: binary-tree-traversals points: 1 - id: d-sample name: Exemplos do Enunciado description: Verifica a correção básica utilizando os exemplos fornecidos no problema. helpTip: 'Siga exatamente o formato de saída: os elementos da travessia seguidos pelo valor inteiro da altura da árvore.' level: D testType: TDD skills: - skill: binary-tree-traversals points: 1 - skill: io-formatacao-parsing points: 1 solutions: - id: a-optimal name: Busca em Largura (BFS) O(N) description: Solução eficiente que utiliza um Mapa para construção linear da árvore e uma Fila para o percurso em largura. level: A implementations: - language: java filenames: - Solution.java paradigm: Imperative main: Solution - language: py filenames: - solution.py paradigm: Imperative - language: cpp filenames: - solution.cpp paradigm: Imperative - id: b-brute-force name: Busca Linear de Pai O(N²) description: Abordagem sub-ótima que percorre a árvore a partir da raiz para localizar o pai de cada novo nó, resultando em desempenho quadrático. level: B implementations: - language: py filenames: - brute.py paradigm: Imperative origin: wok description: Construa uma árvore binária a partir de relações de parentesco e execute uma travessia em largura (level-order) para exibir todos os nós nível a nível. O desafio também exige o cálculo preciso da altura total da estrutura arbórea resultante. editorial: 'A estratégia eficiente para este problema envolve o uso de um Mapa (ou Dicionário) para indexar os IDs dos nós, permitindo acesso O(1) durante a construção arbitrária. Para a travessia em largura, implemente o algoritmo Breadth-First Search (BFS) utilizando uma Fila (Queue): comece inserindo a raiz e, em cada iteração, retire um nó, visite-o e enfileire seus filhos (esquerdo e direito). A altura pode ser rastreada durante a BFS controlando os níveis da fila ou via uma função recursiva simples.' successmsg: Parabéns! Você demonstrou maestria no uso de filas e na exploração de níveis em estruturas arbóreas! timeComplexity: O(N) skills: - io - arvores - busca-largura - fila - logica statements: - id: a-arvore-largura testScenarioLevel: A thematicSkills: - skill: wok points: 1 memoryLimitMb: 256 timeLimitSegs: 1.0 authorSlugProblem: alessio topics: - arvores-binarias authorSlugEditorial: alessio defaultStatement: a_pt_arvore-largura

Git Status

On branch master
Your branch is up to date with 'origin/master'.

nothing to commit, working tree clean

Warning: Automated commits should be used with caution. Review the status above before proceeding.

Git Workflow

Problem Analysis Report

Loading analysis...

✅ Synced with API

Remote API: ID 634 | Slug: arvore-largura | Updated: 01/11/19

📝 Edit Platform Exercise

✅ Synced with Database

Maratona DB: ID 634 | Slug: arvore-largura

0634-arvore-largura

Actions

Workflow do Problema

Local Workspace

Metadados

Validação

Sincronização

Components

Database Info

🚀 Quick Prompts

Statements List

Statement Details

Actions

Statistics

By Type (ID)

By Level

🚀 Quick Prompts

Database Test Cases 12 cases

📊 Sync Statistics

Actions

Test Case Details

Testcase Scenarios Sync

Local Test Cases (Disk)

Scenario: a-performance-load 3 cases

Scenario: b-edge-deep-skewed 3 cases

Scenario: c-logic-fragmented 3 cases

Scenario: d-sample 3 cases

📊 Sync Statistics

Actions

Busca em Largura (BFS) O(N)

Implementations

Busca Linear de Pai O(N²)

Implementations

Solutions Check Report

✅ Verification

🚀 Quick Prompts

📄 Enunciados

💡 Soluções

🧪 Casos de Teste

Metadata (form)

Git Status

Git Workflow

Problem Analysis Report

✅ Synced with API

✅ Synced with Database

Actions

📋 Processo de Criação

Select a Prompt

📤 API Synchronization

📄 Recreating README.md...

💻 Git Action Output

Running Verification...

Ajuda

🚀 Processing Sync Action

🚀 Batch Auto-Link Process

⬇️ Repo Sync Output

📝 Update Manifest Output

Ajuda