CacheDB: 2026-04-27 21:16:46

0750-soma-das-casa

soma-das-casa

C Difficulty

README.md Preview

# 0750 - Soma das Casas | **Version**: 1.0
`soma-das-casa` | Difficulty: **C** | **Updated**: 2026-04-15 23:22:55

**Sync Status:** ✅ Local: OK | ✅ Maratona: OK | ✅ API: OK (21/03/26 01:30)

## Overview
Busca de combinação linear alvo (K) em Array uni-dimensional monotonicamente ordenado. O algoritmo processa vetores densos identificando o par exato em O(N) ao contrair margens analíticas, evadindo combinações combinatórias quadráticas O(N^2).

## Metadata
- **Author**: Unknown
- **Editorial**: Como os números das casas são fornecidos em ordem estritamente crescente, a solução ideal utiliza a técnica de **dois ponteiros**. Inicializamos um ponteiro no início do vetor e outro no fim. Se a soma dos valores apontados for maior que K, movemos o ponteiro da direita para a esquerda; se for menor, movemos o da esquerda para a direita. Repetimos o processo até encontrar o par exato, o que garante complexidade linear.
- **Success Msg**: Processamento O(N) restrito validado! A manipulação posicional indexou limites paralelos perfeitamente, provando robustez heurística e evadindo varredura por força bruta.

| Time Limit | Memory Limit | Time Complexity | Space Complexity |
| :--- | :--- | :--- | :--- |
| 2.0s | 256MB | O(N) | - |

## Stats
| Metric | Count |
| :--- | :--- |
| Test Scenarios | 27 |
| Solutions | 2 |

## Statements
| ID | Status | Level | Natural Languages | Skills |
| :--- | :--- | :--- | :--- | :--- |
| `a-soma-das-casa` | ✅ | A | pt | daily-life |

## Test Scenarios
| Name | Description | Count | Type | Level | Skills | DB Sync |
| :--- | :--- | :--- | :--- | :--- | :--- | :--- |
| **Carga de Desempenho (N=10^5)** | Cenário com o limite máximo de casas para validar a eficiência O(N) da abordagem de dois ponteiros. | 5 | TDD | A | two-pointers-array, complexity-analysis | ✅ 5/5 |
| **Estresse no Meio do Array** | Um teste com muitos elementos onde o par de solução está localizado próximo ao centro do vetor. | 9 | TDD | B | two-pointers-array, arrays | ✅ 9/9 |
| **Valores Grandes (Próximos a 10^9)** | Teste com números de casas e soma alvo próximos ao limite superior de um inteiro de 32 bits. | 1 | TDD | B | two-pointers-array, complexity-analysis | ✅ 1/1 |
| **Casos de Borda (N=2)** | Situação com o menor número possível de casas. | 1 | TDD | C | arrays | ✅ 1/1 |
| **Exemplos do Enunciado** | Os casos de teste fornecidos no exemplo oficial do problema. | 11 | TDD | D | io | ✅ 11/11 |

## Solutions
- **Solução Ótima (Dois Ponteiros)** (`a-optimal`)
  - Languages: `cpp, java, py`
- **Força Bruta (O(N^2))** (`b-brute-force`)
  - Languages: `py`

## Components
- ✅ Statements
- ✅ Solutions
- ✅ Test Cases

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 27 ✅

Database Info

DB ID 750

Name Soma das Casas

Time Limit 2.0s

Mem Limit 256 MB

Version 0.8

Difficulty Level O

Test Cases 27

🚀 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-soma-das-casa	A	a b c d	daily-life	✅

Statement Details

Select a statement above to view details.

Actions

Statistics

1 Total Statements

By Type (ID)

a-soma-das-casa 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 27 cases

