CacheDB: 2026-05-20 14:57:17

0514-pedagio

pedagio

A Difficulty

README.md Preview

# 0514 - Pedágio | **Version**: 0.5
`pedagio` | Difficulty: **A** | **Updated**: 2026-05-15 23:43:09

**Sync Status:** ✅ Local: OK | ❌ Maratona: Not in DB | ❌ API: Not in DB

## Overview
Calcule o custo total de uma viagem dado o tamanho da estrada, distância entre os pedágios, custo por quilômetro e valor do pedágio.

## Metadata
- **Author**: Unknown
- **Editorial**: Problema básico de aritmética. O custo total é a soma do custo dos quilômetros rodados
(`L * K`) e o custo dos pedágios. O número de pedágios é `L / D` (divisão inteira).
Portanto, `Custo = (L * K) + (L / D) * P`. O limite máximo `10^4 * 10^4 = 10^8`
cabe em um inteiro de 32 bits, sem perigo de overflow.

- **Success Msg**: Viagem tranquila e custo calculado certinho!

| Time Limit | Memory Limit | Time Complexity | Space Complexity |
| :--- | :--- | :--- | :--- |
| -s | -MB | O(1) | - |

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

## Statements
| ID | Status | Level | Natural Languages | Skills |
| :--- | :--- | :--- | :--- | :--- |
| `a-pedagio` | ✅ | A | pt | math, basic-io |

## Test Scenarios
| Name | Description | Count | Type | Level | Skills | DB Sync |
| :--- | :--- | :--- | :--- | :--- | :--- | :--- |
| **Teste de Carga Máxima** | Casos com os maiores valores possíveis. | 5 | Performance | A | math | - |
| **Fuzzing Aleatório** | Casos aleatórios com valores intermediários. | 5 | TDD | B | math | - |
| **Casos Extremos** | Valores mínimos (1), distância menor que o espaço entre pedágios, exato múltiplo. | 5 | TDD | C | basic-io | - |
| **Exemplos do Enunciado** | Casos de teste do PDF original (OBI 2010). | 3 | TDD | D | basic-io | - |

## Solutions
- **Fórmula O(1)** (`a-otima-basica`)
  - Languages: `cpp, py, java`
- **Simulação Iterativa** (`b-subotima-basica`)
  - 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 18 ✅

Database Info

DB ID 514

Name Pedagio

Time Limit 20.0s

Mem Limit 195 MB

Version 0.8

Difficulty Level O

Test Cases 23

🚀 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-pedagio	A	a b c d	math, basic-io	⚠️

Statement Details

Select a statement above to view details.

Actions

Statistics

1 Total Statements

By Type (ID)

a-pedagio 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 23 cases

