diff --git a/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf b/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf index 897d04d..83acdcd 100644 Binary files a/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf and b/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf differ diff --git a/analise-de-dados/arthur-dolival-analise-de-dados.pdf b/analise-de-dados/arthur-dolival-analise-de-dados.pdf index 0dc627b..be1a847 100644 Binary files a/analise-de-dados/arthur-dolival-analise-de-dados.pdf and b/analise-de-dados/arthur-dolival-analise-de-dados.pdf differ diff --git a/caching-offline/caching-offline-tutorial.pdf b/caching-offline/caching-offline-tutorial.pdf index 8afe251..fa2cf12 100644 Binary files a/caching-offline/caching-offline-tutorial.pdf and b/caching-offline/caching-offline-tutorial.pdf differ diff --git a/caching-offline/caching-offline-tutorial.tex b/caching-offline/caching-offline-tutorial.tex index b4d74f5..78867e6 100644 --- a/caching-offline/caching-offline-tutorial.tex +++ b/caching-offline/caching-offline-tutorial.tex @@ -5,9 +5,10 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Caching Offline} -\author{} +\author{Arthur Andrade D'Olival } \date{} \begin{document} \maketitle diff --git a/caching-offline/caching-offline.pdf b/caching-offline/caching-offline.pdf index c0f7456..a6b048f 100644 Binary files a/caching-offline/caching-offline.pdf and b/caching-offline/caching-offline.pdf differ diff --git a/caching-offline/caching-offline.tex b/caching-offline/caching-offline.tex index ca24866..e25b23a 100644 --- a/caching-offline/caching-offline.tex +++ b/caching-offline/caching-offline.tex @@ -1,7 +1,7 @@ \documentclass{maratona} \begin{document} -\begin{ProblemaAutor}{}{Caching Offline}{1}{256}{} +\begin{ProblemaAutor}{}{Caching Offline}{1}{256}{Arthur Andrade D'Olival } Dado um sistema com memória principal dividida em \( k \) frames, deseja-se gerenciar uma sequência de requisições de páginas de modo a minimizar falhas de memória (\textit{cache misses}). @@ -24,6 +24,7 @@ A saída deve conter uma única linha. Deve ser impresso um único inteiro representando o \textbf{menor número de falhas de página} (\textit{cache misses}) que podem ser obtidos para a sequência e capacidade de memória fornecidas. \ExemploEntrada + \begin{Exemplo} \texttt{1~3} & \texttt{3}\\ \texttt{1~2~3} & \\ diff --git a/caching-offline/problem.json b/caching-offline/problem.json index b147c16..7652e24 100644 --- a/caching-offline/problem.json +++ b/caching-offline/problem.json @@ -2,7 +2,7 @@ "version": "1.0", "problem": { "title": "Caching Offline", - "event": "", + "event": "DS Contest Tools", "time_limit": 1.0, "memory_limit_mb": 256, "input_file": "stdin", @@ -22,7 +22,7 @@ } }, "author": { - "name": "", + "name": "Arthur Andrade D'Olival ", "affiliation": "", "country": "", "email": "" @@ -36,7 +36,7 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 3 diff --git a/chuva/chuva-tutorial.pdf b/chuva/chuva-tutorial.pdf index 260019e..59ea177 100644 Binary files a/chuva/chuva-tutorial.pdf and b/chuva/chuva-tutorial.pdf differ diff --git a/chuva/chuva-tutorial.tex b/chuva/chuva-tutorial.tex index 48f9ae4..b08eda3 100644 --- a/chuva/chuva-tutorial.tex +++ b/chuva/chuva-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Chuva} \author{OBI 2019} \date{} diff --git a/chuva/chuva.pdf b/chuva/chuva.pdf index b9ba97f..05719c2 100644 Binary files a/chuva/chuva.pdf and b/chuva/chuva.pdf differ diff --git a/chuva/chuva.tex b/chuva/chuva.tex index d42a338..86a9b69 100644 --- a/chuva/chuva.tex +++ b/chuva/chuva.tex @@ -39,6 +39,7 @@ representando a matriz da entrada depois que todas as posições molhadas forem marcadas com o caractere \texttt{o}. \ExemploEntrada + \begin{Exemplo} \texttt{9~14} & \texttt{......oooooo..}\\ \texttt{.......o......} & \texttt{.\#\#\#..o\#\#\#\#o\#.}\\ diff --git a/chuva/problem.json b/chuva/problem.json index 12ff5a5..a721d07 100644 --- a/chuva/problem.json +++ b/chuva/problem.json @@ -43,7 +43,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative_ac.py"], + "alternative-ac": ["alternative_ac.py","saad_java.java"], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/decode-ways/arthur-dolival-decode-ways-tutorial.pdf b/decode-ways/arthur-dolival-decode-ways-tutorial.pdf index ca8de49..5c418b9 100644 Binary files a/decode-ways/arthur-dolival-decode-ways-tutorial.pdf and b/decode-ways/arthur-dolival-decode-ways-tutorial.pdf differ diff --git a/decode-ways/arthur-dolival-decode-ways.pdf b/decode-ways/arthur-dolival-decode-ways.pdf index d5ebb99..c7abbe2 100644 Binary files a/decode-ways/arthur-dolival-decode-ways.pdf and b/decode-ways/arthur-dolival-decode-ways.pdf differ diff --git a/decode-ways/decode-ways-tutorial.pdf b/decode-ways/decode-ways-tutorial.pdf index b32230c..d5cbbce 100644 Binary files a/decode-ways/decode-ways-tutorial.pdf and b/decode-ways/decode-ways-tutorial.pdf differ diff --git a/decode-ways/decode-ways-tutorial.tex b/decode-ways/decode-ways-tutorial.tex index e98e3db..03ed334 100644 --- a/decode-ways/decode-ways-tutorial.tex +++ b/decode-ways/decode-ways-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Decodificando Mensagens} \author{Arthur Andrade D'Olival} \date{} diff --git a/decode-ways/decode-ways.pdf b/decode-ways/decode-ways.pdf index c01d2b0..efab58f 100644 Binary files a/decode-ways/decode-ways.pdf and b/decode-ways/decode-ways.pdf differ diff --git a/decode-ways/decode-ways.tex b/decode-ways/decode-ways.tex index 0b59772..6ab47e2 100644 --- a/decode-ways/decode-ways.tex +++ b/decode-ways/decode-ways.tex @@ -21,6 +21,7 @@ A saída deve conter um único inteiro, representando o número total de maneira Como este número pode ser extremamente grande, sua resposta deve ser calculada e impressa \textbf{módulo \(10^9 + 7\)}. \ExemploEntrada + \begin{Exemplo} \texttt{2} & \texttt{2}\\ \texttt{12} & \\ @@ -34,9 +35,9 @@ Como este número pode ser extremamente grande, sua resposta deve ser calculada \Notas -Para a sequência \( s = "12" \), existem duas decodificações possíveis: "AB" (1, 2) e "L" (12). -Para a sequência \( s = "226" \), há três decodificações possíveis: "BZ" (2, 26), "VF" (22, 6) e "BBF" (2, 2, 6). -Para a sequência \( s = "06" \), não há nenhuma forma válida de decodificação. +Para a sequência \( s = 12 \), existem duas decodificações possíveis: "AB" (1, 2) e "L" (12). +Para a sequência \( s = 226 \), há três decodificações possíveis: "BZ" (2, 26), "VF" (22, 6) e "BBF" (2, 2, 6). +Para a sequência \( s = 06 \), não há nenhuma forma válida de decodificação. \section*{Observações} diff --git a/decode-ways/statement/notes.tex b/decode-ways/statement/notes.tex index 9635f08..847de11 100644 --- a/decode-ways/statement/notes.tex +++ b/decode-ways/statement/notes.tex @@ -1,6 +1,6 @@ -Para a sequência \( s = "12" \), existem duas decodificações possíveis: "AB" (1, 2) e "L" (12). -Para a sequência \( s = "226" \), há três decodificações possíveis: "BZ" (2, 26), "VF" (22, 6) e "BBF" (2, 2, 6). -Para a sequência \( s = "06" \), não há nenhuma forma válida de decodificação. +Para a sequência \( s = 12 \), existem duas decodificações possíveis: "AB" (1, 2) e "L" (12). +Para a sequência \( s = 226 \), há três decodificações possíveis: "BZ" (2, 26), "VF" (22, 6) e "BBF" (2, 2, 6). +Para a sequência \( s = 06 \), não há nenhuma forma válida de decodificação. \section*{Observações} diff --git a/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf b/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf index 6318545..b1f1b27 100644 Binary files a/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf and b/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf differ diff --git a/delete-and-earn/arthur-dolival-delete-and-earn.pdf b/delete-and-earn/arthur-dolival-delete-and-earn.pdf index 29e3277..2e9beae 100644 Binary files a/delete-and-earn/arthur-dolival-delete-and-earn.pdf and b/delete-and-earn/arthur-dolival-delete-and-earn.pdf differ diff --git a/delete-and-earn/delete-and-earn-tutorial.pdf b/delete-and-earn/delete-and-earn-tutorial.pdf index 4ae0d36..a246a63 100644 Binary files a/delete-and-earn/delete-and-earn-tutorial.pdf and b/delete-and-earn/delete-and-earn-tutorial.pdf differ diff --git a/delete-and-earn/delete-and-earn-tutorial.tex b/delete-and-earn/delete-and-earn-tutorial.tex index 6bf389b..cb79282 100644 --- a/delete-and-earn/delete-and-earn-tutorial.tex +++ b/delete-and-earn/delete-and-earn-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Deletar e Ganhar} \author{Arthur Andrade D'Olival} \date{} diff --git a/delete-and-earn/delete-and-earn.pdf b/delete-and-earn/delete-and-earn.pdf index b2c0c3c..312ed57 100644 Binary files a/delete-and-earn/delete-and-earn.pdf and b/delete-and-earn/delete-and-earn.pdf differ diff --git a/delete-and-earn/delete-and-earn.tex b/delete-and-earn/delete-and-earn.tex index aedb96a..7586462 100644 --- a/delete-and-earn/delete-and-earn.tex +++ b/delete-and-earn/delete-and-earn.tex @@ -19,6 +19,7 @@ A segunda linha contém \( n \) inteiros \( a_1, a_2, \ldots, a_n \) (\( 1 \leq A saída deve conter um único inteiro, representando a pontuação máxima possível obtida após realizar as operações descritas. \ExemploEntrada + \begin{Exemplo} \texttt{3} & \texttt{8}\\ \texttt{3~4~5} & \\ diff --git a/delete-and-earn/problem.json b/delete-and-earn/problem.json index e046dfe..199aa6d 100644 --- a/delete-and-earn/problem.json +++ b/delete-and-earn/problem.json @@ -43,9 +43,17 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["saad.py"], - "wrong-answer": ["WA.cpp"], - "time-limit": ["TLE.cpp"], + "alternative-ac": [ + "saad.py", + "ac_java.java", + "ac_py.py" + ], + "wrong-answer": [ + "WA.cpp" + ], + "time-limit": [ + "TLE.cpp" + ], "time-limit-or-ac": [], "time-limit-or-memory-limit": [], "memory-limit": [], diff --git a/edit-distance/arthur-dolival-edit-distance-tutorial.pdf b/edit-distance/arthur-dolival-edit-distance-tutorial.pdf index fa1483d..59d41c8 100644 Binary files a/edit-distance/arthur-dolival-edit-distance-tutorial.pdf and b/edit-distance/arthur-dolival-edit-distance-tutorial.pdf differ diff --git a/edit-distance/arthur-dolival-edit-distance.pdf b/edit-distance/arthur-dolival-edit-distance.pdf index 0401841..c4cce7e 100644 Binary files a/edit-distance/arthur-dolival-edit-distance.pdf and b/edit-distance/arthur-dolival-edit-distance.pdf differ diff --git a/edit-distance/edit-distance-tutorial.pdf b/edit-distance/edit-distance-tutorial.pdf index 7b32358..6d1c12c 100644 Binary files a/edit-distance/edit-distance-tutorial.pdf and b/edit-distance/edit-distance-tutorial.pdf differ diff --git a/edit-distance/edit-distance-tutorial.tex b/edit-distance/edit-distance-tutorial.tex index 22fa039..940e2fc 100644 --- a/edit-distance/edit-distance-tutorial.tex +++ b/edit-distance/edit-distance-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Distância de Edição} \author{Arthur Andrade D'Olival} \date{} diff --git a/edit-distance/edit-distance.pdf b/edit-distance/edit-distance.pdf index dae7819..5715fb2 100644 Binary files a/edit-distance/edit-distance.pdf and b/edit-distance/edit-distance.pdf differ diff --git a/edit-distance/edit-distance.tex b/edit-distance/edit-distance.tex index 0a1d053..ea1095c 100644 --- a/edit-distance/edit-distance.tex +++ b/edit-distance/edit-distance.tex @@ -29,6 +29,7 @@ A entrada consiste de duas linhas: Imprima um único inteiro representando o \textbf{menor número de operações} necessárias para transformar \( s_1 \) em \( s_2 \). \ExemploEntrada + \begin{Exemplo} \texttt{7~7} & \texttt{3}\\ \texttt{estouro~calouro} & \\ diff --git a/edit-distance/problem.json b/edit-distance/problem.json index e013e6d..7977816 100644 --- a/edit-distance/problem.json +++ b/edit-distance/problem.json @@ -11,10 +11,13 @@ "grader": false, "subject": { "en_us": [ - "dynamic-programming", "DP", "edit-distance" + "dynamic-programming", + "DP", + "edit-distance" ], "pt_br": [ - "programação-dinâmica", "distância-de-edição" + "programação-dinâmica", + "distância-de-edição" ], "es": [ "" @@ -36,16 +39,22 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 2 }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["saad.py"], + "alternative-ac": [ + "saad.py", + "ac_java.java", + "ac_py.py" + ], "wrong-answer": [], - "time-limit": ["TLE.cpp"], + "time-limit": [ + "TLE.cpp" + ], "time-limit-or-ac": [], "time-limit-or-memory-limit": [], "memory-limit": [], diff --git a/estouro/arthur-dolival-estouro-tutorial.pdf b/estouro/arthur-dolival-estouro-tutorial.pdf index 2b6889c..88e24bc 100644 Binary files a/estouro/arthur-dolival-estouro-tutorial.pdf and b/estouro/arthur-dolival-estouro-tutorial.pdf differ diff --git a/estouro/arthur-dolival-estouro.pdf b/estouro/arthur-dolival-estouro.pdf index 262b7eb..e065439 100644 Binary files a/estouro/arthur-dolival-estouro.pdf and b/estouro/arthur-dolival-estouro.pdf differ diff --git a/estouro/estouro-tutorial.pdf b/estouro/estouro-tutorial.pdf index 442d5a8..683e2b2 100644 Binary files a/estouro/estouro-tutorial.pdf and b/estouro/estouro-tutorial.pdf differ diff --git a/estouro/estouro-tutorial.tex b/estouro/estouro-tutorial.tex index 5b0a763..55175f9 100644 --- a/estouro/estouro-tutorial.tex +++ b/estouro/estouro-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Estouro} \author{Arthur Andrade D'Olival} \date{} diff --git a/estouro/estouro.pdf b/estouro/estouro.pdf index 9a9615f..0063bc8 100644 Binary files a/estouro/estouro.pdf and b/estouro/estouro.pdf differ diff --git a/estouro/estouro.tex b/estouro/estouro.tex index e8352d2..d4099cb 100644 --- a/estouro/estouro.tex +++ b/estouro/estouro.tex @@ -9,7 +9,7 @@ A regra do experimento é simples, ou pelo menos parece: você deve estourar tod Porém, o nível de energia liberado em cada explosão depende dos balões que ainda restam ao redor. Ao estourar o balão $i$, o experimento libera uma quantidade de energia igual a -\texttt{valor\_do\_balão[i-1] * valor\_do\_balão[i] * valor\_do\_balão[i+1]}. +$b[i-1] * b[i] * b[i+1]$, em que $b[k]$ é o valor do $k$-ésimo balão. Se algum dos vizinhos ($i-1$ ou $i+1$) não existir, imagine que há um balão virtual com o número $1$ nas extremidades. Cada explosão altera completamente o arranjo restante, tornando o resultado imprevisível, a ordem em que você estoura os balões é crucial. @@ -29,6 +29,7 @@ Imprima um único inteiro, a \textbf{quantidade máxima total de energia} que po ao estourar todos os balões na melhor ordem possível. \ExemploEntrada + \begin{Exemplo} \texttt{4} & \texttt{167}\\ \texttt{3~1~5~8} & \\ diff --git a/estouro/problem.json b/estouro/problem.json index 996a41b..34511f5 100644 --- a/estouro/problem.json +++ b/estouro/problem.json @@ -36,14 +36,18 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 2 }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": [ + "alternative-ac.py", + "ac_java.java", + "ac_py.py" + ], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/estouro/statement/description.tex b/estouro/statement/description.tex index b23f5b4..6b3cf35 100644 --- a/estouro/statement/description.tex +++ b/estouro/statement/description.tex @@ -4,7 +4,7 @@ A regra do experimento é simples, ou pelo menos parece: você deve estourar tod Porém, o nível de energia liberado em cada explosão depende dos balões que ainda restam ao redor. Ao estourar o balão $i$, o experimento libera uma quantidade de energia igual a -\texttt{valor\_do\_balão[i-1] * valor\_do\_balão[i] * valor\_do\_balão[i+1]}. +$b[i-1] * b[i] * b[i+1]$, em que $b[i]$ é o valor de energia do $i$-ésimo balão. Se algum dos vizinhos ($i-1$ ou $i+1$) não existir, imagine que há um balão virtual com o número $1$ nas extremidades. Cada explosão altera completamente o arranjo restante, tornando o resultado imprevisível, a ordem em que você estoura os balões é crucial. diff --git a/flowers/arthur-dolival-flowers-tutorial.pdf b/flowers/arthur-dolival-flowers-tutorial.pdf index bdcafd2..f45574b 100644 Binary files a/flowers/arthur-dolival-flowers-tutorial.pdf and b/flowers/arthur-dolival-flowers-tutorial.pdf differ diff --git a/flowers/arthur-dolival-flowers.pdf b/flowers/arthur-dolival-flowers.pdf index 9c8a4ca..bee8045 100644 Binary files a/flowers/arthur-dolival-flowers.pdf and b/flowers/arthur-dolival-flowers.pdf differ diff --git a/gatinhos/problem.json b/gatinhos/problem.json index 57344ed..040ddbe 100644 --- a/gatinhos/problem.json +++ b/gatinhos/problem.json @@ -43,7 +43,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": ["alternative-ac.py","saad_java.java"], "wrong-answer": ["wa.cpp"], "time-limit": [], "time-limit-or-ac": [], diff --git a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos-tutorial.pdf b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos-tutorial.pdf index 584eca6..8b3b59e 100644 Binary files a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos-tutorial.pdf and b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos-tutorial.pdf differ diff --git a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf index 2ff1949..5b207ab 100644 Binary files a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf and b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf differ diff --git a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.tex b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.tex index 60ca135..90f82b8 100644 --- a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.tex +++ b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.tex @@ -1,5 +1,23 @@ \documentclass{maratona} +\usepackage[boxed,algoruled,linesnumbered,vlined,longend]{algorithm2e} +\SetKwFor{For}{for $($}{$)$}{} +\SetKwFor{ForAll}{for all $($}{$)$}{} +\SetKwFor{If}{if $($}{$)$}{} +\SetKwFor{ElseIf}{else if $($}{$)$}{} +\newcommand{\Call}[2]{\textsc{#1}(#2)} +\SetFuncSty{textsc} +\DontPrintSemicolon +\newenvironment{algoritmo}[1][htbp] +{ + \begingroup + \renewcommand{\algorithmcfname}{Algoritmo} + \begin{algorithm}[#1] +} +{ + \end{algorithm} + \endgroup +} \begin{document} \begin{ProblemaAutor}{}{Inclusão de Subintervalos}{1}{256}{} diff --git a/inclusao-de-subintervalos/inclusao-de-subintervalos-tutorial.pdf b/inclusao-de-subintervalos/inclusao-de-subintervalos-tutorial.pdf index 34e1dcc..c37f9eb 100644 Binary files a/inclusao-de-subintervalos/inclusao-de-subintervalos-tutorial.pdf and b/inclusao-de-subintervalos/inclusao-de-subintervalos-tutorial.pdf differ diff --git a/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf b/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf index 0968b28..2ac9141 100644 Binary files a/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf and b/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf differ diff --git a/inclusao-de-subintervalos/inclusao-de-subintervalos.tex b/inclusao-de-subintervalos/inclusao-de-subintervalos.tex index 90f82b8..c67783b 100644 --- a/inclusao-de-subintervalos/inclusao-de-subintervalos.tex +++ b/inclusao-de-subintervalos/inclusao-de-subintervalos.tex @@ -19,7 +19,7 @@ \endgroup } \begin{document} -\begin{ProblemaAutor}{}{Inclusão de Subintervalos}{1}{256}{} +\begin{ProblemaAutor}{}{Inclusão de Subintervalos}{1}{256}{Arthur Andrade D'Olival} Seja \( S \) um conjunto de \( n \) intervalos sobre a reta real \( ([l_0, r_0], [l_1, r_1], \ldots, [l_{n-1}, r_{n-1}]) \), de modo que, para todo intervalo \( [l_i, r_i] \), temos \( l_i \le r_i \). diff --git a/inclusao-de-subintervalos/problem.json b/inclusao-de-subintervalos/problem.json index 148a65f..79fc3f9 100644 --- a/inclusao-de-subintervalos/problem.json +++ b/inclusao-de-subintervalos/problem.json @@ -2,7 +2,7 @@ "version": "1.0", "problem": { "title": "Inclusão de Subintervalos", - "event": "", + "event": "DS Contest-Tools", "time_limit": 1.0, "memory_limit_mb": 256, "input_file": "stdin", @@ -26,7 +26,7 @@ } }, "author": { - "name": "", + "name": "Arthur Andrade D'Olival", "affiliation": "", "country": "", "email": "" @@ -40,7 +40,7 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 2 @@ -49,7 +49,8 @@ "main-ac": "ac.cpp", "alternative-ac": [ "caio.cpp", - "saad.py" + "saad.py", + "luma.py" ], "wrong-answer": [ "wa.cpp" diff --git a/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf b/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf index 319dc1b..022f6b6 100644 Binary files a/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf and b/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf differ diff --git a/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf b/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf index f721a5e..b5c230d 100644 Binary files a/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf and b/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf differ diff --git a/knapsack-zero-one/knapsack-zero-one-tutorial.pdf b/knapsack-zero-one/knapsack-zero-one-tutorial.pdf index a02cbad..5335dd7 100644 Binary files a/knapsack-zero-one/knapsack-zero-one-tutorial.pdf and b/knapsack-zero-one/knapsack-zero-one-tutorial.pdf differ diff --git a/knapsack-zero-one/knapsack-zero-one-tutorial.tex b/knapsack-zero-one/knapsack-zero-one-tutorial.tex index 4fb4397..e38d26d 100644 --- a/knapsack-zero-one/knapsack-zero-one-tutorial.tex +++ b/knapsack-zero-one/knapsack-zero-one-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Knapsack Problem} \author{Arthur Andrade D'Olival} \date{} diff --git a/knapsack-zero-one/knapsack-zero-one.pdf b/knapsack-zero-one/knapsack-zero-one.pdf index 8b68d26..cfcc522 100644 Binary files a/knapsack-zero-one/knapsack-zero-one.pdf and b/knapsack-zero-one/knapsack-zero-one.pdf differ diff --git a/knapsack-zero-one/knapsack-zero-one.tex b/knapsack-zero-one/knapsack-zero-one.tex index 55a6dd6..2eaf61f 100644 --- a/knapsack-zero-one/knapsack-zero-one.tex +++ b/knapsack-zero-one/knapsack-zero-one.tex @@ -19,6 +19,7 @@ Cada uma das próximas \( N \) linhas contém dois inteiros \( w_i \) e \( v_i \ Imprima um único inteiro representando o valor total máximo que pode ser obtido sem exceder a capacidade da mochila. \ExemploEntrada + \begin{Exemplo} \texttt{3~8} & \texttt{90}\\ \texttt{3~30} & \\ diff --git a/knapsack-zero-one/problem.json b/knapsack-zero-one/problem.json index ee4e0b1..cbbc107 100644 --- a/knapsack-zero-one/problem.json +++ b/knapsack-zero-one/problem.json @@ -36,14 +36,14 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 3 }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": ["alternative-ac.py","ac_java.java","ac_py.py"], "wrong-answer": ["WA.cpp"], "time-limit": ["TLE.cpp"], "time-limit-or-ac": [], diff --git a/knight-moves/knight-moves-tutorial.pdf b/knight-moves/knight-moves-tutorial.pdf index f934cd9..fd81ec2 100644 Binary files a/knight-moves/knight-moves-tutorial.pdf and b/knight-moves/knight-moves-tutorial.pdf differ diff --git a/knight-moves/knight-moves-tutorial.tex b/knight-moves/knight-moves-tutorial.tex index a84e69e..d735530 100644 --- a/knight-moves/knight-moves-tutorial.tex +++ b/knight-moves/knight-moves-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Movimento do Cavalo} \author{Spoj NAKANJ - Minimum Knight moves} \date{} diff --git a/knight-moves/knight-moves.pdf b/knight-moves/knight-moves.pdf index 44e37c0..661166e 100644 Binary files a/knight-moves/knight-moves.pdf and b/knight-moves/knight-moves.pdf differ diff --git a/knight-moves/knight-moves.tex b/knight-moves/knight-moves.tex index e6b4d1e..b799f2c 100644 --- a/knight-moves/knight-moves.tex +++ b/knight-moves/knight-moves.tex @@ -31,6 +31,7 @@ o primeiro caractere é uma letra de `a' a `h', e o segundo é um dígito de `1' Para cada caso de teste, imprima o número mínimo de movimentos necessários para o cavalo alcançar o destino a partir da posição inicial. \ExemploEntrada + \begin{Exemplo} \texttt{3} & \texttt{6}\\ \texttt{a1~h8} & \texttt{1}\\ diff --git a/knight-moves/problem.json b/knight-moves/problem.json index ae2f281..8304561 100644 --- a/knight-moves/problem.json +++ b/knight-moves/problem.json @@ -43,7 +43,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": [], + "alternative-ac": ["saad_java.java","saad_python.py"], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf b/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf index 6cf6ecc..38ed275 100644 Binary files a/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf and b/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf differ diff --git a/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf b/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf index cc5d2e3..9990083 100644 Binary files a/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf and b/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf differ diff --git a/longest-common-subsequence/longest-common-subsequence-tutorial.pdf b/longest-common-subsequence/longest-common-subsequence-tutorial.pdf index 804ebd0..53aeed4 100644 Binary files a/longest-common-subsequence/longest-common-subsequence-tutorial.pdf and b/longest-common-subsequence/longest-common-subsequence-tutorial.pdf differ diff --git a/longest-common-subsequence/longest-common-subsequence-tutorial.tex b/longest-common-subsequence/longest-common-subsequence-tutorial.tex index 3e4dbfe..95fcc62 100644 --- a/longest-common-subsequence/longest-common-subsequence-tutorial.tex +++ b/longest-common-subsequence/longest-common-subsequence-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Maior Subsequência Comum} \author{Arthur Andrade D'Olival} \date{} diff --git a/longest-common-subsequence/longest-common-subsequence.pdf b/longest-common-subsequence/longest-common-subsequence.pdf index 57a9993..0542191 100644 Binary files a/longest-common-subsequence/longest-common-subsequence.pdf and b/longest-common-subsequence/longest-common-subsequence.pdf differ diff --git a/longest-common-subsequence/longest-common-subsequence.tex b/longest-common-subsequence/longest-common-subsequence.tex index 367d86f..75921ba 100644 --- a/longest-common-subsequence/longest-common-subsequence.tex +++ b/longest-common-subsequence/longest-common-subsequence.tex @@ -20,6 +20,7 @@ Na primeira linha, deve ser impresso o comprimento da maior subsequência comum. Na segunda linha, deve ser impressa uma subsequência comum de comprimento máximo. \ExemploEntrada + \begin{Exemplo} \texttt{5~3} & \texttt{3}\\ \texttt{abcde~ace} & \texttt{ace}\\ diff --git a/longest-common-subsequence/problem.json b/longest-common-subsequence/problem.json index d01f64e..01720f8 100644 --- a/longest-common-subsequence/problem.json +++ b/longest-common-subsequence/problem.json @@ -11,10 +11,13 @@ "grader": false, "subject": { "en_us": [ - "dynamic-programming", "LCS", "longest-common-subsequence" + "dynamic-programming", + "LCS", + "longest-common-subsequence" ], "pt_br": [ - "programação-dinâmica", "maior-subsequência-comum" + "programação-dinâmica", + "maior-subsequência-comum" ], "es": [ "" @@ -36,16 +39,22 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 3 }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": [ + "alternative-ac.py", + "ac_java.java", + "ac_py.py" + ], "wrong-answer": [], - "time-limit": ["TLE.cpp"], + "time-limit": [ + "TLE.cpp" + ], "time-limit-or-ac": [], "time-limit-or-memory-limit": [], "memory-limit": [], diff --git a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf index bfe43f8..c5ebf04 100644 Binary files a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf and b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf differ diff --git a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf index 64dda58..3f99029 100644 Binary files a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf and b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf differ diff --git a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf index 7dd3060..69f4002 100644 Binary files a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf and b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf differ diff --git a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf index 4a21e00..f9aa5be 100644 Binary files a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf and b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf differ diff --git a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf index 44921a5..4bcd0aa 100644 Binary files a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf and b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf differ diff --git a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf index dc75c96..99cc8c6 100644 Binary files a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf and b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf differ diff --git a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf index c997fcb..0462873 100644 Binary files a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf and b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf differ diff --git a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf index 533bd6b..b9e8979 100644 Binary files a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf and b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf differ diff --git a/metro/metro-tutorial.pdf b/metro/metro-tutorial.pdf index 5ac5d5b..c300930 100644 Binary files a/metro/metro-tutorial.pdf and b/metro/metro-tutorial.pdf differ diff --git a/metro/metro-tutorial.tex b/metro/metro-tutorial.tex index 6f6c0a0..072d4c2 100644 --- a/metro/metro-tutorial.tex +++ b/metro/metro-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Metro} \author{OBI 2015} \date{} diff --git a/metro/metro.pdf b/metro/metro.pdf index 597704d..9629310 100644 Binary files a/metro/metro.pdf and b/metro/metro.pdf differ diff --git a/metro/metro.tex b/metro/metro.tex index 12b4f59..c6395e3 100644 --- a/metro/metro.tex +++ b/metro/metro.tex @@ -42,6 +42,7 @@ Imprima um único inteiro: o número de estações pelas quais passa a linha circular do sistema de metrô. \ExemploEntrada + \begin{Exemplo} \texttt{6~10} & \texttt{5}\\ \texttt{1~6} & \\ diff --git a/metro/problem.json b/metro/problem.json index 51e1716..5fa3431 100644 --- a/metro/problem.json +++ b/metro/problem.json @@ -43,7 +43,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative_ac.py"], + "alternative-ac": ["alternative_ac.py","saad_java.java"], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf b/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf index 7d9605a..37aed2b 100644 Binary files a/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf and b/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf differ diff --git a/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf b/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf index 6920dbc..4aa272d 100644 Binary files a/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf and b/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf differ diff --git a/pique-pega/problem.json b/pique-pega/problem.json index 39b737c..7cdfd70 100644 --- a/pique-pega/problem.json +++ b/pique-pega/problem.json @@ -43,7 +43,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": ["alternative-ac.py", "saad_java.java"], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/rede-anel-estelar/problem.json b/rede-anel-estelar/problem.json index 1469ebe..02b246d 100644 --- a/rede-anel-estelar/problem.json +++ b/rede-anel-estelar/problem.json @@ -43,7 +43,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": ["alternative-ac.py","saad_java.java"], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/rede-anel-estelar/rede-anel-estelar-tutorial.pdf b/rede-anel-estelar/rede-anel-estelar-tutorial.pdf index 688f2ff..8b79c35 100644 Binary files a/rede-anel-estelar/rede-anel-estelar-tutorial.pdf and b/rede-anel-estelar/rede-anel-estelar-tutorial.pdf differ diff --git a/rede-anel-estelar/rede-anel-estelar-tutorial.tex b/rede-anel-estelar/rede-anel-estelar-tutorial.tex index 7b70f24..689919e 100644 --- a/rede-anel-estelar/rede-anel-estelar-tutorial.tex +++ b/rede-anel-estelar/rede-anel-estelar-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: Rede Anel Estelar} \author{Arthur Andrade Dolival} \date{} diff --git a/rede-anel-estelar/rede-anel-estelar.pdf b/rede-anel-estelar/rede-anel-estelar.pdf index 8d90350..1434fea 100644 Binary files a/rede-anel-estelar/rede-anel-estelar.pdf and b/rede-anel-estelar/rede-anel-estelar.pdf differ diff --git a/rede-anel-estelar/rede-anel-estelar.tex b/rede-anel-estelar/rede-anel-estelar.tex index dacc34f..64b6f6c 100644 --- a/rede-anel-estelar/rede-anel-estelar.tex +++ b/rede-anel-estelar/rede-anel-estelar.tex @@ -36,6 +36,7 @@ Se a topologia atual corresponder perfeitamente às especificações de uma Rede Caso contrário, imprima \texttt{OFFLINE}. \ExemploEntrada + \begin{Exemplo} \texttt{14~14} & \texttt{ONLINE}\\ \texttt{10~1} & \\ diff --git a/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf b/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf index 32c4547..cc6cb97 100644 Binary files a/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf and b/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf differ diff --git a/rod-cutting/arthur-dolival-rod-cutting.pdf b/rod-cutting/arthur-dolival-rod-cutting.pdf index 7098c5f..20a2142 100644 Binary files a/rod-cutting/arthur-dolival-rod-cutting.pdf and b/rod-cutting/arthur-dolival-rod-cutting.pdf differ diff --git a/sms/problem.json b/sms/problem.json index 3cda60b..ca52a25 100644 --- a/sms/problem.json +++ b/sms/problem.json @@ -47,7 +47,7 @@ }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": ["alternative-ac.py"], + "alternative-ac": ["alternative-ac.py","saad_java.java"], "wrong-answer": [], "time-limit": [], "time-limit-or-ac": [], diff --git a/sms/sms-tutorial.pdf b/sms/sms-tutorial.pdf index 1c9b426..e5bdd48 100644 Binary files a/sms/sms-tutorial.pdf and b/sms/sms-tutorial.pdf differ diff --git a/sms/sms-tutorial.tex b/sms/sms-tutorial.tex index 70ed1a3..3ed4624 100644 --- a/sms/sms-tutorial.tex +++ b/sms/sms-tutorial.tex @@ -5,7 +5,8 @@ \usepackage{url} \pagenumbering{gobble} \usepackage{hyperref} - +\usepackage{graphicx} +\input{statement/preamble.tex} \title{ Tutorial: SMS} \author{Arthur Andrade D'Olival} \date{} diff --git a/sms/sms.pdf b/sms/sms.pdf index 5a9fad5..840e57c 100644 Binary files a/sms/sms.pdf and b/sms/sms.pdf differ diff --git a/sms/sms.tex b/sms/sms.tex index 2fda3ad..c888af8 100644 --- a/sms/sms.tex +++ b/sms/sms.tex @@ -24,6 +24,7 @@ Se for possível que o SMS chegue até Ana, primeiro imprima $k$: o número mín Se não for possível encontrar nenhuma rota, imprima \texttt{-1}. \ExemploEntrada + \begin{Exemplo} \texttt{5~5} & \texttt{3}\\ \texttt{1~2} & \texttt{1~4~5}\\ @@ -31,7 +32,7 @@ Se não for possível encontrar nenhuma rota, imprima \texttt{-1}. \texttt{1~4} & \\ \texttt{2~3} & \\ \texttt{5~4} & \\ -\rowcolor{gray!20}\texttt{5~4} & \texttt{-1}\\ +\rowcolor{gray!20}\texttt{5~4} & \texttt{\textendash{}1}\\ \rowcolor{gray!20}\texttt{1~2} & \\ \rowcolor{gray!20}\texttt{2~3} & \\ \rowcolor{gray!20}\texttt{3~4} & \\ diff --git a/subset-sum/arthur-dolival-subset-sum-tutorial.pdf b/subset-sum/arthur-dolival-subset-sum-tutorial.pdf index b39f36a..476c572 100644 Binary files a/subset-sum/arthur-dolival-subset-sum-tutorial.pdf and b/subset-sum/arthur-dolival-subset-sum-tutorial.pdf differ diff --git a/subset-sum/arthur-dolival-subset-sum.pdf b/subset-sum/arthur-dolival-subset-sum.pdf index 745a94c..2904568 100644 Binary files a/subset-sum/arthur-dolival-subset-sum.pdf and b/subset-sum/arthur-dolival-subset-sum.pdf differ diff --git a/unconventional-pairs/problem.json b/unconventional-pairs/problem.json index 5cd6a77..907f3ed 100644 --- a/unconventional-pairs/problem.json +++ b/unconventional-pairs/problem.json @@ -2,7 +2,7 @@ "version": "1.0", "problem": { "title": "Unconventional pairs", - "event": "", + "event": "DS Contest-Tools", "time_limit": 1.0, "memory_limit_mb": 256, "input_file": "stdin", @@ -11,10 +11,12 @@ "grader": false, "subject": { "en_us": [ - "greedy", "sorting" + "greedy", + "sorting" ], "pt_br": [ - "guloso", "ordenação" + "guloso", + "ordenação" ], "es": [ "" @@ -36,15 +38,22 @@ "run_specific_solution": "", "generate_io_only": false, "generate_pdf_only": false, - "cpu_count": 1, + "cpu_count": 0, "build_pdf": true, "pdf_format": "ds", "io_samples": 1 }, "solutions": { "main-ac": "ac.cpp", - "alternative-ac": [], - "wrong-answer": ["wa.cpp"], + "alternative-ac": [ + "ac_py.py", + "ac_java.java" + ], + "wrong-answer": [ + "wa.cpp", + "wa_py.py", + "wa_java.java" + ], "time-limit": [], "time-limit-or-ac": [], "time-limit-or-memory-limit": [], diff --git a/unconventional-pairs/unconventional-pairs-tutorial.pdf b/unconventional-pairs/unconventional-pairs-tutorial.pdf index 8ffb2a7..a4c5697 100644 Binary files a/unconventional-pairs/unconventional-pairs-tutorial.pdf and b/unconventional-pairs/unconventional-pairs-tutorial.pdf differ diff --git a/unconventional-pairs/unconventional-pairs-tutorial.tex b/unconventional-pairs/unconventional-pairs-tutorial.tex index 206090a..2fb8b61 100644 --- a/unconventional-pairs/unconventional-pairs-tutorial.tex +++ b/unconventional-pairs/unconventional-pairs-tutorial.tex @@ -7,7 +7,6 @@ \usepackage{hyperref} \usepackage{graphicx} \input{statement/preamble.tex} - \title{ Tutorial: Unconventional pairs} \author{Codeforces 1054 (Div. 3)} \date{} diff --git a/unconventional-pairs/unconventional-pairs.pdf b/unconventional-pairs/unconventional-pairs.pdf index 7e697a9..2f1c611 100644 Binary files a/unconventional-pairs/unconventional-pairs.pdf and b/unconventional-pairs/unconventional-pairs.pdf differ diff --git a/vacations/arthur-dolival-vacations-tutorial.pdf b/vacations/arthur-dolival-vacations-tutorial.pdf index 96d7a67..14af7a0 100644 Binary files a/vacations/arthur-dolival-vacations-tutorial.pdf and b/vacations/arthur-dolival-vacations-tutorial.pdf differ diff --git a/vacations/arthur-dolival-vacations.pdf b/vacations/arthur-dolival-vacations.pdf index 6a2999f..3029649 100644 Binary files a/vacations/arthur-dolival-vacations.pdf and b/vacations/arthur-dolival-vacations.pdf differ