ID	Rank	Status	Scenario	Filename	MD5	Description	Image	Disk Sync
13515	10	Sample	`d-sample` TDD	-	I `44dd48fefe1f9444a9b81a7d1071878d`	29763	-	✅ Linked
13515	10	Sample	`d-sample` TDD	-	O `4c2aa1902f1bc59ea7fe25ce74deb973`	29763	-	✅ Linked
13516	20	Sample	`d-sample` TDD	-	I `3d8f6ef23a65720457db63ec1ba9a6e5`	24506	-	✅ Linked
13516	20	Sample	`d-sample` TDD	-	O `c08b315d57a859b19d1b73d8c3b76db7`	24506	-	✅ Linked
13517	30	Sample	`d-sample` TDD	-	I `2a5e3713d432bf0523cad11c536f692d`	51471	-	✅ Linked
13517	30	Sample	`d-sample` TDD	-	O `9c0544a0675f5670abf283cbfea3fe94`	51471	-	✅ Linked
13518	40	Sample	`d-sample` TDD	-	I `b3119e5f9576fcba4cb5f1636c171093`	41223	-	✅ Linked
13518	40	Sample	`d-sample` TDD	-	O `3cab6997bb0f5a408b06e9f2c7d3b46c`	41223	-	✅ Linked
13519	50		`d-sample` TDD	-	I `2bdb37881d18e1eab47cc41f3a4c8d88`	49989	-	✅ Linked
13519	50		`d-sample` TDD	-	O `524ed54929dfceb55a57118a2bbbc605`	49989	-	✅ Linked
13520	60		`d-sample` TDD	-	I `b09aba963ecf3dc4c95aa5e39f493df6`	38793	-	✅ Linked
13520	60		`d-sample` TDD	-	O `126980a4cf8fd14c26062678701fb7dd`	38793	-	✅ Linked
13521	70		`d-sample` TDD	-	I `9a1cf69a95e04e85b18f283f4195e33f`	17170	-	✅ Linked
13521	70		`d-sample` TDD	-	O `263d05ed54ff26ac44654e4e0c4ce411`	17170	-	✅ Linked
13522	80		`d-sample` TDD	-	I `06c3837735163d4402fc1887512d4b50`	67096	-	✅ Linked
13522	80		`d-sample` TDD	-	O `b75ce1fbb5a5c065d66f3297a43ca4b1`	67096	-	✅ Linked
13523	90		`d-sample` TDD	-	I `c531fe3ffdbb10a4dea9dc27e190608c`	40282	-	✅ Linked
13523	90		`d-sample` TDD	-	O `b24f3040fa67ab8d79899a26592d2881`	40282	-	✅ Linked
13524	100		`d-sample` TDD	-	I `59b4c71ace9c4a85c8c7b5784fae1788`	71498	-	✅ Linked
13524	100		`d-sample` TDD	-	O `353f8e75c9e13b157b709d65819c2b7e`	71498	-	✅ Linked
13525	110		`d-sample` TDD	-	I `a6f610c18d08f3e52dfe90d4778ead65`	5918	-	✅ Linked
13525	110		`d-sample` TDD	-	O `07a6dc32dd462ec6c7fe589530621276`	5918	-	✅ Linked
14800	120		`c-boundary-extremes` TDD	`boundary-extremes-01`	I `bf76493b397d3067ccbb84127aa490c7`	-	-	✅ Linked
14800	120		`c-boundary-extremes` TDD	-	O `f9754da8d79befbae6aa154180a6f3af`	-	-	✅ Linked
13526	130		`b-stress-middle` TDD	-	I `300b21626249771e8f2481b6841bd650`	8957	-	✅ Linked
13526	130		`b-stress-middle` TDD	-	O `a52adc8433536be39ca6a4584543fe4f`	8957	-	✅ Linked
13527	140		`b-stress-middle` TDD	-	I `92ea570f12a3c08d87c2bb70410c3df6`	26920	-	✅ Linked
13527	140		`b-stress-middle` TDD	-	O `c6c442a62025e35fff3447d763535267`	26920	-	✅ Linked
13529	150		`b-stress-middle` TDD	-	I `ddb64fcb09bbb88c24378c5245c9ec02`	24280	-	✅ Linked
13529	150		`b-stress-middle` TDD	-	O `6820780978cb754f3dbc5ee3cfd8d776`	24280	-	✅ Linked
13530	160		`b-stress-middle` TDD	-	I `65d4753cd4bcb6b8adfdcd5f509c7316`	3475	-	✅ Linked
13530	160		`b-stress-middle` TDD	-	O `e2feaf844e156cd201bbc37526806168`	3475	-	✅ Linked
13532	170		`b-stress-middle` TDD	-	I `f69bd3ec05693b92724932e57209b95a`	41336	-	✅ Linked
13532	170		`b-stress-middle` TDD	-	O `e666b8cefedac7c2fbd8cb0933b34bf8`	41336	-	✅ Linked
13533	180		`b-stress-middle` TDD	-	I `2ef4de6311a1085f270580003580c706`	87827	-	✅ Linked
13533	180		`b-stress-middle` TDD	-	O `472e4749b88fc5b5fcc65d2ce89a0158`	87827	-	✅ Linked
13535	190		`b-stress-middle` TDD	-	I `b52e97c0c84a3923a594b928c69c4a1f`	86602	-	✅ Linked
13535	190		`b-stress-middle` TDD	-	O `d1fc4a030e917e16f361a1261a51aa19`	86602	-	✅ Linked
13537	200		`b-stress-middle` TDD	-	I `c981e02302843a67d1829d88967dd859`	440	-	✅ Linked
13537	200		`b-stress-middle` TDD	-	O `b7e257a4bd0bd610f4f83daa241a51f4`	440	-	✅ Linked
13539	210		`b-stress-middle` TDD	-	I `b98adace3ef296212a6aff44f8a49182`	66316	-	✅ Linked
13539	210		`b-stress-middle` TDD	-	O `94862c85b5ff890de2096360f409fbd4`	66316	-	✅ Linked
13538	220		`b-large-values` TDD	-	I `e5e28402307c62be98666657c3da1fde`	51067	-	✅ Linked
13538	220		`b-large-values` TDD	-	O `72086849f70f9bb5dfe30c77d5c52e48`	51067	-	✅ Linked
13528	230		`a-performance-load` TDD	-	I `290c0fded371db189d418822ef9e018b`	70872	-	✅ Linked
13528	230		`a-performance-load` TDD	-	O `c175b4d6cc2cf6123d35307e638b1ee1`	70872	-	✅ Linked
13531	240		`a-performance-load` TDD	-	I `0c5816c9e1c2ecbcdff1e088d41f2ae1`	27506	-	✅ Linked
13531	240		`a-performance-load` TDD	-	O `5ca43c75c0955921d3951af304f604df`	27506	-	✅ Linked
13534	250		`a-performance-load` TDD	-	I `9ebb9ff42a4b80a0fb1cbb7256914c3a`	36686	-	✅ Linked
13534	250		`a-performance-load` TDD	-	O `d98541798ec9caf15d9663c43cccc6e2`	36686	-	✅ Linked
13536	260		`a-performance-load` TDD	-	I `9ed623767c3bcfb444c3950c0f42fcff`	55256	-	✅ Linked
13536	260		`a-performance-load` TDD	-	O `7323cb347d5083967116594903554afb`	55256	-	✅ Linked
13540	270		`a-performance-load` TDD	-	I `083b3119f77a12c3d83787e13f7c8dc7`	80395	-	✅ Linked
13540	270		`a-performance-load` TDD	-	O `e2d31baf6bf11eef3be5063acd302160`	80395	-	✅ Linked