ID	Rank	Status	Scenario	Filename	MD5	Description	Image	Disk Sync
8958	1	Sample	—	-	I `477deb6b3d3bd53db06a6c72aedf2bc2`	1	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8958	1	Sample	—	-	O `7efd8e828c42580d6b3a36336533b453`	1	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8959	2	Sample	—	-	I `c1e9673f7bb2bbbcd3434d7d4b69b8fa`	2	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8959	2	Sample	—	-	O `1b28e946f4a8ffd5bdf939779c420986`	2	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8960	3	Sample	—	-	I `537a01a3b06ae27506212782ff2aa1ff`	3	-	✅ Linked
8960	3	Sample	—	-	O `3c71a3f3482184ceca06acb78591c482`	3	-	✅ Linked
8961	4	Sample	—	-	I `f09bdf57eb2e8ec6803e9238fce51feb`	4	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8961	4	Sample	—	-	O `767abe6119a018446bcd7627ff8a4f2d`	4	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8962	5	Sample	—	-	I `23376a081cee3bd32e96eaa8023c6653`	5	-	✅ Linked
8962	5	Sample	—	-	O `7b95e765d095d9a5cc61591e81d2acf5`	5	-	✅ Linked
8963	6	Sample	—	-	I `2ec2d57f042a8c10fa800d1664299ee4`	6	-	✅ Linked
8963	6	Sample	—	-	O `e42002e140b29fc482ab0390cda6bdef`	6	-	✅ Linked
8964	7		—	-	I `39058f81194298e9716008fcd51e8ab4`	7	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8964	7		—	-	O `b402d5c36d90547d3ceb3c8a9a4a9b9a`	7	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8965	8		—	-	I `f10d44b61bc541a57d790cc0e995674d`	8	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8965	8		—	-	O `a629ce12f63050c6656bce175258cf8f`	8	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8966	9		—	-	I `32d91e9264f960dc3a7133bd9e80b57b`	9	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8966	9		—	-	O `c022a267e82708a5df31908003b49b8a`	9	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8967	10		—	-	I `efb98f93da4b32bfff8bcc220f0ac8bf`	10	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8967	10		—	-	O `cc25643c1c2ea78264c0dc2f1f943959`	10	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8968	11		—	-	I `51df51628e89e6236805470da088777c`	11	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8968	11		—	-	O `cc9257796b78f65e8605197319498abb`	11	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8969	12		—	-	I `c378fc4ed909d01a0ba9311384694bcf`	12	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8969	12		—	-	O `86461faefa294f09ac6e8ce1c64dd77e`	12	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8970	13		—	-	I `fbf9acd542bab6b4e13f18a35938c31a`	13	-	✅ Linked
8970	13		—	-	O `d5da69e5dc49436a0dd2da334b8b150b`	13	-	✅ Linked
8971	14		—	-	I `d0e917aeecfbdc1ec72d7c35890c53f6`	14	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8971	14		—	-	O `bec1fb5ef4314a2584ae341bc8a14545`	14	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8972	15		—	-	I `9b7ff2f0202d73b5c677d3718e7c0130`	15	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8972	15		—	-	O `a91ac6f0206a76218449b984081ca8fe`	15	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8973	16		—	-	I `fbf2fda13912f4b49e677ae260082176`	16	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8973	16		—	-	O `7b8eb0ba37fcf45f222b2f26a87c9657`	16	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8974	17		—	-	I `db2a6cc22ee4ee017d603bc5deb6308c`	17	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8974	17		—	-	O `c0383a5b334ffd1d2830c3614819740c`	17	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8975	18		—	-	I `18a0539a22e1ec2548b94f81674c3095`	18	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8975	18		—	-	O `457ce085f0c3f8e5bd439e17de6e2ec8`	18	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8976	19		—	-	I `48f49abbef91282ce44f6656886e42ad`	19	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8976	19		—	-	O `5761f022e31d3ad380c485d2688febf7`	19	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8977	20		—	-	I `6ce3e9ea72721a72421fdfa8b63c83cd`	20	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8977	20		—	-	O `555b09ab00bd75af1e86a6f3b981ac11`	20	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8978	21		—	-	I `10318ee7c35217185033d6da97004dd2`	21	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8978	21		—	-	O `280dcf90be443808820ab0296ca29bdd`	21	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8979	22		—	-	I `18229f91e9f0b802b32118abb5dae8f8`	22	-	✅ Linked
8979	22		—	-	O `734647e3d2ac35fdcdd8f8a89d25efb1`	22	-	✅ Linked
8980	23		—	-	I `f8f1ffdde517789e90b369c5bf8c0bfc`	23	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan
8980	23		—	-	O `980327c5e0436dcaffc6cb9fbe22cb4d`	23	-	⚠️ Unlinked MD5 mismatch & name not found 🔎 Scan

📊 Sync Statistics

Total (Disk) 18

Total (Database) 23

✓ Synchronized 5

