Files
problemas-para-competicao-p…/longest-palindromic-subsequence/problem.json
2025-12-19 07:49:39 -03:00

64 lines
1.6 KiB
JSON

{
"version": "1.0",
"problem": {
"title": "Maior Subsequência Palindrômica",
"event": "",
"time_limit": 1.0,
"memory_limit_mb": 256,
"input_file": "stdin",
"output_file": "stdout",
"interactive": false,
"grader": false,
"subject": {
"en_us": [
"dynamic-programming", "DP", "longest-palindromic-subsequence", "LPS"
],
"pt_br": [
"programação-dinâmica", "maior-subsequência-palindrômica"
],
"es": [
""
]
}
},
"author": {
"name": "",
"affiliation": "",
"country": "",
"email": ""
},
"build": {
"run_generator": true,
"run_validator": true,
"produce_outputs": true,
"run_checker": true,
"run_all_solutions": true,
"run_specific_solution": "",
"generate_io_only": false,
"generate_pdf_only": false,
"cpu_count": 1,
"build_pdf": true,
"pdf_format": "ds",
"io_samples": 3
},
"solutions": {
"main-ac": "ac.cpp",
"alternative-ac": [],
"wrong-answer": [],
"time-limit": ["TLE.cpp"],
"time-limit-or-ac": [],
"time-limit-or-memory-limit": [],
"memory-limit": [],
"presentation-error": [],
"runtime-error": []
},
"polygon_config": {
"id": ""
},
"boca_config": {
"time_limit": 1,
"number_of_repetitions": 1,
"maximum_memory_mb": 512,
"maximum_output_size_kb": 24096
}
}