📊 Sync Statistics

Total (Disk) 27

Total (Database) 27

✓ Synchronized 27

⚠ Desynchronized 0

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
`a-performance-load`	A	Carga de Desempenho (N=10^5) Cenário com o limite máximo de casas para...	TDD	two-pointers-array 2pts complexity-analysis 1pts	Synced
`b-stress-middle`	B	Estresse no Meio do Array Um teste com muitos elementos onde o par de...	TDD	two-pointers-array 1pts arrays 1pts	Synced
`b-large-values`	B	Valores Grandes (Próximos a 10^9) Teste com números de casas e soma alvo...	TDD	two-pointers-array 1pts complexity-analysis 1pts	Synced
`c-boundary-extremes`	C	Casos de Borda (N=2) Situação com o menor número possível de casas.	TDD	arrays 2pts	Synced
`d-sample`	D	Exemplos do Enunciado Os casos de teste fornecidos no exemplo...	TDD	io 1pts	Synced

Local Test Cases (Disk)

Scenario: a-performance-load 5 cases

Name	Files (Input / Output)	Status	Actions
performance-load-01 #13528 📄 📷	Input `performance-load-01.in` 290c0fded371db189d418822ef9e018b Output `performance-load-01.out` c175b4d6cc2cf6123d35307e638b1ee1	✅ Synced (ID: 13528)	🔍 Details
performance-load-02 #13531 📄 📷	Input `performance-load-02.in` 0c5816c9e1c2ecbcdff1e088d41f2ae1 Output `performance-load-02.out` 5ca43c75c0955921d3951af304f604df	✅ Synced (ID: 13531)	🔍 Details
performance-load-03 #13534 📄 📷	Input `performance-load-03.in` 9ebb9ff42a4b80a0fb1cbb7256914c3a Output `performance-load-03.out` d98541798ec9caf15d9663c43cccc6e2	✅ Synced (ID: 13534)	🔍 Details
performance-load-04 #13536 📄 📷	Input `performance-load-04.in` 9ed623767c3bcfb444c3950c0f42fcff Output `performance-load-04.out` 7323cb347d5083967116594903554afb	✅ Synced (ID: 13536)	🔍 Details
performance-load-05 #13540 📄 📷	Input `performance-load-05.in` 083b3119f77a12c3d83787e13f7c8dc7 Output `performance-load-05.out` e2d31baf6bf11eef3be5063acd302160	✅ Synced (ID: 13540)	🔍 Details