⚠ Desynchronized 32

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`	A	Teste de Carga Máxima Casos com os maiores valores possíveis.	PERFORMANCE	math 1pts	Not in DB	Details
`b-fuzzing`	B	Fuzzing Aleatório Casos aleatórios com valores intermediários.	TDD	math 1pts	Not in DB	Details
`c-edge`	C	Casos Extremos Valores mínimos (1), distância menor que o...	TDD	basic-io 1pts	Not in DB	Details
`d-sample`	D	Exemplos do Enunciado Casos de teste do PDF original (OBI 2010).	TDD	basic-io 1pts	Not in DB	Details

Local Test Cases (Disk)

Scenario: a-performance 5 cases

Name	Files (Input / Output)	Status	Actions
01 📄 📷	Input `01.in` 0abe103c06a9375fa098497793e78749 Output `01.out` 8d2d6402f3f1fc999f381f94fc8c71ef	🆕 Not in DB	🔍 Details 🔎 Scan
02 📄 📷	Input `02.in` cbb5ba110d9755cd76ab5bee126cea2a Output `02.out` 221ac7b9be720e0356770af212ca986d	🆕 Not in DB	🔍 Details 🔎 Scan
03 📄 📷	Input `03.in` a3b641be79eb6b6f196a854123f380ae Output `03.out` 444f502d479424b9abd86de8da37f6cb	🆕 Not in DB	🔍 Details 🔎 Scan
04 📄 📷	Input `04.in` 7e034f9155c39f5b93613969582c7f53 Output `04.out` fe0e6ed36c197e6707b157db2dc2f550	🆕 Not in DB	🔍 Details 🔎 Scan
05 📄 📷	Input `05.in` 1c466b3fbdc6197a0b8667c53b0ff925 Output `05.out` edc03226be1a27fc4b338e5dcf495cbc	🆕 Not in DB	🔍 Details 🔎 Scan

Scenario: b-fuzzing 5 cases

Name	Files (Input / Output)	Status	Actions
01 📄 📷	Input `01.in` 78ba7c86f4ebebcdf859c33fa55dd1b0 Output `01.out` 91b27d6167a3909b1cb35553e23cba4f	🆕 Not in DB	🔍 Details 🔎 Scan
02 📄 📷	Input `02.in` 5632cc8bf060138e3089bb8e769fd28a Output `02.out` b299f82449ec206d287f05540e02d388	🆕 Not in DB	🔍 Details 🔎 Scan
03 📄 📷	Input `03.in` 86038d8f1327463e9df13d0104665750 Output `03.out` 68a8731ffed0b287f5148632eea4331a	🆕 Not in DB	🔍 Details 🔎 Scan
04 📄 📷	Input `04.in` ed6b50058370e8698b5ef18441d3b61e Output `04.out` 246198fa43e15114102c6ae5b76cebb9	🆕 Not in DB	🔍 Details 🔎 Scan
05 📄 📷	Input `05.in` fbdb76156541e7fd809b8692f74061b3 Output `05.out` 7a40e209b53066b4dabd9053f969be84	🆕 Not in DB	🔍 Details 🔎 Scan

Scenario: c-edge 5 cases

Name	Files (Input / Output)	Status	Actions
01 📄 📷	Input `01.in` 1e99c5d37205b4bfd3e95bb398ac7f5b Output `01.out` 26ab0db90d72e28ad0ba1e22ee510510	🆕 Not in DB	🔍 Details 🔎 Scan
02 #8979 📄 📷	Input `02.in` 18229f91e9f0b802b32118abb5dae8f8 Output `02.out` 734647e3d2ac35fdcdd8f8a89d25efb1	✅ Synced (ID: 8979)	🔍 Details
03 📄 📷	Input `03.in` 464574491753c9f3468fa49855c758c0 Output `03.out` 905f2bb7e8852fb96cb9aeff9568a839	🆕 Not in DB	🔍 Details 🔎 Scan
04 📄 📷	Input `04.in` 070d257d67dd2b74b86f0c1a64a29aa7 Output `04.out` 61eb14a047ccd79dd06a26f13d69aa98	🆕 Not in DB	🔍 Details 🔎 Scan
05 #8970 📄 📷	Input `05.in` fbf9acd542bab6b4e13f18a35938c31a Output `05.out` d5da69e5dc49436a0dd2da334b8b150b	✅ Synced (ID: 8970)	🔍 Details

Scenario: d-sample 3 cases

Name	Files (Input / Output)	Status	Actions
01 #8960 📄 📷	Input `01.in` 537a01a3b06ae27506212782ff2aa1ff Output `01.out` 3c71a3f3482184ceca06acb78591c482	✅ Synced (ID: 8960)	🔍 Details
02 #8962 📄 📷	Input `02.in` 23376a081cee3bd32e96eaa8023c6653 Output `02.out` 7b95e765d095d9a5cc61591e81d2acf5	✅ Synced (ID: 8962)	🔍 Details
03 #8963 📄 📷	Input `03.in` 2ec2d57f042a8c10fa800d1664299ee4 Output `03.out` e42002e140b29fc482ab0390cda6bdef	✅ Synced (ID: 8963)	🔍 Details

📊 Sync Statistics

Total (Disk) 18

Total (Database) 23

✓ Synchronized 5

⚠ Desynchronized 32

Duplicates (MD5)

Duplicates in (MD5) 0

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

Actions

Fórmula O(1)

ID: a-otima-basica

Calcula o custo utilizando uma expressão matemática simples.

Implementations

Simulação Iterativa

ID: b-subotima-basica

Simula a passagem por cada quilômetro e soma os custos (O(L)).

Implementations

py Imperative

✅ subotima.py

Solutions Check Report

## Solutions Check Report (Detalhado / Debug)
**Generated**: 2026-05-20T21:10:01.547783
**Solution**: `solutions/b-subotima-basica/subotima.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 - Performance</strong></td></tr>
<tr id="row-a-performance-01-in"><td>01.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-a-performance-02-in"><td>02.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-a-performance-03-in"><td>03.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-a-performance-04-in"><td>04.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-a-performance-05-in"><td>05.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-fuzzing - TDD</strong></td></tr>
<tr id="row-b-fuzzing-01-in"><td>01.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-b-fuzzing-02-in"><td>02.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-b-fuzzing-03-in"><td>03.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-b-fuzzing-04-in"><td>04.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-b-fuzzing-05-in"><td>05.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-edge - TDD</strong></td></tr>
<tr id="row-c-edge-01-in"><td>01.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-c-edge-02-in"><td>02.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-c-edge-03-in"><td>03.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-c-edge-04-in"><td>04.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr id="row-c-edge-05-in"><td>05.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>d-sample - TDD</strong></td></tr>
<tr id="row-d-sample-01-in"><td>01.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-02-in"><td>02.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-03-in"><td>03.in</td><td>✅ PASS</td><td>0.014</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 py: 2 java: 1

