Submission #508070
Source Code Expand
module Main where
import Control.Applicative
import Data.List (foldl')
main :: IO ()
main = do
n <- readLn
as <- map read . words <$> getLine
print $ solve n as
solve :: Int -> [Int] -> Int
solve n as
| p `mod` n /= 0 = -1
| otherwise = (\(_,_,b) -> b) $ foldl' f (0, 0, 0) as
where
p = sum as
pn = p `div` n
f (p', n', b) a
| (p' + a) `divMod` (n' + 1) == (pn,0) = (0, 0, b + n') -- 過不足無し。カウントはリセット
| otherwise = (p' + a, n' + 1, b) -- 過不足あり。カウントを増やして次へ。
Submission Info
| Submission Time | |
|---|---|
| Task | B - 島と橋 |
| User | belliture |
| Language | Haskell (Haskell Platform 2014.2.0.0) |
| Score | 100 |
| Code Size | 606 Byte |
| Status | AC |
| Exec Time | 32 ms |
| Memory | 1744 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 100 / 100 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
| All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 31 ms | 1104 KiB |
| sample_02.txt | AC | 29 ms | 1176 KiB |
| sample_03.txt | AC | 28 ms | 1104 KiB |
| sample_04.txt | AC | 27 ms | 1108 KiB |
| subtask1_01.txt | AC | 28 ms | 1180 KiB |
| subtask1_02.txt | AC | 30 ms | 1176 KiB |
| subtask1_03.txt | AC | 28 ms | 1176 KiB |
| subtask1_04.txt | AC | 28 ms | 1184 KiB |
| subtask1_05.txt | AC | 29 ms | 1676 KiB |
| subtask1_06.txt | AC | 29 ms | 1688 KiB |
| subtask1_07.txt | AC | 29 ms | 1616 KiB |
| subtask1_08.txt | AC | 29 ms | 1620 KiB |
| subtask1_09.txt | AC | 29 ms | 1616 KiB |
| subtask1_10.txt | AC | 29 ms | 1616 KiB |
| subtask1_11.txt | AC | 29 ms | 1620 KiB |
| subtask1_12.txt | AC | 29 ms | 1688 KiB |
| subtask1_13.txt | AC | 29 ms | 1616 KiB |
| subtask1_14.txt | AC | 31 ms | 1692 KiB |
| subtask1_15.txt | AC | 30 ms | 1620 KiB |
| subtask1_16.txt | AC | 29 ms | 1608 KiB |
| subtask1_17.txt | AC | 32 ms | 1640 KiB |
| subtask1_18.txt | AC | 31 ms | 1644 KiB |
| subtask1_19.txt | AC | 30 ms | 1616 KiB |
| subtask1_20.txt | AC | 30 ms | 1552 KiB |
| subtask1_21.txt | AC | 29 ms | 1680 KiB |
| subtask1_22.txt | AC | 31 ms | 1644 KiB |
| subtask1_23.txt | AC | 30 ms | 1616 KiB |
| subtask1_24.txt | AC | 31 ms | 1616 KiB |
| subtask1_25.txt | AC | 30 ms | 1620 KiB |
| subtask1_26.txt | AC | 31 ms | 1620 KiB |
| subtask1_27.txt | AC | 30 ms | 1668 KiB |
| subtask1_28.txt | AC | 31 ms | 1620 KiB |
| subtask1_29.txt | AC | 30 ms | 1616 KiB |
| subtask1_30.txt | AC | 28 ms | 1680 KiB |
| subtask1_31.txt | AC | 29 ms | 1492 KiB |
| subtask1_32.txt | AC | 30 ms | 1688 KiB |
| subtask1_33.txt | AC | 29 ms | 1616 KiB |
| subtask1_34.txt | AC | 31 ms | 1744 KiB |