Scenario: b-large-values 1 cases

Name	Files (Input / Output)	Status	Actions
large-values-01 #13538 📄 📷	Input `large-values-01.in` e5e28402307c62be98666657c3da1fde Output `large-values-01.out` 72086849f70f9bb5dfe30c77d5c52e48	✅ Synced (ID: 13538)	🔍 Details

Scenario: b-stress-middle 9 cases

Name	Files (Input / Output)	Status	Actions
stress-middle-01 #13526 📄 📷	Input `stress-middle-01.in` 300b21626249771e8f2481b6841bd650 Output `stress-middle-01.out` a52adc8433536be39ca6a4584543fe4f	✅ Synced (ID: 13526)	🔍 Details
stress-middle-02 #13527 📄 📷	Input `stress-middle-02.in` 92ea570f12a3c08d87c2bb70410c3df6 Output `stress-middle-02.out` c6c442a62025e35fff3447d763535267	✅ Synced (ID: 13527)	🔍 Details
stress-middle-03 #13529 📄 📷	Input `stress-middle-03.in` ddb64fcb09bbb88c24378c5245c9ec02 Output `stress-middle-03.out` 6820780978cb754f3dbc5ee3cfd8d776	✅ Synced (ID: 13529)	🔍 Details
stress-middle-04 #13530 📄 📷	Input `stress-middle-04.in` 65d4753cd4bcb6b8adfdcd5f509c7316 Output `stress-middle-04.out` e2feaf844e156cd201bbc37526806168	✅ Synced (ID: 13530)	🔍 Details
stress-middle-05 #13532 📄 📷	Input `stress-middle-05.in` f69bd3ec05693b92724932e57209b95a Output `stress-middle-05.out` e666b8cefedac7c2fbd8cb0933b34bf8	✅ Synced (ID: 13532)	🔍 Details
stress-middle-06 #13533 📄 📷	Input `stress-middle-06.in` 2ef4de6311a1085f270580003580c706 Output `stress-middle-06.out` 472e4749b88fc5b5fcc65d2ce89a0158	✅ Synced (ID: 13533)	🔍 Details
stress-middle-07 #13535 📄 📷	Input `stress-middle-07.in` b52e97c0c84a3923a594b928c69c4a1f Output `stress-middle-07.out` d1fc4a030e917e16f361a1261a51aa19	✅ Synced (ID: 13535)	🔍 Details
stress-middle-08 #13537 📄 📷	Input `stress-middle-08.in` c981e02302843a67d1829d88967dd859 Output `stress-middle-08.out` b7e257a4bd0bd610f4f83daa241a51f4	✅ Synced (ID: 13537)	🔍 Details
stress-middle-09 #13539 📄 📷	Input `stress-middle-09.in` b98adace3ef296212a6aff44f8a49182 Output `stress-middle-09.out` 94862c85b5ff890de2096360f409fbd4	✅ Synced (ID: 13539)	🔍 Details