✅ 0 ❌ 0

🧪 Casos de Teste

4 Scen.

Total no Disco 18

Total no Banco 23

Sincronização 28.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: "0.5" id: 514 name: "Pedágio" slug: "pedagio" timelimit: 1.0 memlimit: 256 difficultyLevelId: A author: OBI 2010 origin: Olimpíada Brasileira de Informática – OBI 2010 description: 'Calcule o custo total de uma viagem dado o tamanho da estrada, distância entre os pedágios, custo por quilômetro e valor do pedágio.' editorial: | Problema básico de aritmética. O custo total é a soma do custo dos quilômetros rodados (`L * K`) e o custo dos pedágios. O número de pedágios é `L / D` (divisão inteira). Portanto, `Custo = (L * K) + (L / D) * P`. O limite máximo `10^4 * 10^4 = 10^8` cabe em um inteiro de 32 bits, sem perigo de overflow. successmsg: 'Viagem tranquila e custo calculado certinho!' timeComplexity: O(1) skills: - math - basic-io statements: - id: a-pedagio testScenarioLevel: A thematicSkills: - skill: math points: 1 - skill: basic-io points: 1 testScenarios: - id: a-performance name: Teste de Carga Máxima description: Casos com os maiores valores possíveis. helpTip: 'Atenção aos limites máximos.' level: A testType: PERFORMANCE skills: - skill: math points: 1 - id: b-fuzzing name: Fuzzing Aleatório description: Casos aleatórios com valores intermediários. helpTip: 'Teste diversas combinações de distâncias e pedágios.' level: B testType: TDD skills: - skill: math points: 1 - id: c-edge name: Casos Extremos description: Valores mínimos (1), distância menor que o espaço entre pedágios, exato múltiplo. helpTip: 'O que acontece quando a estrada termina exatamente no km de um pedágio?' level: C testType: TDD skills: - skill: basic-io points: 1 - id: d-sample name: Exemplos do Enunciado description: Casos de teste do PDF original (OBI 2010). helpTip: 'Certifique-se de passar nestes casos antes de submeter.' level: D testType: TDD skills: - skill: basic-io points: 1 solutions: - id: a-otima-basica name: Fórmula O(1) description: Calcula o custo utilizando uma expressão matemática simples. level: A implementations: - language: cpp paradigm: Imperative main: pedagio.cpp filenames: - pedagio.cpp - language: py paradigm: Imperative main: pedagio.py filenames: - pedagio.py - language: java paradigm: OO main: Pedagio filenames: - Pedagio.java - id: b-subotima-basica name: Simulação Iterativa description: Simula a passagem por cada quilômetro e soma os custos (O(L)). level: B implementations: - language: py paradigm: Imperative main: subotima.py filenames: - subotima.py authorSlugProblem: Unknown

0514-pedagio

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

📊 Sync Statistics

Actions

Test Case Details

Testcase Scenarios Sync

Local Test Cases (Disk)

Scenario: a-performance 5 cases

Scenario: b-fuzzing 5 cases

Scenario: c-edge 5 cases

Scenario: d-sample 3 cases

📊 Sync Statistics

Actions

Fórmula O(1)

Implementations

Simulação Iterativa

Implementations

Solutions Check Report

✅ Verification

🚀 Quick Prompts

📄 Enunciados

💡 Soluções

🧪 Casos de Teste

Metadata (form)

Git Status

⚠️ Detached HEAD / No Branch

Git Workflow

Problem Analysis Report

🛠️ Validation Tools

ℹ️ Not Fixed in API Platform

✅ 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