Submission #69674798

---

Source Code Expand

{-# OPTIONS_GHC -Wall #-}
{-# OPTIONS_GHC -Wname-shadowing #-} -- 内側のスコープの値と同じ名前が外側のスコープにあるとき警告する

import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.Char
import Data.List
import qualified Data.Array.Unboxed as AU

readInts :: IO [Int]
readInts = unfoldr (BS.readInt . BS.dropWhile isSpace) <$> BS.getLine

main :: IO ()
main = do
  [n,q] <- readInts
  as <- readInts
  qs <- replicateM q readInts
  let ss = scanl (+) 0 $ as ++ as -- 2周分用意する
  let arr = AU.listArray (0,2*n) ss :: AU.UArray Int Int
--  print arr
  putStr $ unlines $ map show $ solve n 0 arr qs

solve n idx arr [] = []
solve n idx arr (q:qs) = case q of
                     (1:c:_) -> solve n ((idx+c)`mod`n) arr qs
                     (2:l:r:_) -> arr AU.! r2 - arr AU.! (l2-1) : solve n idx arr qs
                       where
                         l1 = (l + idx)`mod`n
                         r1 = (r + idx)`mod`n
                         l2 = if l1 < idx then l1 + n else l1
                         r2 = if r1 < idx || r1 < l2 then r1 + n else r1

Submission Info

Compile Error

app/Main.hs:23:1: warning: [-Wmissing-signatures]
    Top-level binding with no type signature:
      solve :: (AU.IArray a1 a2, AU.Ix i, Integral i, Num a2) =>
               i -> i -> a1 i a2 -> [[i]] -> [a2]
   |
23 | solve n idx arr [] = []
   | ^^^^^

app/Main.hs:23:7: warning: [-Wunused-matches]
    Defined but not used: ‘n’
   |
23 | solve n idx arr [] = []
   |       ^

app/Main.hs:23:9: warning: [-Wunused-matches]
    Defined but not used: ‘idx’
   |
23 | solve n idx arr [] = []
   |         ^^^

app/Main.hs:23:13: warning: [-Wunused-matches]
    Defined but not used: ‘arr’
   |
23 | solve n idx arr [] = []
   |             ^^^

app/Main.hs:24:26: warning: [-Wincomplete-patterns]
    Pattern match(es) are non-exhaustive
    In a case alternative:
        Patterns of type ‘[i]’ not matched:
            []
            (p:_) where p is not one of {1, 2}
            [1]
            [2]
            ...
   |
24 | solve n idx arr (q:qs) = case q of
   |                          ^^^^^^^^^...

Judge Result