Scenario: c-boundary-extremes 1 cases

Name	Files (Input / Output)	Status	Actions
boundary-extremes-01 #14800 📄 📷	Input `boundary-extremes-01.in` bf76493b397d3067ccbb84127aa490c7 Output `boundary-extremes-01.out` f9754da8d79befbae6aa154180a6f3af	✅ Synced (ID: 14800)	🔍 Details

Scenario: d-sample 11 cases

Name	Files (Input / Output)	Status	Actions
sample-01 #13515 📄 📷	Input `sample-01.in` 44dd48fefe1f9444a9b81a7d1071878d Output `sample-01.out` 4c2aa1902f1bc59ea7fe25ce74deb973	✅ Synced (ID: 13515)	🔍 Details
sample-02 #13524 📄 📷	Input `sample-02.in` 59b4c71ace9c4a85c8c7b5784fae1788 Output `sample-02.out` 353f8e75c9e13b157b709d65819c2b7e	✅ Synced (ID: 13524)	🔍 Details
sample-03 #13525 📄 📷	Input `sample-03.in` a6f610c18d08f3e52dfe90d4778ead65 Output `sample-03.out` 07a6dc32dd462ec6c7fe589530621276	✅ Synced (ID: 13525)	🔍 Details
sample-04 #13516 📄 📷	Input `sample-04.in` 3d8f6ef23a65720457db63ec1ba9a6e5 Output `sample-04.out` c08b315d57a859b19d1b73d8c3b76db7	✅ Synced (ID: 13516)	🔍 Details
sample-05 #13517 📄 📷	Input `sample-05.in` 2a5e3713d432bf0523cad11c536f692d Output `sample-05.out` 9c0544a0675f5670abf283cbfea3fe94	✅ Synced (ID: 13517)	🔍 Details
sample-06 #13518 📄 📷	Input `sample-06.in` b3119e5f9576fcba4cb5f1636c171093 Output `sample-06.out` 3cab6997bb0f5a408b06e9f2c7d3b46c	✅ Synced (ID: 13518)	🔍 Details
sample-07 #13519 📄 📷	Input `sample-07.in` 2bdb37881d18e1eab47cc41f3a4c8d88 Output `sample-07.out` 524ed54929dfceb55a57118a2bbbc605	✅ Synced (ID: 13519)	🔍 Details
sample-08 #13520 📄 📷	Input `sample-08.in` b09aba963ecf3dc4c95aa5e39f493df6 Output `sample-08.out` 126980a4cf8fd14c26062678701fb7dd	✅ Synced (ID: 13520)	🔍 Details
sample-09 #13521 📄 📷	Input `sample-09.in` 9a1cf69a95e04e85b18f283f4195e33f Output `sample-09.out` 263d05ed54ff26ac44654e4e0c4ce411	✅ Synced (ID: 13521)	🔍 Details
sample-10 #13522 📄 📷	Input `sample-10.in` 06c3837735163d4402fc1887512d4b50 Output `sample-10.out` b75ce1fbb5a5c065d66f3297a43ca4b1	✅ Synced (ID: 13522)	🔍 Details
sample-11 #13523 📄 📷	Input `sample-11.in` c531fe3ffdbb10a4dea9dc27e190608c Output `sample-11.out` b24f3040fa67ab8d79899a26592d2881	✅ Synced (ID: 13523)	🔍 Details

📊 Sync Statistics

Total (Disk) 27

Total (Database) 27

✓ Synchronized 27

⚠ Desynchronized 0

Duplicates (MD5)

Duplicates in (MD5) 0

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

Actions

Solução Ótima (Dois Ponteiros)

ID: a-optimal

Implementação eficiente em O(N) utilizando a técnica de dois ponteiros em array ordenado.

Implementations

Força Bruta (O(N^2))

ID: b-brute-force

Abordagem simples que compara todos os pares de casas. Deve falhar por limite de tempo em grandes entradas.

