Definir, usando Data.Matrix, la funci\u00f3n<\/p>\n
\n ampliaMatriz :: Matrix a -> Int -> Int -> Matrix a\n<\/pre>\ntal que (ampliaMatriz p f c) es la matriz obtenida a partir de p repitiendo cada fila f veces y cada columna c veces. Por ejemplo, si ej1 es la matriz definida por<\/p>\n
\n ej1 :: Matrix Char\n ej1 = fromLists [\" x \",\n \"x x\",\n \" x \"]\n<\/pre>\nentonces<\/p>\n
\n \u03bb> ampliaMatriz ej1 1 2\n ( ' ' ' ' 'x' 'x' ' ' ' ' )\n ( 'x' 'x' ' ' ' ' 'x' 'x' )\n ( ' ' ' ' 'x' 'x' ' ' ' ' )\n \n \u03bb> (putStr . unlines . toLists) (ampliaMatriz ej1 1 2)\n xx \n xx xx\n xx \n \u03bb> (putStr . unlines . toLists) (ampliaMatriz ej1 2 1)\n x \n x \n x x\n x x\n x \n x \n \u03bb> (putStr . unlines . toLists) (ampliaMatriz ej1 2 2)\n xx \n xx \n xx xx\n xx xx\n xx \n xx \n \u03bb> (putStr . unlines . toLists) (ampliaMatriz ej1 2 3)\n xxx \n xxx \n xxx xxx\n xxx xxx\n xxx \n xxx \n<\/pre>\nNota<\/em>: Este ejercicio est\u00e1 basado en el problema Skener<\/a> de Kattis<\/a>.<\/p>\nSoluciones<\/h4>\n\nimport Data.Matrix\n\nej1 :: Matrix Char\nej1 = fromLists [\" x \",\n \"x x\",\n \" x \"]\n\n-- 1\u00aa definici\u00f3n\n-- =============\n\nampliaMatriz :: Matrix a -> Int -> Int -> Matrix a\nampliaMatriz p f c =\n ampliaColumnas (ampliaFilas p f) c\n\nampliaFilas :: Matrix a -> Int -> Matrix a\nampliaFilas p f =\n matrix (f*m) n (\\(i,j) -> p!(1 + (i-1) `div` f, j))\n where m = nrows p\n n = ncols p\n\nampliaColumnas :: Matrix a -> Int -> Matrix a\nampliaColumnas p c =\n matrix m (c*n) (\\(i,j) -> p!(i,1 + (j-1) `div` c))\n where m = nrows p\n n = ncols p\n\n-- 2\u00aa definici\u00f3n\n-- =============\n\nampliaMatriz2 :: Matrix a -> Int -> Int -> Matrix a\nampliaMatriz2 p f c =\n ampliaColumnas2 (ampliaFilas2 p f) c\n\nampliaFilas2 :: Matrix a -> Int -> Matrix a\nampliaFilas2 p f =\n fromLists (concatMap (replicate f) (toLists p))\n\nampliaColumnas2 :: Matrix a -> Int -> Matrix a\nampliaColumnas2 p c =\n fromLists (map (concatMap (replicate c)) (toLists p))\n\n-- 3\u00aa definici\u00f3n\n-- =============\n\nampliaMatriz3 :: Matrix a -> Int -> Int -> Matrix a\nampliaMatriz3 p f c =\n ( fromLists\n . concatMap (map (concatMap (replicate c)) . replicate f)\n . toLists) p\n\n-- Comparaci\u00f3n de eficiencia\n-- =========================\n\nejemplo :: Int -> Matrix Int\nejemplo n = fromList n n [1..]\n\n-- \u03bb> maximum (ampliaMatriz (ejemplo 10) 100 200)\n-- 100\n-- (6.64 secs, 1,026,559,296 bytes)\n-- \u03bb> maximum (ampliaMatriz2 (ejemplo 10) 100 200)\n-- 100\n-- (1.90 secs, 513,211,144 bytes)\n-- \u03bb> maximum (ampliaMatriz3 (ejemplo 10) 100 200)\n-- 100\n-- (1.89 secs, 644,928,024 bytes)\n-- \u03bb> maximum (ampliaMatriz2 (ejemplo 10) 200 200)\n-- 100\n-- (5.13 secs, 1,248,173,384 bytes)\n-- \u03bb> maximum (ampliaMatriz3 (ejemplo 10) 200 200)\n-- 100\n-- (4.67 secs, 1,431,540,344 bytes)\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Definir, usando Data.Matrix, la funci\u00f3n ampliaMatriz :: Matrix a -> Int -> Int -> Matrix a tal que (ampliaMatriz p f c) es la matriz obtenida a partir de p repitiendo cada fila f veces y cada columna c veces. Por ejemplo, si ej1 es la matriz definida por ej1 :: Matrix Char ej1 =…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[4],"tags":[58,30,96,10,42,97,99,98,19,389],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3211"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=3211"}],"version-history":[{"count":6,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3211\/revisions"}],"predecessor-version":[{"id":3245,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3211\/revisions\/3245"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3211"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3211"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}