Implementations

py Imperative

✅ brute_force.py

Solutions Check Report

## Solutions Check Report (Detalhado / Debug)
**Generated**: 2026-06-01T19:42:04.454568
**Solution**: `solutions/a-optimal/solution.py`

### Compilation
✅ No compilation needed

### 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.037</td></tr>
<tr id="row-a-performance-load-performance-load-02-in"><td>performance-load-02.in</td><td>✅ PASS</td><td>0.037</td></tr>
<tr id="row-a-performance-load-performance-load-03-in"><td>performance-load-03.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-a-performance-load-performance-load-04-in"><td>performance-load-04.in</td><td>✅ PASS</td><td>0.037</td></tr>
<tr id="row-a-performance-load-performance-load-05-in"><td>performance-load-05.in</td><td>✅ PASS</td><td>0.033</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-large-values - TDD</strong></td></tr>
<tr id="row-b-large-values-large-values-01-in"><td>large-values-01.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-stress-middle - TDD</strong></td></tr>
<tr id="row-b-stress-middle-stress-middle-01-in"><td>stress-middle-01.in</td><td>✅ PASS</td><td>0.017</td></tr>
<tr id="row-b-stress-middle-stress-middle-02-in"><td>stress-middle-02.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr id="row-b-stress-middle-stress-middle-03-in"><td>stress-middle-03.in</td><td>✅ PASS</td><td>0.016</td></tr>
<tr id="row-b-stress-middle-stress-middle-04-in"><td>stress-middle-04.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr id="row-b-stress-middle-stress-middle-05-in"><td>stress-middle-05.in</td><td>✅ PASS</td><td>0.016</td></tr>
<tr id="row-b-stress-middle-stress-middle-06-in"><td>stress-middle-06.in</td><td>✅ PASS</td><td>0.017</td></tr>
<tr id="row-b-stress-middle-stress-middle-07-in"><td>stress-middle-07.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr id="row-b-stress-middle-stress-middle-08-in"><td>stress-middle-08.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-b-stress-middle-stress-middle-09-in"><td>stress-middle-09.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-boundary-extremes - TDD</strong></td></tr>
<tr id="row-c-boundary-extremes-boundary-extremes-01-in"><td>boundary-extremes-01.in</td><td>✅ PASS</td><td>0.014</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.013</td></tr>
<tr id="row-d-sample-sample-02-in"><td>sample-02.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-03-in"><td>sample-03.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-d-sample-sample-04-in"><td>sample-04.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-05-in"><td>sample-05.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-d-sample-sample-06-in"><td>sample-06.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-07-in"><td>sample-07.in</td><td>✅ PASS</td><td>0.012</td></tr>
<tr id="row-d-sample-sample-08-in"><td>sample-08.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-d-sample-sample-09-in"><td>sample-09.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-d-sample-sample-10-in"><td>sample-10.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-11-in"><td>sample-11.in</td><td>✅ PASS</td><td>0.013</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

cpp: 1 java: 1 py: 2

✅ 0 ❌ 0

🧪 Casos de Teste

5 Scen.

Total no Disco 27

Total no Banco 27

Sincronização 100.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: 750 name: Soma das Casas origin: obi-n2-2012-f2 slug: soma-das-casa authorSlugProblem: Unknown description: Busca de combinação linear alvo (K) em Array uni-dimensional monotonicamente ordenado. O algoritmo processa vetores densos identificando o par exato em O(N) ao contrair margens analíticas, evadindo combinações combinatórias quadráticas O(N^2). editorial: Como os números das casas são fornecidos em ordem estritamente crescente, a solução ideal utiliza a técnica de **dois ponteiros**. Inicializamos um ponteiro no início do vetor e outro no fim. Se a soma dos valores apontados for maior que K, movemos o ponteiro da direita para a esquerda; se for menor, movemos o da esquerda para a direita. Repetimos o processo até encontrar o par exato, o que garante complexidade linear. successmsg: Processamento O(N) restrito validado! A manipulação posicional indexou limites paralelos perfeitamente, provando robustez heurística e evadindo varredura por força bruta. difficultyLevelId: C timeComplexity: O(N) timeLimitSegs: 2.0 memoryLimitMb: 256 defaultStatement: b_pt_soma-das-casa.pdf skills: - arrays - complexity-analysis - io - two-pointers-array statements: - id: a-soma-das-casa testScenarioLevel: A thematicSkills: - points: 1 skill: daily-life testScenarios: - id: a-performance-load name: Carga de Desempenho (N=10^5) description: Cenário com o limite máximo de casas para validar a eficiência O(N) da abordagem de dois ponteiros. helpTip: Estresse Estritamente Linear O(N). Forças brutas puras (Quadráticas O(N^2)) falham via TLE sob N=10^5. Inicie âncoras indexais espelhadas (head, tail) transitando restritamente o delta contra alvo K. level: A testType: TDD skills: - points: 2 skill: two-pointers-array - points: 1 skill: complexity-analysis - id: b-stress-middle name: Estresse no Meio do Array description: Um teste com muitos elementos onde o par de solução está localizado próximo ao centro do vetor. helpTip: Resistência de Fechamento Simétrico. Se o par alvo habita perfeitamente o centro do vetor, as âncoras processam deltas com convergência uniforme. Impede colisões de busca onde head > tail. level: B testType: TDD skills: - points: 1 skill: two-pointers-array - points: 1 skill: arrays - id: b-large-values name: Valores Grandes (Próximos a 10^9) description: Teste com números de casas e soma alvo próximos ao limite superior de um inteiro de 32 bits. helpTip: Upper Bounds e Sinal de Bits. Embora somados não rompam o Integer Limit nativo, valores agregados em Upper Bounds (2*10^9) exigem solidez em processamento Primitivo estrito sobre o Buffer lógico. level: B testType: TDD skills: - points: 1 skill: two-pointers-array - points: 1 skill: complexity-analysis - id: c-boundary-extremes name: Casos de Borda (N=2) description: Situação com o menor número possível de casas. helpTip: Boundary Cases Extremizados (N=2). Validação preventiva contra Pointer Index Errors. Verifique se margens limitam Head=0 e Tail=(N-1) sem tentar dereferenciar saltos dinâmicos em memórias não alocadas. level: C testType: TDD skills: - points: 2 skill: arrays - id: d-sample name: Exemplos do Enunciado description: Os casos de teste fornecidos no exemplo oficial do problema. helpTip: I/O Sanity Check e Format Parser. Validação da modelagem de buffer serial onde lê-se N blocos preenchidos previamente ao limitador estrito K contíguo via StdIn. level: D testType: TDD skills: - points: 1 skill: io solutions: - id: a-optimal name: Solução Ótima (Dois Ponteiros) description: Implementação eficiente em O(N) utilizando a técnica de dois ponteiros em array ordenado. level: A implementations: - filenames: - solution.cpp language: cpp paradigm: Imperative - filenames: - Solution.java language: java paradigm: Imperative main: Solution - filenames: - solution.py language: py paradigm: Imperative - id: b-brute-force name: Força Bruta (O(N^2)) description: Abordagem simples que compara todos os pares de casas. Deve falhar por limite de tempo em grandes entradas. level: B implementations: - filenames: - brute_force.py language: py paradigm: Imperative

0750-soma-das-casa

README.md Preview

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 27 cases

📊 Sync Statistics

Actions

Test Case Details

Testcase Scenarios Sync

Local Test Cases (Disk)

Scenario: a-performance-load 5 cases

Scenario: b-large-values 1 cases

Scenario: b-stress-middle 9 cases

Scenario: c-boundary-extremes 1 cases

Scenario: d-sample 11 cases

📊 Sync Statistics

Actions

Solução Ótima (Dois Ponteiros)

Implementations

Força Bruta (O(N^2))

Implementations

Solutions Check Report

✅ Verification

🚀 Quick Prompts

📄 Enunciados

💡 Soluções

🧪 Casos de Teste

Metadata (form)

Git Status

Git Workflow

Problem Analysis Report

🛠️ Validation Tools

✅ 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

📄 Sync Statements to DB

🚀 Batch Auto-Link Process

⬇️ Repo Sync Output

📝 Update Manifest Output

Ajuda