[ { "id": 1, "name": "001", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, K, L;\n\nlong long A[1 << 18];\n\n\n\nbool solve(long long M) {\n\n long long cnt = 0, pre = 0;\n\n for (int i = 1; i <= N; i++) {\n\n if (A[i] - pre >= M && L - A[i] >= M) {\n\n cnt += 1;\n\n pre = A[i];\n\n }\n\n }\n\n if (cnt >= K) return true;\n\n return false;\n\n}\n\n\n\nint main() {\n\n // Step #1. “ü—Í\n\n cin >> N >> L;\n\n cin >> K;\n\n for (int i = 1; i <= N; i++) {\n\n cin >> A[i];\n\n }\n\n \n\n // Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j\n\n // https://qiita.com/drken/items/97e37dd6143e33a64c8c\n\n long long left = -1;\n\n long long right = L + 1;\n\n while (right - left > 1) {\n\n long long mid = left + (right - left) / 2;\n\n if (solve(mid) == false) right = mid;\n\n else left = mid;\n\n }\n\n cout << left << endl;\n\n return 0;\n\n}", "Crystal": "_, l = read_line.split.map(&.to_i)\nk = read_line.to_i\na = read_line.split.map(&.to_i) + [l]\nputs (1..10**9).bsearch { |len|\n last, cnt = 0, 0\n a.each do |i|\n if i - last >= len\n cnt += 1\n last = i\n end\n end\n cnt < k + 1\n}.not_nil! - 1\n" }, { "id": 2, "name": "001", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, K, L;\n\nlong long A[1 << 18];\n\n\n\nbool solve(long long M) {\n\n long long cnt = 0, pre = 0;\n\n for (int i = 1; i <= N; i++) {\n\n if (A[i] - pre >= M && L - A[i] >= M) {\n\n cnt += 1;\n\n pre = A[i];\n\n }\n\n }\n\n if (cnt >= K) return true;\n\n return false;\n\n}\n\n\n\nint main() {\n\n // Step #1. “ü—Í\n\n cin >> N >> L;\n\n cin >> K;\n\n for (int i = 1; i <= N; i++) {\n\n cin >> A[i];\n\n }\n\n \n\n // Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j\n\n // https://qiita.com/drken/items/97e37dd6143e33a64c8c\n\n long long left = -1;\n\n long long right = L + 1;\n\n while (right - left > 1) {\n\n long long mid = left + (right - left) / 2;\n\n if (solve(mid) == false) right = mid;\n\n else left = mid;\n\n }\n\n cout << left << endl;\n\n return 0;\n\n}", "Python": "n, l = map(int,input().split())\nk = int(input())\na = list(map(int,input().split()))\na.append(l)\ndif = [a[0]] # 切り口の差を計算\nfor i in range(n):\n dif.append(a[i + 1] - a[i])\n\ndef is_ok(x):\n length = 0\n cnt = 0\n for i in dif:\n length += i\n if length >= x:\n length = 0\n cnt += 1\n return cnt # 分割する領域の個数\n\ndef meguru_bisect(ng, ok):\n while ng - ok > 1:\n mid = (ng + ok) // 2\n if is_ok(mid) >= k + 1: # まだまだ大きくできる\n ok = mid\n else:\n ng = mid # 小さくしなければいけない\n return ok\n\nprint(meguru_bisect(l + 1, -1))" }, { "id": 3, "name": "001", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, K, L;\n\nlong long A[1 << 18];\n\n\n\nbool solve(long long M) {\n\n long long cnt = 0, pre = 0;\n\n for (int i = 1; i <= N; i++) {\n\n if (A[i] - pre >= M && L - A[i] >= M) {\n\n cnt += 1;\n\n pre = A[i];\n\n }\n\n }\n\n if (cnt >= K) return true;\n\n return false;\n\n}\n\n\n\nint main() {\n\n // Step #1. “ü—Í\n\n cin >> N >> L;\n\n cin >> K;\n\n for (int i = 1; i <= N; i++) {\n\n cin >> A[i];\n\n }\n\n \n\n // Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j\n\n // https://qiita.com/drken/items/97e37dd6143e33a64c8c\n\n long long left = -1;\n\n long long right = L + 1;\n\n while (right - left > 1) {\n\n long long mid = left + (right - left) / 2;\n\n if (solve(mid) == false) right = mid;\n\n else left = mid;\n\n }\n\n cout << left << endl;\n\n return 0;\n\n}", "Go": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar sc = bufio.NewScanner(os.Stdin)\n\nfunc main() {\n\tbuf := make([]byte, 1024*1024)\n\tsc.Buffer(buf, bufio.MaxScanTokenSize)\n\tsc.Split(bufio.ScanWords)\n\n\tn, l := ScanInt(), ScanInt()\n\tk := ScanInt()\n\ta := ScanIntSlice(n)\n\n\tok, ng := 0, l\n\n\tcheck := func(x int) bool {\n\t\tpreAi := 0\n\t\tcnt := 0\n\t\tfor i := 0; i < n; i++ {\n\t\t\tif a[i]-preAi >= x && l-a[i] >= x {\n\t\t\t\tcnt++\n\t\t\t\tpreAi = a[i]\n\t\t\t}\n\t\t}\n\t\treturn cnt >= k\n\t}\n\n\tfor ng-ok > 1 {\n\t\tc := (ng + ok) / 2\n\t\tif check(c) {\n\t\t\tok = c\n\t\t} else {\n\t\t\tng = c\n\t\t}\n\t}\n\tfmt.Println(ok)\n}\n\nfunc ScanInt() int {\n\tsc.Scan()\n\ti, err := strconv.Atoi(sc.Text())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn i\n}\n\nfunc ScanIntSlice(n int) []int {\n\ts := make([]int, n)\n\tfor i := range s {\n\t\ts[i] = ScanInt()\n\t}\n\treturn s\n}\n" }, { "id": 4, "name": "001", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, K, L;\n\nlong long A[1 << 18];\n\n\n\nbool solve(long long M) {\n\n long long cnt = 0, pre = 0;\n\n for (int i = 1; i <= N; i++) {\n\n if (A[i] - pre >= M && L - A[i] >= M) {\n\n cnt += 1;\n\n pre = A[i];\n\n }\n\n }\n\n if (cnt >= K) return true;\n\n return false;\n\n}\n\n\n\nint main() {\n\n // Step #1. “ü—Í\n\n cin >> N >> L;\n\n cin >> K;\n\n for (int i = 1; i <= N; i++) {\n\n cin >> A[i];\n\n }\n\n \n\n // Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j\n\n // https://qiita.com/drken/items/97e37dd6143e33a64c8c\n\n long long left = -1;\n\n long long right = L + 1;\n\n while (right - left > 1) {\n\n long long mid = left + (right - left) / 2;\n\n if (solve(mid) == false) right = mid;\n\n else left = mid;\n\n }\n\n cout << left << endl;\n\n return 0;\n\n}", "Rust": "fn main() {\n proconio::input! {\n n: isize,\n l: isize,\n k: isize,\n mut a: [isize; n]\n }\n a.sort();\n let mut ok = 0;\n let mut ng = l + 1;\n while (ng - ok).abs() > 1 {\n let mid = (ok + ng) / 2;\n if is_ok(&a, l, k, mid) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n println!(\"{}\", ok);\n}\n\nfn is_ok(a: &Vec, l: isize, k: isize, mid: isize) -> bool {\n let mut x = 0;\n let mut y = 0;\n for i in a {\n if i - x >= mid && l - i >= mid {\n x = *i;\n y += 1;\n }\n }\n y >= k\n}\n" }, { "id": 5, "name": "001", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, K, L;\n\nlong long A[1 << 18];\n\n\n\nbool solve(long long M) {\n\n long long cnt = 0, pre = 0;\n\n for (int i = 1; i <= N; i++) {\n\n if (A[i] - pre >= M && L - A[i] >= M) {\n\n cnt += 1;\n\n pre = A[i];\n\n }\n\n }\n\n if (cnt >= K) return true;\n\n return false;\n\n}\n\n\n\nint main() {\n\n // Step #1. “ü—Í\n\n cin >> N >> L;\n\n cin >> K;\n\n for (int i = 1; i <= N; i++) {\n\n cin >> A[i];\n\n }\n\n \n\n // Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j\n\n // https://qiita.com/drken/items/97e37dd6143e33a64c8c\n\n long long left = -1;\n\n long long right = L + 1;\n\n while (right - left > 1) {\n\n long long mid = left + (right - left) / 2;\n\n if (solve(mid) == false) right = mid;\n\n else left = mid;\n\n }\n\n cout << left << endl;\n\n return 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a[n] :: l\n\t\n\tvar ok: int :: 0\n\tvar ng: int :: l + 1\n\twhile((ok - ng).abs() > 1)\n\t\tvar mid: int :: (ok + ng) / 2\n\t\tvar prev: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n)\n\t\t\tif(a[i] - prev >= mid)\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo prev :: a[i]\n\t\t\tend if\n\t\tend for\n\t\t\n\t\tvar isOk: bool :: cnt >= k + 1\n\t\tif(isOk)\n\t\t\tdo ok :: mid\n\t\telse\n\t\t\tdo ng :: mid\n\t\tend if\n\tend while\n\t\n\tvar ans: int :: ok\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 6, "name": "001", "Crystal": "_, l = read_line.split.map(&.to_i)\nk = read_line.to_i\na = read_line.split.map(&.to_i) + [l]\nputs (1..10**9).bsearch { |len|\n last, cnt = 0, 0\n a.each do |i|\n if i - last >= len\n cnt += 1\n last = i\n end\n end\n cnt < k + 1\n}.not_nil! - 1\n", "Python": "n, l = map(int,input().split())\nk = int(input())\na = list(map(int,input().split()))\na.append(l)\ndif = [a[0]] # 切り口の差を計算\nfor i in range(n):\n dif.append(a[i + 1] - a[i])\n\ndef is_ok(x):\n length = 0\n cnt = 0\n for i in dif:\n length += i\n if length >= x:\n length = 0\n cnt += 1\n return cnt # 分割する領域の個数\n\ndef meguru_bisect(ng, ok):\n while ng - ok > 1:\n mid = (ng + ok) // 2\n if is_ok(mid) >= k + 1: # まだまだ大きくできる\n ok = mid\n else:\n ng = mid # 小さくしなければいけない\n return ok\n\nprint(meguru_bisect(l + 1, -1))" }, { "id": 7, "name": "001", "Crystal": "_, l = read_line.split.map(&.to_i)\nk = read_line.to_i\na = read_line.split.map(&.to_i) + [l]\nputs (1..10**9).bsearch { |len|\n last, cnt = 0, 0\n a.each do |i|\n if i - last >= len\n cnt += 1\n last = i\n end\n end\n cnt < k + 1\n}.not_nil! - 1\n", "Go": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar sc = bufio.NewScanner(os.Stdin)\n\nfunc main() {\n\tbuf := make([]byte, 1024*1024)\n\tsc.Buffer(buf, bufio.MaxScanTokenSize)\n\tsc.Split(bufio.ScanWords)\n\n\tn, l := ScanInt(), ScanInt()\n\tk := ScanInt()\n\ta := ScanIntSlice(n)\n\n\tok, ng := 0, l\n\n\tcheck := func(x int) bool {\n\t\tpreAi := 0\n\t\tcnt := 0\n\t\tfor i := 0; i < n; i++ {\n\t\t\tif a[i]-preAi >= x && l-a[i] >= x {\n\t\t\t\tcnt++\n\t\t\t\tpreAi = a[i]\n\t\t\t}\n\t\t}\n\t\treturn cnt >= k\n\t}\n\n\tfor ng-ok > 1 {\n\t\tc := (ng + ok) / 2\n\t\tif check(c) {\n\t\t\tok = c\n\t\t} else {\n\t\t\tng = c\n\t\t}\n\t}\n\tfmt.Println(ok)\n}\n\nfunc ScanInt() int {\n\tsc.Scan()\n\ti, err := strconv.Atoi(sc.Text())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn i\n}\n\nfunc ScanIntSlice(n int) []int {\n\ts := make([]int, n)\n\tfor i := range s {\n\t\ts[i] = ScanInt()\n\t}\n\treturn s\n}\n" }, { "id": 8, "name": "001", "Crystal": "_, l = read_line.split.map(&.to_i)\nk = read_line.to_i\na = read_line.split.map(&.to_i) + [l]\nputs (1..10**9).bsearch { |len|\n last, cnt = 0, 0\n a.each do |i|\n if i - last >= len\n cnt += 1\n last = i\n end\n end\n cnt < k + 1\n}.not_nil! - 1\n", "Rust": "fn main() {\n proconio::input! {\n n: isize,\n l: isize,\n k: isize,\n mut a: [isize; n]\n }\n a.sort();\n let mut ok = 0;\n let mut ng = l + 1;\n while (ng - ok).abs() > 1 {\n let mid = (ok + ng) / 2;\n if is_ok(&a, l, k, mid) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n println!(\"{}\", ok);\n}\n\nfn is_ok(a: &Vec, l: isize, k: isize, mid: isize) -> bool {\n let mut x = 0;\n let mut y = 0;\n for i in a {\n if i - x >= mid && l - i >= mid {\n x = *i;\n y += 1;\n }\n }\n y >= k\n}\n" }, { "id": 9, "name": "001", "Crystal": "_, l = read_line.split.map(&.to_i)\nk = read_line.to_i\na = read_line.split.map(&.to_i) + [l]\nputs (1..10**9).bsearch { |len|\n last, cnt = 0, 0\n a.each do |i|\n if i - last >= len\n cnt += 1\n last = i\n end\n end\n cnt < k + 1\n}.not_nil! - 1\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a[n] :: l\n\t\n\tvar ok: int :: 0\n\tvar ng: int :: l + 1\n\twhile((ok - ng).abs() > 1)\n\t\tvar mid: int :: (ok + ng) / 2\n\t\tvar prev: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n)\n\t\t\tif(a[i] - prev >= mid)\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo prev :: a[i]\n\t\t\tend if\n\t\tend for\n\t\t\n\t\tvar isOk: bool :: cnt >= k + 1\n\t\tif(isOk)\n\t\t\tdo ok :: mid\n\t\telse\n\t\t\tdo ng :: mid\n\t\tend if\n\tend while\n\t\n\tvar ans: int :: ok\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 10, "name": "001", "Python": "n, l = map(int,input().split())\nk = int(input())\na = list(map(int,input().split()))\na.append(l)\ndif = [a[0]] # 切り口の差を計算\nfor i in range(n):\n dif.append(a[i + 1] - a[i])\n\ndef is_ok(x):\n length = 0\n cnt = 0\n for i in dif:\n length += i\n if length >= x:\n length = 0\n cnt += 1\n return cnt # 分割する領域の個数\n\ndef meguru_bisect(ng, ok):\n while ng - ok > 1:\n mid = (ng + ok) // 2\n if is_ok(mid) >= k + 1: # まだまだ大きくできる\n ok = mid\n else:\n ng = mid # 小さくしなければいけない\n return ok\n\nprint(meguru_bisect(l + 1, -1))", "Go": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar sc = bufio.NewScanner(os.Stdin)\n\nfunc main() {\n\tbuf := make([]byte, 1024*1024)\n\tsc.Buffer(buf, bufio.MaxScanTokenSize)\n\tsc.Split(bufio.ScanWords)\n\n\tn, l := ScanInt(), ScanInt()\n\tk := ScanInt()\n\ta := ScanIntSlice(n)\n\n\tok, ng := 0, l\n\n\tcheck := func(x int) bool {\n\t\tpreAi := 0\n\t\tcnt := 0\n\t\tfor i := 0; i < n; i++ {\n\t\t\tif a[i]-preAi >= x && l-a[i] >= x {\n\t\t\t\tcnt++\n\t\t\t\tpreAi = a[i]\n\t\t\t}\n\t\t}\n\t\treturn cnt >= k\n\t}\n\n\tfor ng-ok > 1 {\n\t\tc := (ng + ok) / 2\n\t\tif check(c) {\n\t\t\tok = c\n\t\t} else {\n\t\t\tng = c\n\t\t}\n\t}\n\tfmt.Println(ok)\n}\n\nfunc ScanInt() int {\n\tsc.Scan()\n\ti, err := strconv.Atoi(sc.Text())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn i\n}\n\nfunc ScanIntSlice(n int) []int {\n\ts := make([]int, n)\n\tfor i := range s {\n\t\ts[i] = ScanInt()\n\t}\n\treturn s\n}\n" }, { "id": 11, "name": "001", "Python": "n, l = map(int,input().split())\nk = int(input())\na = list(map(int,input().split()))\na.append(l)\ndif = [a[0]] # 切り口の差を計算\nfor i in range(n):\n dif.append(a[i + 1] - a[i])\n\ndef is_ok(x):\n length = 0\n cnt = 0\n for i in dif:\n length += i\n if length >= x:\n length = 0\n cnt += 1\n return cnt # 分割する領域の個数\n\ndef meguru_bisect(ng, ok):\n while ng - ok > 1:\n mid = (ng + ok) // 2\n if is_ok(mid) >= k + 1: # まだまだ大きくできる\n ok = mid\n else:\n ng = mid # 小さくしなければいけない\n return ok\n\nprint(meguru_bisect(l + 1, -1))", "Rust": "fn main() {\n proconio::input! {\n n: isize,\n l: isize,\n k: isize,\n mut a: [isize; n]\n }\n a.sort();\n let mut ok = 0;\n let mut ng = l + 1;\n while (ng - ok).abs() > 1 {\n let mid = (ok + ng) / 2;\n if is_ok(&a, l, k, mid) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n println!(\"{}\", ok);\n}\n\nfn is_ok(a: &Vec, l: isize, k: isize, mid: isize) -> bool {\n let mut x = 0;\n let mut y = 0;\n for i in a {\n if i - x >= mid && l - i >= mid {\n x = *i;\n y += 1;\n }\n }\n y >= k\n}\n" }, { "id": 12, "name": "001", "Python": "n, l = map(int,input().split())\nk = int(input())\na = list(map(int,input().split()))\na.append(l)\ndif = [a[0]] # 切り口の差を計算\nfor i in range(n):\n dif.append(a[i + 1] - a[i])\n\ndef is_ok(x):\n length = 0\n cnt = 0\n for i in dif:\n length += i\n if length >= x:\n length = 0\n cnt += 1\n return cnt # 分割する領域の個数\n\ndef meguru_bisect(ng, ok):\n while ng - ok > 1:\n mid = (ng + ok) // 2\n if is_ok(mid) >= k + 1: # まだまだ大きくできる\n ok = mid\n else:\n ng = mid # 小さくしなければいけない\n return ok\n\nprint(meguru_bisect(l + 1, -1))", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a[n] :: l\n\t\n\tvar ok: int :: 0\n\tvar ng: int :: l + 1\n\twhile((ok - ng).abs() > 1)\n\t\tvar mid: int :: (ok + ng) / 2\n\t\tvar prev: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n)\n\t\t\tif(a[i] - prev >= mid)\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo prev :: a[i]\n\t\t\tend if\n\t\tend for\n\t\t\n\t\tvar isOk: bool :: cnt >= k + 1\n\t\tif(isOk)\n\t\t\tdo ok :: mid\n\t\telse\n\t\t\tdo ng :: mid\n\t\tend if\n\tend while\n\t\n\tvar ans: int :: ok\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 13, "name": "001", "Go": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar sc = bufio.NewScanner(os.Stdin)\n\nfunc main() {\n\tbuf := make([]byte, 1024*1024)\n\tsc.Buffer(buf, bufio.MaxScanTokenSize)\n\tsc.Split(bufio.ScanWords)\n\n\tn, l := ScanInt(), ScanInt()\n\tk := ScanInt()\n\ta := ScanIntSlice(n)\n\n\tok, ng := 0, l\n\n\tcheck := func(x int) bool {\n\t\tpreAi := 0\n\t\tcnt := 0\n\t\tfor i := 0; i < n; i++ {\n\t\t\tif a[i]-preAi >= x && l-a[i] >= x {\n\t\t\t\tcnt++\n\t\t\t\tpreAi = a[i]\n\t\t\t}\n\t\t}\n\t\treturn cnt >= k\n\t}\n\n\tfor ng-ok > 1 {\n\t\tc := (ng + ok) / 2\n\t\tif check(c) {\n\t\t\tok = c\n\t\t} else {\n\t\t\tng = c\n\t\t}\n\t}\n\tfmt.Println(ok)\n}\n\nfunc ScanInt() int {\n\tsc.Scan()\n\ti, err := strconv.Atoi(sc.Text())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn i\n}\n\nfunc ScanIntSlice(n int) []int {\n\ts := make([]int, n)\n\tfor i := range s {\n\t\ts[i] = ScanInt()\n\t}\n\treturn s\n}\n", "Rust": "fn main() {\n proconio::input! {\n n: isize,\n l: isize,\n k: isize,\n mut a: [isize; n]\n }\n a.sort();\n let mut ok = 0;\n let mut ng = l + 1;\n while (ng - ok).abs() > 1 {\n let mid = (ok + ng) / 2;\n if is_ok(&a, l, k, mid) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n println!(\"{}\", ok);\n}\n\nfn is_ok(a: &Vec, l: isize, k: isize, mid: isize) -> bool {\n let mut x = 0;\n let mut y = 0;\n for i in a {\n if i - x >= mid && l - i >= mid {\n x = *i;\n y += 1;\n }\n }\n y >= k\n}\n" }, { "id": 14, "name": "001", "Go": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar sc = bufio.NewScanner(os.Stdin)\n\nfunc main() {\n\tbuf := make([]byte, 1024*1024)\n\tsc.Buffer(buf, bufio.MaxScanTokenSize)\n\tsc.Split(bufio.ScanWords)\n\n\tn, l := ScanInt(), ScanInt()\n\tk := ScanInt()\n\ta := ScanIntSlice(n)\n\n\tok, ng := 0, l\n\n\tcheck := func(x int) bool {\n\t\tpreAi := 0\n\t\tcnt := 0\n\t\tfor i := 0; i < n; i++ {\n\t\t\tif a[i]-preAi >= x && l-a[i] >= x {\n\t\t\t\tcnt++\n\t\t\t\tpreAi = a[i]\n\t\t\t}\n\t\t}\n\t\treturn cnt >= k\n\t}\n\n\tfor ng-ok > 1 {\n\t\tc := (ng + ok) / 2\n\t\tif check(c) {\n\t\t\tok = c\n\t\t} else {\n\t\t\tng = c\n\t\t}\n\t}\n\tfmt.Println(ok)\n}\n\nfunc ScanInt() int {\n\tsc.Scan()\n\ti, err := strconv.Atoi(sc.Text())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn i\n}\n\nfunc ScanIntSlice(n int) []int {\n\ts := make([]int, n)\n\tfor i := range s {\n\t\ts[i] = ScanInt()\n\t}\n\treturn s\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a[n] :: l\n\t\n\tvar ok: int :: 0\n\tvar ng: int :: l + 1\n\twhile((ok - ng).abs() > 1)\n\t\tvar mid: int :: (ok + ng) / 2\n\t\tvar prev: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n)\n\t\t\tif(a[i] - prev >= mid)\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo prev :: a[i]\n\t\t\tend if\n\t\tend for\n\t\t\n\t\tvar isOk: bool :: cnt >= k + 1\n\t\tif(isOk)\n\t\t\tdo ok :: mid\n\t\telse\n\t\t\tdo ng :: mid\n\t\tend if\n\tend while\n\t\n\tvar ans: int :: ok\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 15, "name": "001", "Rust": "fn main() {\n proconio::input! {\n n: isize,\n l: isize,\n k: isize,\n mut a: [isize; n]\n }\n a.sort();\n let mut ok = 0;\n let mut ng = l + 1;\n while (ng - ok).abs() > 1 {\n let mid = (ok + ng) / 2;\n if is_ok(&a, l, k, mid) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n println!(\"{}\", ok);\n}\n\nfn is_ok(a: &Vec, l: isize, k: isize, mid: isize) -> bool {\n let mut x = 0;\n let mut y = 0;\n for i in a {\n if i - x >= mid && l - i >= mid {\n x = *i;\n y += 1;\n }\n }\n y >= k\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a[n] :: l\n\t\n\tvar ok: int :: 0\n\tvar ng: int :: l + 1\n\twhile((ok - ng).abs() > 1)\n\t\tvar mid: int :: (ok + ng) / 2\n\t\tvar prev: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n)\n\t\t\tif(a[i] - prev >= mid)\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo prev :: a[i]\n\t\t\tend if\n\t\tend for\n\t\t\n\t\tvar isOk: bool :: cnt >= k + 1\n\t\tif(isOk)\n\t\t\tdo ok :: mid\n\t\telse\n\t\t\tdo ng :: mid\n\t\tend if\n\tend while\n\t\n\tvar ans: int :: ok\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 16, "name": "002", "C++": "// this problem was so fun :)\n\n#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n);\n#define mp(a, b) make_pair(a, b);\nusing ll = long long;\nusing ld = long double;\n\nint n;\nint l = 0, r = 0;\nvector anslist;\n\n/*\n if X is correct brackets string then:\n (define length of X = L)\n * L is even number\n * from 1st to nth chars,\n * the count of \"(\" is greater than or equal to the count of \")\" (1 ~ n ~ L - 1)\n * the total count of \"(\" is equal to the total count of \")\" is equal to L / 2\n*/\nvoid dfs(string s){\n if(s.length() == n){\n // should consist l = r = n / 2\n anslist.emplace_back(s);\n return;\n }else{\n if(r < n / 2){\n r++;\n dfs(s + \"(\");\n r--;\n }\n if(l < n / 2 && r > l){\n l++;\n dfs(s + \")\");\n l--;\n }\n }\n}\n\nint main(){\n // amount of \"(\" is equal to amount of \")\" is equal to n / 2\n cin >> n;\n if(n % 2) cout << endl;\n else{\n // generate from 2nd char by dfs\n r = 1;\n dfs(\"(\");\n }\n // sort by lexical order ('(' < ')')\n sort(anslist.begin(), anslist.end());\n for(auto itr = anslist.begin(); itr != anslist.end(); itr++){\n cout << *itr << endl;\n }\n}", "Crystal": "n = read_line.to_i\n['(', ')'].each_repeated_permutation(n, true) { |s|\n a = s.reduce([0]) { |acc, c|\n acc << acc[-1] + (c == '(' ? 1 : -1)\n }\n if a[-1] == 0 && a.all? { |i| i >= 0 }\n puts s.join\n end\n}\n" }, { "id": 17, "name": "002", "C++": "// this problem was so fun :)\n\n#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n);\n#define mp(a, b) make_pair(a, b);\nusing ll = long long;\nusing ld = long double;\n\nint n;\nint l = 0, r = 0;\nvector anslist;\n\n/*\n if X is correct brackets string then:\n (define length of X = L)\n * L is even number\n * from 1st to nth chars,\n * the count of \"(\" is greater than or equal to the count of \")\" (1 ~ n ~ L - 1)\n * the total count of \"(\" is equal to the total count of \")\" is equal to L / 2\n*/\nvoid dfs(string s){\n if(s.length() == n){\n // should consist l = r = n / 2\n anslist.emplace_back(s);\n return;\n }else{\n if(r < n / 2){\n r++;\n dfs(s + \"(\");\n r--;\n }\n if(l < n / 2 && r > l){\n l++;\n dfs(s + \")\");\n l--;\n }\n }\n}\n\nint main(){\n // amount of \"(\" is equal to amount of \")\" is equal to n / 2\n cin >> n;\n if(n % 2) cout << endl;\n else{\n // generate from 2nd char by dfs\n r = 1;\n dfs(\"(\");\n }\n // sort by lexical order ('(' < ')')\n sort(anslist.begin(), anslist.end());\n for(auto itr = anslist.begin(); itr != anslist.end(); itr++){\n cout << *itr << endl;\n }\n}", "Python": "from itertools import product\nn = int(input())\nans = []\n\nif n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない\n for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）\n if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める\n zero_count = 0\n Bool = True\n word = \"\"\n for j in range(len(i)):\n if i[j] == 0:\n zero_count += 1\n elif i[j] == 1:\n if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない\n zero_count -= 1\n else:\n Bool = False\n word += str(i[j])\n if Bool:\n x = word.replace(\"0\", \"(\")\n y = x.replace(\"1\", \")\")\n ans.append(y)\nans.sort()\nprint(*ans ,sep = \"\\n\")" }, { "id": 18, "name": "002", "C++": "// this problem was so fun :)\n\n#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n);\n#define mp(a, b) make_pair(a, b);\nusing ll = long long;\nusing ld = long double;\n\nint n;\nint l = 0, r = 0;\nvector anslist;\n\n/*\n if X is correct brackets string then:\n (define length of X = L)\n * L is even number\n * from 1st to nth chars,\n * the count of \"(\" is greater than or equal to the count of \")\" (1 ~ n ~ L - 1)\n * the total count of \"(\" is equal to the total count of \")\" is equal to L / 2\n*/\nvoid dfs(string s){\n if(s.length() == n){\n // should consist l = r = n / 2\n anslist.emplace_back(s);\n return;\n }else{\n if(r < n / 2){\n r++;\n dfs(s + \"(\");\n r--;\n }\n if(l < n / 2 && r > l){\n l++;\n dfs(s + \")\");\n l--;\n }\n }\n}\n\nint main(){\n // amount of \"(\" is equal to amount of \")\" is equal to n / 2\n cin >> n;\n if(n % 2) cout << endl;\n else{\n // generate from 2nd char by dfs\n r = 1;\n dfs(\"(\");\n }\n // sort by lexical order ('(' < ')')\n sort(anslist.begin(), anslist.end());\n for(auto itr = anslist.begin(); itr != anslist.end(); itr++){\n cout << *itr << endl;\n }\n}", "Ruby": "def solve(s, n, depth)\n if n == 0 then\n puts s\n else\n solve(s + '(', n - 1, depth + 1) if depth < n\n solve(s + ')', n - 1, depth - 1) if depth > 0\n end\nend\n\nn = readline.to_i\nsolve('', n , 0) if n % 2 == 0\n" }, { "id": 19, "name": "002", "C++": "// this problem was so fun :)\n\n#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n);\n#define mp(a, b) make_pair(a, b);\nusing ll = long long;\nusing ld = long double;\n\nint n;\nint l = 0, r = 0;\nvector anslist;\n\n/*\n if X is correct brackets string then:\n (define length of X = L)\n * L is even number\n * from 1st to nth chars,\n * the count of \"(\" is greater than or equal to the count of \")\" (1 ~ n ~ L - 1)\n * the total count of \"(\" is equal to the total count of \")\" is equal to L / 2\n*/\nvoid dfs(string s){\n if(s.length() == n){\n // should consist l = r = n / 2\n anslist.emplace_back(s);\n return;\n }else{\n if(r < n / 2){\n r++;\n dfs(s + \"(\");\n r--;\n }\n if(l < n / 2 && r > l){\n l++;\n dfs(s + \")\");\n l--;\n }\n }\n}\n\nint main(){\n // amount of \"(\" is equal to amount of \")\" is equal to n / 2\n cin >> n;\n if(n % 2) cout << endl;\n else{\n // generate from 2nd char by dfs\n r = 1;\n dfs(\"(\");\n }\n // sort by lexical order ('(' < ')')\n sort(anslist.begin(), anslist.end());\n for(auto itr = anslist.begin(); itr != anslist.end(); itr++){\n cout << *itr << endl;\n }\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tif(n % 2 <> 0)\n\t\tdo cui@print(\"\\n\")\n\t\tret\n\tend if\n\t\n\tfor i(0, 2 ^ n - 1)\n\t\tvar id: int :: i\n\t\tvar cntOpen: int :: 0\n\t\tvar cntClose: int :: 0\n\t\tvar a: []bool :: #[n]bool\n\t\tfor j(0, n - 1)\n\t\t\tdo a[j] :: id % 2 = 1\n\t\t\tif(a[j])\n\t\t\t\tdo cntOpen :+ 1\n\t\t\t\tif(cntOpen > n / 2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo cntClose :+ 1\n\t\t\t\tif(cntClose > cntOpen)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\tend if\n\t\t\tdo id :/ 2\n\t\tend for\n\t\tfor j(n - 1, 0, -1)\n\t\t\tdo cui@print(a[j] ?(\")\", \"(\"))\n\t\tend for\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 20, "name": "002", "Crystal": "n = read_line.to_i\n['(', ')'].each_repeated_permutation(n, true) { |s|\n a = s.reduce([0]) { |acc, c|\n acc << acc[-1] + (c == '(' ? 1 : -1)\n }\n if a[-1] == 0 && a.all? { |i| i >= 0 }\n puts s.join\n end\n}\n", "Python": "from itertools import product\nn = int(input())\nans = []\n\nif n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない\n for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）\n if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める\n zero_count = 0\n Bool = True\n word = \"\"\n for j in range(len(i)):\n if i[j] == 0:\n zero_count += 1\n elif i[j] == 1:\n if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない\n zero_count -= 1\n else:\n Bool = False\n word += str(i[j])\n if Bool:\n x = word.replace(\"0\", \"(\")\n y = x.replace(\"1\", \")\")\n ans.append(y)\nans.sort()\nprint(*ans ,sep = \"\\n\")" }, { "id": 21, "name": "002", "Crystal": "n = read_line.to_i\n['(', ')'].each_repeated_permutation(n, true) { |s|\n a = s.reduce([0]) { |acc, c|\n acc << acc[-1] + (c == '(' ? 1 : -1)\n }\n if a[-1] == 0 && a.all? { |i| i >= 0 }\n puts s.join\n end\n}\n", "Ruby": "def solve(s, n, depth)\n if n == 0 then\n puts s\n else\n solve(s + '(', n - 1, depth + 1) if depth < n\n solve(s + ')', n - 1, depth - 1) if depth > 0\n end\nend\n\nn = readline.to_i\nsolve('', n , 0) if n % 2 == 0\n" }, { "id": 22, "name": "002", "Crystal": "n = read_line.to_i\n['(', ')'].each_repeated_permutation(n, true) { |s|\n a = s.reduce([0]) { |acc, c|\n acc << acc[-1] + (c == '(' ? 1 : -1)\n }\n if a[-1] == 0 && a.all? { |i| i >= 0 }\n puts s.join\n end\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tif(n % 2 <> 0)\n\t\tdo cui@print(\"\\n\")\n\t\tret\n\tend if\n\t\n\tfor i(0, 2 ^ n - 1)\n\t\tvar id: int :: i\n\t\tvar cntOpen: int :: 0\n\t\tvar cntClose: int :: 0\n\t\tvar a: []bool :: #[n]bool\n\t\tfor j(0, n - 1)\n\t\t\tdo a[j] :: id % 2 = 1\n\t\t\tif(a[j])\n\t\t\t\tdo cntOpen :+ 1\n\t\t\t\tif(cntOpen > n / 2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo cntClose :+ 1\n\t\t\t\tif(cntClose > cntOpen)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\tend if\n\t\t\tdo id :/ 2\n\t\tend for\n\t\tfor j(n - 1, 0, -1)\n\t\t\tdo cui@print(a[j] ?(\")\", \"(\"))\n\t\tend for\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 23, "name": "002", "Python": "from itertools import product\nn = int(input())\nans = []\n\nif n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない\n for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）\n if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める\n zero_count = 0\n Bool = True\n word = \"\"\n for j in range(len(i)):\n if i[j] == 0:\n zero_count += 1\n elif i[j] == 1:\n if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない\n zero_count -= 1\n else:\n Bool = False\n word += str(i[j])\n if Bool:\n x = word.replace(\"0\", \"(\")\n y = x.replace(\"1\", \")\")\n ans.append(y)\nans.sort()\nprint(*ans ,sep = \"\\n\")", "Ruby": "def solve(s, n, depth)\n if n == 0 then\n puts s\n else\n solve(s + '(', n - 1, depth + 1) if depth < n\n solve(s + ')', n - 1, depth - 1) if depth > 0\n end\nend\n\nn = readline.to_i\nsolve('', n , 0) if n % 2 == 0\n" }, { "id": 24, "name": "002", "Python": "from itertools import product\nn = int(input())\nans = []\n\nif n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない\n for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）\n if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める\n zero_count = 0\n Bool = True\n word = \"\"\n for j in range(len(i)):\n if i[j] == 0:\n zero_count += 1\n elif i[j] == 1:\n if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない\n zero_count -= 1\n else:\n Bool = False\n word += str(i[j])\n if Bool:\n x = word.replace(\"0\", \"(\")\n y = x.replace(\"1\", \")\")\n ans.append(y)\nans.sort()\nprint(*ans ,sep = \"\\n\")", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tif(n % 2 <> 0)\n\t\tdo cui@print(\"\\n\")\n\t\tret\n\tend if\n\t\n\tfor i(0, 2 ^ n - 1)\n\t\tvar id: int :: i\n\t\tvar cntOpen: int :: 0\n\t\tvar cntClose: int :: 0\n\t\tvar a: []bool :: #[n]bool\n\t\tfor j(0, n - 1)\n\t\t\tdo a[j] :: id % 2 = 1\n\t\t\tif(a[j])\n\t\t\t\tdo cntOpen :+ 1\n\t\t\t\tif(cntOpen > n / 2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo cntClose :+ 1\n\t\t\t\tif(cntClose > cntOpen)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\tend if\n\t\t\tdo id :/ 2\n\t\tend for\n\t\tfor j(n - 1, 0, -1)\n\t\t\tdo cui@print(a[j] ?(\")\", \"(\"))\n\t\tend for\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 25, "name": "002", "Ruby": "def solve(s, n, depth)\n if n == 0 then\n puts s\n else\n solve(s + '(', n - 1, depth + 1) if depth < n\n solve(s + ')', n - 1, depth - 1) if depth > 0\n end\nend\n\nn = readline.to_i\nsolve('', n , 0) if n % 2 == 0\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tif(n % 2 <> 0)\n\t\tdo cui@print(\"\\n\")\n\t\tret\n\tend if\n\t\n\tfor i(0, 2 ^ n - 1)\n\t\tvar id: int :: i\n\t\tvar cntOpen: int :: 0\n\t\tvar cntClose: int :: 0\n\t\tvar a: []bool :: #[n]bool\n\t\tfor j(0, n - 1)\n\t\t\tdo a[j] :: id % 2 = 1\n\t\t\tif(a[j])\n\t\t\t\tdo cntOpen :+ 1\n\t\t\t\tif(cntOpen > n / 2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo cntClose :+ 1\n\t\t\t\tif(cntClose > cntOpen)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\tend if\n\t\t\tdo id :/ 2\n\t\tend for\n\t\tfor j(n - 1, 0, -1)\n\t\t\tdo cui@print(a[j] ?(\")\", \"(\"))\n\t\tend for\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 26, "name": "003", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// グラフ\n\nconst int INF = (1 << 29);\n\nvector G[1 << 18];\n\nint dist[1 << 18];\n\n\n\nvoid getdist(int start) {\n\n\t// 幅優先探索（BFS）により、最短距離を計算\n\n\tfor (int i = 1; i <= N; i++) dist[i] = INF;\n\n\n\n\tqueue Q;\n\n\tQ.push(start);\n\n\tdist[start] = 0;\n\n\n\n\twhile (!Q.empty()) {\n\n\t\tint pos = Q.front(); Q.pop();\n\n\t\tfor (int to : G[pos]) {\n\n\t\t\tif (dist[to] == INF) {\n\n\t\t\t\tdist[to] = dist[pos] + 1;\n\n\t\t\t\tQ.push(to);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. 頂点 1 からの最短距離を求める\n\n\t// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点\n\n\tgetdist(1);\n\n\tint maxn1 = -1, maxid1 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (maxn1 < dist[i]) {\n\n\t\t\tmaxn1 = dist[i];\n\n\t\t\tmaxid1 = i;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. 頂点 maxid1 からの最短距離を求める\n\n\t// maxn2: 木の直径（最短距離の最大値）\n\n\tgetdist(maxid1);\n\n\tint maxn2 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tmaxn2 = max(maxn2, dist[i]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tcout << maxn2 + 1 << endl;\n\n\treturn 0;\n\n}", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))\n a[v] = dist\n self[v].each do |u|\n tree_depth_dfs(u, v, dist + 1, a) if u != p\n end\n end\n\n def tree_depth(root : Int32)\n a = Array.new(size, 0)\n tree_depth_dfs(root, -1, 0, a)\n a\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\n_, v = graph.tree_depth(0).each_with_index.max\ndist, _ = graph.tree_depth(v).each_with_index.max\nputs dist + 1\n" }, { "id": 27, "name": "003", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// グラフ\n\nconst int INF = (1 << 29);\n\nvector G[1 << 18];\n\nint dist[1 << 18];\n\n\n\nvoid getdist(int start) {\n\n\t// 幅優先探索（BFS）により、最短距離を計算\n\n\tfor (int i = 1; i <= N; i++) dist[i] = INF;\n\n\n\n\tqueue Q;\n\n\tQ.push(start);\n\n\tdist[start] = 0;\n\n\n\n\twhile (!Q.empty()) {\n\n\t\tint pos = Q.front(); Q.pop();\n\n\t\tfor (int to : G[pos]) {\n\n\t\t\tif (dist[to] == INF) {\n\n\t\t\t\tdist[to] = dist[pos] + 1;\n\n\t\t\t\tQ.push(to);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. 頂点 1 からの最短距離を求める\n\n\t// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点\n\n\tgetdist(1);\n\n\tint maxn1 = -1, maxid1 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (maxn1 < dist[i]) {\n\n\t\t\tmaxn1 = dist[i];\n\n\t\t\tmaxid1 = i;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. 頂点 maxid1 からの最短距離を求める\n\n\t// maxn2: 木の直径（最短距離の最大値）\n\n\tgetdist(maxid1);\n\n\tint maxn2 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tmaxn2 = max(maxn2, dist[i]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tcout << maxn2 + 1 << endl;\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nsys.setrecursionlimit(10**6)\nN = int(input())\nG = [[] for _ in range(N)]\nfor _ in range(N - 1):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n G[a].append(b)\n G[b].append(a)\n\ndef dfs(s):\n D = [-1] * N\n D[s] = 0\n stk = [s]\n push, pop = stk.append, stk.pop\n while stk:\n v = pop()\n nd = D[v] + 1\n for nv in G[v]:\n if D[nv] >= 0: continue\n D[nv] = nd\n push(nv)\n return D\n\nD0 = dfs(0)\nmxi = max(enumerate(D0), key=lambda x: x[1])[0]\nDmx = dfs(mxi)\nprint(max(Dmx) + 1)\n" }, { "id": 28, "name": "003", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// グラフ\n\nconst int INF = (1 << 29);\n\nvector G[1 << 18];\n\nint dist[1 << 18];\n\n\n\nvoid getdist(int start) {\n\n\t// 幅優先探索（BFS）により、最短距離を計算\n\n\tfor (int i = 1; i <= N; i++) dist[i] = INF;\n\n\n\n\tqueue Q;\n\n\tQ.push(start);\n\n\tdist[start] = 0;\n\n\n\n\twhile (!Q.empty()) {\n\n\t\tint pos = Q.front(); Q.pop();\n\n\t\tfor (int to : G[pos]) {\n\n\t\t\tif (dist[to] == INF) {\n\n\t\t\t\tdist[to] = dist[pos] + 1;\n\n\t\t\t\tQ.push(to);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. 頂点 1 からの最短距離を求める\n\n\t// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点\n\n\tgetdist(1);\n\n\tint maxn1 = -1, maxid1 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (maxn1 < dist[i]) {\n\n\t\t\tmaxn1 = dist[i];\n\n\t\t\tmaxid1 = i;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. 頂点 maxid1 からの最短距離を求める\n\n\t// maxn2: 木の直径（最短距離の最大値）\n\n\tgetdist(maxid1);\n\n\tint maxn2 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tmaxn2 = max(maxn2, dist[i]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tcout << maxn2 + 1 << endl;\n\n\treturn 0;\n\n}", "Ruby": "def solve(graph, curr, prev)\n max_depth = 0\n max_score = 0\n\n for node in graph[curr]\n next if node == prev\n\n depth, score = solve(graph, node, curr)\n max_score = [max_score, score, depth + max_depth].max\n max_depth = [max_depth, depth].max\n end\n\n [max_depth + 1, max_score]\nend\n\nn = readline.to_i\n\ngraph = Array.new(n + 1) { [] }\n(n - 1).times do\n a_i, b_i = readline.split.map(&:to_i)\n graph[a_i].push(b_i)\n graph[b_i].push(a_i)\nend\n\nputs solve(graph, 1, nil)[1] + 1\n" }, { "id": 29, "name": "003", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// グラフ\n\nconst int INF = (1 << 29);\n\nvector G[1 << 18];\n\nint dist[1 << 18];\n\n\n\nvoid getdist(int start) {\n\n\t// 幅優先探索（BFS）により、最短距離を計算\n\n\tfor (int i = 1; i <= N; i++) dist[i] = INF;\n\n\n\n\tqueue Q;\n\n\tQ.push(start);\n\n\tdist[start] = 0;\n\n\n\n\twhile (!Q.empty()) {\n\n\t\tint pos = Q.front(); Q.pop();\n\n\t\tfor (int to : G[pos]) {\n\n\t\t\tif (dist[to] == INF) {\n\n\t\t\t\tdist[to] = dist[pos] + 1;\n\n\t\t\t\tQ.push(to);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. 頂点 1 からの最短距離を求める\n\n\t// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点\n\n\tgetdist(1);\n\n\tint maxn1 = -1, maxid1 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (maxn1 < dist[i]) {\n\n\t\t\tmaxn1 = dist[i];\n\n\t\t\tmaxid1 = i;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. 頂点 maxid1 からの最短距離を求める\n\n\t// maxn2: 木の直径（最短距離の最大値）\n\n\tgetdist(maxid1);\n\n\tint maxn2 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tmaxn2 = max(maxn2, dist[i]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tcout << maxn2 + 1 << endl;\n\n\treturn 0;\n\n}", "Rust": "use proconio::{input,marker::Usize1};\nuse std::collections::VecDeque;\n\nfn main(){\n input!{n:usize}\n let mut g=vec![vec![];n];\n for _ in 1..n{\n input!{x:Usize1,y:Usize1}\n g[x].push(y);\n g[y].push(x);\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,0usize);\n let mut u:usize=0;\n let m=d.iter().max().unwrap();\n for i in 0..n{\n if &d[i]==m {u=i}\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,u);\n println!(\"{}\",1+d.iter().max().unwrap());\n}\n\nfn bfs(g:&Vec>,d:&mut Vec,s:usize){\n let mut q:VecDeque=VecDeque::new();\n d[s]=0;\n q.push_back(s);\n while q.len()>0{\n let i=q.pop_front().unwrap();\n for j in g[i].iter(){\n if d[*j]==1<<30{\n q.push_back(*j);\n d[*j]=d[i]+1;\n }\n }\n } \n}" }, { "id": 30, "name": "003", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// グラフ\n\nconst int INF = (1 << 29);\n\nvector G[1 << 18];\n\nint dist[1 << 18];\n\n\n\nvoid getdist(int start) {\n\n\t// 幅優先探索（BFS）により、最短距離を計算\n\n\tfor (int i = 1; i <= N; i++) dist[i] = INF;\n\n\n\n\tqueue Q;\n\n\tQ.push(start);\n\n\tdist[start] = 0;\n\n\n\n\twhile (!Q.empty()) {\n\n\t\tint pos = Q.front(); Q.pop();\n\n\t\tfor (int to : G[pos]) {\n\n\t\t\tif (dist[to] == INF) {\n\n\t\t\t\tdist[to] = dist[pos] + 1;\n\n\t\t\t\tQ.push(to);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. 頂点 1 からの最短距離を求める\n\n\t// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点\n\n\tgetdist(1);\n\n\tint maxn1 = -1, maxid1 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (maxn1 < dist[i]) {\n\n\t\t\tmaxn1 = dist[i];\n\n\t\t\tmaxid1 = i;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. 頂点 maxid1 からの最短距離を求める\n\n\t// maxn2: 木の直径（最短距離の最大値）\n\n\tgetdist(maxid1);\n\n\tint maxn2 = -1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tmaxn2 = max(maxn2, dist[i]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tcout << maxn2 + 1 << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar ans: int :: treeDiameter(graph) + 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc treeDiameter(graph: []list): int\n\t\tvar pos: int :: 0\n\t\tdo treeDiameterSub(graph, &pos, -1)\n\t\tret treeDiameterSub(graph, &pos, -1)\n\t\t\n\t\tfunc treeDiameterSub(graph: []list, pos: &int, p: int): int\n\t\t\tvar u: int :: pos\n\t\t\tvar res: int :: 0\n\t\t\tdo graph[u].head()\n\t\t\twhile(!graph[u].term())\n\t\t\t\tvar x: int :: graph[u].get()\n\t\t\t\tif(x <> p)\n\t\t\t\t\tvar dist: int :: treeDiameterSub(graph, &x, u) + 1\n\t\t\t\t\tif(dist > res)\n\t\t\t\t\t\tdo res :: dist\n\t\t\t\t\t\tdo pos :: x\n\t\t\t\t\tend if\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend while\n\t\t\tret res\n\t\tend func\n\tend func\nend func\n" }, { "id": 31, "name": "003", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))\n a[v] = dist\n self[v].each do |u|\n tree_depth_dfs(u, v, dist + 1, a) if u != p\n end\n end\n\n def tree_depth(root : Int32)\n a = Array.new(size, 0)\n tree_depth_dfs(root, -1, 0, a)\n a\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\n_, v = graph.tree_depth(0).each_with_index.max\ndist, _ = graph.tree_depth(v).each_with_index.max\nputs dist + 1\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nsys.setrecursionlimit(10**6)\nN = int(input())\nG = [[] for _ in range(N)]\nfor _ in range(N - 1):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n G[a].append(b)\n G[b].append(a)\n\ndef dfs(s):\n D = [-1] * N\n D[s] = 0\n stk = [s]\n push, pop = stk.append, stk.pop\n while stk:\n v = pop()\n nd = D[v] + 1\n for nv in G[v]:\n if D[nv] >= 0: continue\n D[nv] = nd\n push(nv)\n return D\n\nD0 = dfs(0)\nmxi = max(enumerate(D0), key=lambda x: x[1])[0]\nDmx = dfs(mxi)\nprint(max(Dmx) + 1)\n" }, { "id": 32, "name": "003", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))\n a[v] = dist\n self[v].each do |u|\n tree_depth_dfs(u, v, dist + 1, a) if u != p\n end\n end\n\n def tree_depth(root : Int32)\n a = Array.new(size, 0)\n tree_depth_dfs(root, -1, 0, a)\n a\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\n_, v = graph.tree_depth(0).each_with_index.max\ndist, _ = graph.tree_depth(v).each_with_index.max\nputs dist + 1\n", "Ruby": "def solve(graph, curr, prev)\n max_depth = 0\n max_score = 0\n\n for node in graph[curr]\n next if node == prev\n\n depth, score = solve(graph, node, curr)\n max_score = [max_score, score, depth + max_depth].max\n max_depth = [max_depth, depth].max\n end\n\n [max_depth + 1, max_score]\nend\n\nn = readline.to_i\n\ngraph = Array.new(n + 1) { [] }\n(n - 1).times do\n a_i, b_i = readline.split.map(&:to_i)\n graph[a_i].push(b_i)\n graph[b_i].push(a_i)\nend\n\nputs solve(graph, 1, nil)[1] + 1\n" }, { "id": 33, "name": "003", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))\n a[v] = dist\n self[v].each do |u|\n tree_depth_dfs(u, v, dist + 1, a) if u != p\n end\n end\n\n def tree_depth(root : Int32)\n a = Array.new(size, 0)\n tree_depth_dfs(root, -1, 0, a)\n a\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\n_, v = graph.tree_depth(0).each_with_index.max\ndist, _ = graph.tree_depth(v).each_with_index.max\nputs dist + 1\n", "Rust": "use proconio::{input,marker::Usize1};\nuse std::collections::VecDeque;\n\nfn main(){\n input!{n:usize}\n let mut g=vec![vec![];n];\n for _ in 1..n{\n input!{x:Usize1,y:Usize1}\n g[x].push(y);\n g[y].push(x);\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,0usize);\n let mut u:usize=0;\n let m=d.iter().max().unwrap();\n for i in 0..n{\n if &d[i]==m {u=i}\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,u);\n println!(\"{}\",1+d.iter().max().unwrap());\n}\n\nfn bfs(g:&Vec>,d:&mut Vec,s:usize){\n let mut q:VecDeque=VecDeque::new();\n d[s]=0;\n q.push_back(s);\n while q.len()>0{\n let i=q.pop_front().unwrap();\n for j in g[i].iter(){\n if d[*j]==1<<30{\n q.push_back(*j);\n d[*j]=d[i]+1;\n }\n }\n } \n}" }, { "id": 34, "name": "003", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))\n a[v] = dist\n self[v].each do |u|\n tree_depth_dfs(u, v, dist + 1, a) if u != p\n end\n end\n\n def tree_depth(root : Int32)\n a = Array.new(size, 0)\n tree_depth_dfs(root, -1, 0, a)\n a\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\n_, v = graph.tree_depth(0).each_with_index.max\ndist, _ = graph.tree_depth(v).each_with_index.max\nputs dist + 1\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar ans: int :: treeDiameter(graph) + 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc treeDiameter(graph: []list): int\n\t\tvar pos: int :: 0\n\t\tdo treeDiameterSub(graph, &pos, -1)\n\t\tret treeDiameterSub(graph, &pos, -1)\n\t\t\n\t\tfunc treeDiameterSub(graph: []list, pos: &int, p: int): int\n\t\t\tvar u: int :: pos\n\t\t\tvar res: int :: 0\n\t\t\tdo graph[u].head()\n\t\t\twhile(!graph[u].term())\n\t\t\t\tvar x: int :: graph[u].get()\n\t\t\t\tif(x <> p)\n\t\t\t\t\tvar dist: int :: treeDiameterSub(graph, &x, u) + 1\n\t\t\t\t\tif(dist > res)\n\t\t\t\t\t\tdo res :: dist\n\t\t\t\t\t\tdo pos :: x\n\t\t\t\t\tend if\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend while\n\t\t\tret res\n\t\tend func\n\tend func\nend func\n" }, { "id": 35, "name": "003", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nsys.setrecursionlimit(10**6)\nN = int(input())\nG = [[] for _ in range(N)]\nfor _ in range(N - 1):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n G[a].append(b)\n G[b].append(a)\n\ndef dfs(s):\n D = [-1] * N\n D[s] = 0\n stk = [s]\n push, pop = stk.append, stk.pop\n while stk:\n v = pop()\n nd = D[v] + 1\n for nv in G[v]:\n if D[nv] >= 0: continue\n D[nv] = nd\n push(nv)\n return D\n\nD0 = dfs(0)\nmxi = max(enumerate(D0), key=lambda x: x[1])[0]\nDmx = dfs(mxi)\nprint(max(Dmx) + 1)\n", "Ruby": "def solve(graph, curr, prev)\n max_depth = 0\n max_score = 0\n\n for node in graph[curr]\n next if node == prev\n\n depth, score = solve(graph, node, curr)\n max_score = [max_score, score, depth + max_depth].max\n max_depth = [max_depth, depth].max\n end\n\n [max_depth + 1, max_score]\nend\n\nn = readline.to_i\n\ngraph = Array.new(n + 1) { [] }\n(n - 1).times do\n a_i, b_i = readline.split.map(&:to_i)\n graph[a_i].push(b_i)\n graph[b_i].push(a_i)\nend\n\nputs solve(graph, 1, nil)[1] + 1\n" }, { "id": 36, "name": "003", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nsys.setrecursionlimit(10**6)\nN = int(input())\nG = [[] for _ in range(N)]\nfor _ in range(N - 1):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n G[a].append(b)\n G[b].append(a)\n\ndef dfs(s):\n D = [-1] * N\n D[s] = 0\n stk = [s]\n push, pop = stk.append, stk.pop\n while stk:\n v = pop()\n nd = D[v] + 1\n for nv in G[v]:\n if D[nv] >= 0: continue\n D[nv] = nd\n push(nv)\n return D\n\nD0 = dfs(0)\nmxi = max(enumerate(D0), key=lambda x: x[1])[0]\nDmx = dfs(mxi)\nprint(max(Dmx) + 1)\n", "Rust": "use proconio::{input,marker::Usize1};\nuse std::collections::VecDeque;\n\nfn main(){\n input!{n:usize}\n let mut g=vec![vec![];n];\n for _ in 1..n{\n input!{x:Usize1,y:Usize1}\n g[x].push(y);\n g[y].push(x);\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,0usize);\n let mut u:usize=0;\n let m=d.iter().max().unwrap();\n for i in 0..n{\n if &d[i]==m {u=i}\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,u);\n println!(\"{}\",1+d.iter().max().unwrap());\n}\n\nfn bfs(g:&Vec>,d:&mut Vec,s:usize){\n let mut q:VecDeque=VecDeque::new();\n d[s]=0;\n q.push_back(s);\n while q.len()>0{\n let i=q.pop_front().unwrap();\n for j in g[i].iter(){\n if d[*j]==1<<30{\n q.push_back(*j);\n d[*j]=d[i]+1;\n }\n }\n } \n}" }, { "id": 37, "name": "003", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nsys.setrecursionlimit(10**6)\nN = int(input())\nG = [[] for _ in range(N)]\nfor _ in range(N - 1):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n G[a].append(b)\n G[b].append(a)\n\ndef dfs(s):\n D = [-1] * N\n D[s] = 0\n stk = [s]\n push, pop = stk.append, stk.pop\n while stk:\n v = pop()\n nd = D[v] + 1\n for nv in G[v]:\n if D[nv] >= 0: continue\n D[nv] = nd\n push(nv)\n return D\n\nD0 = dfs(0)\nmxi = max(enumerate(D0), key=lambda x: x[1])[0]\nDmx = dfs(mxi)\nprint(max(Dmx) + 1)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar ans: int :: treeDiameter(graph) + 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc treeDiameter(graph: []list): int\n\t\tvar pos: int :: 0\n\t\tdo treeDiameterSub(graph, &pos, -1)\n\t\tret treeDiameterSub(graph, &pos, -1)\n\t\t\n\t\tfunc treeDiameterSub(graph: []list, pos: &int, p: int): int\n\t\t\tvar u: int :: pos\n\t\t\tvar res: int :: 0\n\t\t\tdo graph[u].head()\n\t\t\twhile(!graph[u].term())\n\t\t\t\tvar x: int :: graph[u].get()\n\t\t\t\tif(x <> p)\n\t\t\t\t\tvar dist: int :: treeDiameterSub(graph, &x, u) + 1\n\t\t\t\t\tif(dist > res)\n\t\t\t\t\t\tdo res :: dist\n\t\t\t\t\t\tdo pos :: x\n\t\t\t\t\tend if\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend while\n\t\t\tret res\n\t\tend func\n\tend func\nend func\n" }, { "id": 38, "name": "003", "Ruby": "def solve(graph, curr, prev)\n max_depth = 0\n max_score = 0\n\n for node in graph[curr]\n next if node == prev\n\n depth, score = solve(graph, node, curr)\n max_score = [max_score, score, depth + max_depth].max\n max_depth = [max_depth, depth].max\n end\n\n [max_depth + 1, max_score]\nend\n\nn = readline.to_i\n\ngraph = Array.new(n + 1) { [] }\n(n - 1).times do\n a_i, b_i = readline.split.map(&:to_i)\n graph[a_i].push(b_i)\n graph[b_i].push(a_i)\nend\n\nputs solve(graph, 1, nil)[1] + 1\n", "Rust": "use proconio::{input,marker::Usize1};\nuse std::collections::VecDeque;\n\nfn main(){\n input!{n:usize}\n let mut g=vec![vec![];n];\n for _ in 1..n{\n input!{x:Usize1,y:Usize1}\n g[x].push(y);\n g[y].push(x);\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,0usize);\n let mut u:usize=0;\n let m=d.iter().max().unwrap();\n for i in 0..n{\n if &d[i]==m {u=i}\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,u);\n println!(\"{}\",1+d.iter().max().unwrap());\n}\n\nfn bfs(g:&Vec>,d:&mut Vec,s:usize){\n let mut q:VecDeque=VecDeque::new();\n d[s]=0;\n q.push_back(s);\n while q.len()>0{\n let i=q.pop_front().unwrap();\n for j in g[i].iter(){\n if d[*j]==1<<30{\n q.push_back(*j);\n d[*j]=d[i]+1;\n }\n }\n } \n}" }, { "id": 39, "name": "003", "Ruby": "def solve(graph, curr, prev)\n max_depth = 0\n max_score = 0\n\n for node in graph[curr]\n next if node == prev\n\n depth, score = solve(graph, node, curr)\n max_score = [max_score, score, depth + max_depth].max\n max_depth = [max_depth, depth].max\n end\n\n [max_depth + 1, max_score]\nend\n\nn = readline.to_i\n\ngraph = Array.new(n + 1) { [] }\n(n - 1).times do\n a_i, b_i = readline.split.map(&:to_i)\n graph[a_i].push(b_i)\n graph[b_i].push(a_i)\nend\n\nputs solve(graph, 1, nil)[1] + 1\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar ans: int :: treeDiameter(graph) + 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc treeDiameter(graph: []list): int\n\t\tvar pos: int :: 0\n\t\tdo treeDiameterSub(graph, &pos, -1)\n\t\tret treeDiameterSub(graph, &pos, -1)\n\t\t\n\t\tfunc treeDiameterSub(graph: []list, pos: &int, p: int): int\n\t\t\tvar u: int :: pos\n\t\t\tvar res: int :: 0\n\t\t\tdo graph[u].head()\n\t\t\twhile(!graph[u].term())\n\t\t\t\tvar x: int :: graph[u].get()\n\t\t\t\tif(x <> p)\n\t\t\t\t\tvar dist: int :: treeDiameterSub(graph, &x, u) + 1\n\t\t\t\t\tif(dist > res)\n\t\t\t\t\t\tdo res :: dist\n\t\t\t\t\t\tdo pos :: x\n\t\t\t\t\tend if\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend while\n\t\t\tret res\n\t\tend func\n\tend func\nend func\n" }, { "id": 40, "name": "003", "Rust": "use proconio::{input,marker::Usize1};\nuse std::collections::VecDeque;\n\nfn main(){\n input!{n:usize}\n let mut g=vec![vec![];n];\n for _ in 1..n{\n input!{x:Usize1,y:Usize1}\n g[x].push(y);\n g[y].push(x);\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,0usize);\n let mut u:usize=0;\n let m=d.iter().max().unwrap();\n for i in 0..n{\n if &d[i]==m {u=i}\n }\n let mut d=vec![1<<30;n];\n bfs(&g,&mut d,u);\n println!(\"{}\",1+d.iter().max().unwrap());\n}\n\nfn bfs(g:&Vec>,d:&mut Vec,s:usize){\n let mut q:VecDeque=VecDeque::new();\n d[s]=0;\n q.push_back(s);\n while q.len()>0{\n let i=q.pop_front().unwrap();\n for j in g[i].iter(){\n if d[*j]==1<<30{\n q.push_back(*j);\n d[*j]=d[i]+1;\n }\n }\n } \n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar ans: int :: treeDiameter(graph) + 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc treeDiameter(graph: []list): int\n\t\tvar pos: int :: 0\n\t\tdo treeDiameterSub(graph, &pos, -1)\n\t\tret treeDiameterSub(graph, &pos, -1)\n\t\t\n\t\tfunc treeDiameterSub(graph: []list, pos: &int, p: int): int\n\t\t\tvar u: int :: pos\n\t\t\tvar res: int :: 0\n\t\t\tdo graph[u].head()\n\t\t\twhile(!graph[u].term())\n\t\t\t\tvar x: int :: graph[u].get()\n\t\t\t\tif(x <> p)\n\t\t\t\t\tvar dist: int :: treeDiameterSub(graph, &x, u) + 1\n\t\t\t\t\tif(dist > res)\n\t\t\t\t\t\tdo res :: dist\n\t\t\t\t\t\tdo pos :: x\n\t\t\t\t\tend if\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend while\n\t\t\tret res\n\t\tend func\n\tend func\nend func\n" }, { "id": 41, "name": "004", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nrow_sum = a.map(&.sum)\ncolumn_sum = a.transpose.map(&.sum)\n(0...h).each do |i|\n puts (0...w).join(' ') { |j|\n row_sum[i] + column_sum[j] - a[i][j]\n }\nend\n", "C++": "#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint H, W;\n\nint A[2009][2009];\n\nint Row[2009], Column[2009];\n\nint Answer[2009][2009];\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tscanf(\"%d\", &A[i][j]);\n\n\t\t}\n\n\t}\n\n\t\n\n\t// Step #2. ‘OŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tRow[i] += A[i][j];\n\n\t\t\tColumn[j] += A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. “š‚¦‚ÌŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer[i][j] = Row[i] + Column[j] - A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. �o—Í\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tif (j >= 2) printf(\" \");\n\n\t\t\tprintf(\"%d\", Answer[i][j]);\n\n\t\t}\n\n\t\tprintf(\"\\n\");\n\n\t}\n\n\treturn 0;\n\n}" }, { "id": 42, "name": "004", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nrow_sum = a.map(&.sum)\ncolumn_sum = a.transpose.map(&.sum)\n(0...h).each do |i|\n puts (0...w).join(' ') { |j|\n row_sum[i] + column_sum[j] - a[i][j]\n }\nend\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n A = [tuple(map(int, input().split())) for _ in range(H)]\n R = [sum(A[i]) for i in range(H)]\n C = [sum(A[i][j] for i in range(H)) for j in range(W)]\n ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]\n for a in ans:\n print(*a)\n\nif __name__ == '__main__':\n main()\n" }, { "id": 43, "name": "004", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nrow_sum = a.map(&.sum)\ncolumn_sum = a.transpose.map(&.sum)\n(0...h).each do |i|\n puts (0...w).join(' ') { |j|\n row_sum[i] + column_sum[j] - a[i][j]\n }\nend\n", "Ruby": "lines = readlines\n\nh, w = lines.shift.split.map(&:to_i)\n\na = Array.new(h) do |i|\n lines[i].split.map(&:to_i)\nend\n\ncols = a.transpose.map(&:sum)\n\nfor i in 0...h\n a_i = a[i]\n row = a_i.sum\n for j in 0...w\n a_i[j] = (row + cols[j] - a_i[j]).to_s\n end\n puts a_i.join(' ')\nend\n" }, { "id": 44, "name": "004", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nrow_sum = a.map(&.sum)\ncolumn_sum = a.transpose.map(&.sum)\n(0...h).each do |i|\n puts (0...w).join(' ') { |j|\n row_sum[i] + column_sum[j] - a[i][j]\n }\nend\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tdo cui@delimiter(\"\")\n\tvar s: []char :: cui@inputStr()\n\tvar idx: int :: 0\n\tvar a: [][]int :: #[h, w]int\n\tvar row: []int :: #[h]int\n\tvar col: []int :: #[w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tvar v: int :: 0\n\t\t\twhile('0' <= s[idx])\n\t\t\t\tdo v :* 10\n\t\t\t\tdo v :+ s[idx] $ int - '0' $ int\n\t\t\t\tdo idx :+ 1\n\t\t\tend while\n\t\t\tdo idx :+ 1\n\t\t\tdo a[y][x] :: v\n\t\t\tdo row[y] :+ v\n\t\t\tdo col[x] :+ v\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :: row[y] + col[x] - a[y][x]\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tdo cui@print(a[y].join(\" \"))\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 45, "name": "004", "C++": "#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint H, W;\n\nint A[2009][2009];\n\nint Row[2009], Column[2009];\n\nint Answer[2009][2009];\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tscanf(\"%d\", &A[i][j]);\n\n\t\t}\n\n\t}\n\n\t\n\n\t// Step #2. ‘OŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tRow[i] += A[i][j];\n\n\t\t\tColumn[j] += A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. “š‚¦‚ÌŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer[i][j] = Row[i] + Column[j] - A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. �o—Í\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tif (j >= 2) printf(\" \");\n\n\t\t\tprintf(\"%d\", Answer[i][j]);\n\n\t\t}\n\n\t\tprintf(\"\\n\");\n\n\t}\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n A = [tuple(map(int, input().split())) for _ in range(H)]\n R = [sum(A[i]) for i in range(H)]\n C = [sum(A[i][j] for i in range(H)) for j in range(W)]\n ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]\n for a in ans:\n print(*a)\n\nif __name__ == '__main__':\n main()\n" }, { "id": 46, "name": "004", "C++": "#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint H, W;\n\nint A[2009][2009];\n\nint Row[2009], Column[2009];\n\nint Answer[2009][2009];\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tscanf(\"%d\", &A[i][j]);\n\n\t\t}\n\n\t}\n\n\t\n\n\t// Step #2. ‘OŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tRow[i] += A[i][j];\n\n\t\t\tColumn[j] += A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. “š‚¦‚ÌŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer[i][j] = Row[i] + Column[j] - A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. �o—Í\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tif (j >= 2) printf(\" \");\n\n\t\t\tprintf(\"%d\", Answer[i][j]);\n\n\t\t}\n\n\t\tprintf(\"\\n\");\n\n\t}\n\n\treturn 0;\n\n}", "Ruby": "lines = readlines\n\nh, w = lines.shift.split.map(&:to_i)\n\na = Array.new(h) do |i|\n lines[i].split.map(&:to_i)\nend\n\ncols = a.transpose.map(&:sum)\n\nfor i in 0...h\n a_i = a[i]\n row = a_i.sum\n for j in 0...w\n a_i[j] = (row + cols[j] - a_i[j]).to_s\n end\n puts a_i.join(' ')\nend\n" }, { "id": 47, "name": "004", "C++": "#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint H, W;\n\nint A[2009][2009];\n\nint Row[2009], Column[2009];\n\nint Answer[2009][2009];\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tscanf(\"%d\", &A[i][j]);\n\n\t\t}\n\n\t}\n\n\t\n\n\t// Step #2. ‘OŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tRow[i] += A[i][j];\n\n\t\t\tColumn[j] += A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. “š‚¦‚ÌŒvŽZ\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer[i][j] = Row[i] + Column[j] - A[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. �o—Í\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tif (j >= 2) printf(\" \");\n\n\t\t\tprintf(\"%d\", Answer[i][j]);\n\n\t\t}\n\n\t\tprintf(\"\\n\");\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tdo cui@delimiter(\"\")\n\tvar s: []char :: cui@inputStr()\n\tvar idx: int :: 0\n\tvar a: [][]int :: #[h, w]int\n\tvar row: []int :: #[h]int\n\tvar col: []int :: #[w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tvar v: int :: 0\n\t\t\twhile('0' <= s[idx])\n\t\t\t\tdo v :* 10\n\t\t\t\tdo v :+ s[idx] $ int - '0' $ int\n\t\t\t\tdo idx :+ 1\n\t\t\tend while\n\t\t\tdo idx :+ 1\n\t\t\tdo a[y][x] :: v\n\t\t\tdo row[y] :+ v\n\t\t\tdo col[x] :+ v\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :: row[y] + col[x] - a[y][x]\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tdo cui@print(a[y].join(\" \"))\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 48, "name": "004", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n A = [tuple(map(int, input().split())) for _ in range(H)]\n R = [sum(A[i]) for i in range(H)]\n C = [sum(A[i][j] for i in range(H)) for j in range(W)]\n ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]\n for a in ans:\n print(*a)\n\nif __name__ == '__main__':\n main()\n", "Ruby": "lines = readlines\n\nh, w = lines.shift.split.map(&:to_i)\n\na = Array.new(h) do |i|\n lines[i].split.map(&:to_i)\nend\n\ncols = a.transpose.map(&:sum)\n\nfor i in 0...h\n a_i = a[i]\n row = a_i.sum\n for j in 0...w\n a_i[j] = (row + cols[j] - a_i[j]).to_s\n end\n puts a_i.join(' ')\nend\n" }, { "id": 49, "name": "004", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n A = [tuple(map(int, input().split())) for _ in range(H)]\n R = [sum(A[i]) for i in range(H)]\n C = [sum(A[i][j] for i in range(H)) for j in range(W)]\n ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]\n for a in ans:\n print(*a)\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tdo cui@delimiter(\"\")\n\tvar s: []char :: cui@inputStr()\n\tvar idx: int :: 0\n\tvar a: [][]int :: #[h, w]int\n\tvar row: []int :: #[h]int\n\tvar col: []int :: #[w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tvar v: int :: 0\n\t\t\twhile('0' <= s[idx])\n\t\t\t\tdo v :* 10\n\t\t\t\tdo v :+ s[idx] $ int - '0' $ int\n\t\t\t\tdo idx :+ 1\n\t\t\tend while\n\t\t\tdo idx :+ 1\n\t\t\tdo a[y][x] :: v\n\t\t\tdo row[y] :+ v\n\t\t\tdo col[x] :+ v\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :: row[y] + col[x] - a[y][x]\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tdo cui@print(a[y].join(\" \"))\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 50, "name": "004", "Ruby": "lines = readlines\n\nh, w = lines.shift.split.map(&:to_i)\n\na = Array.new(h) do |i|\n lines[i].split.map(&:to_i)\nend\n\ncols = a.transpose.map(&:sum)\n\nfor i in 0...h\n a_i = a[i]\n row = a_i.sum\n for j in 0...w\n a_i[j] = (row + cols[j] - a_i[j]).to_s\n end\n puts a_i.join(' ')\nend\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tdo cui@delimiter(\"\")\n\tvar s: []char :: cui@inputStr()\n\tvar idx: int :: 0\n\tvar a: [][]int :: #[h, w]int\n\tvar row: []int :: #[h]int\n\tvar col: []int :: #[w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tvar v: int :: 0\n\t\t\twhile('0' <= s[idx])\n\t\t\t\tdo v :* 10\n\t\t\t\tdo v :+ s[idx] $ int - '0' $ int\n\t\t\t\tdo idx :+ 1\n\t\t\tend while\n\t\t\tdo idx :+ 1\n\t\t\tdo a[y][x] :: v\n\t\t\tdo row[y] :+ v\n\t\t\tdo col[x] :+ v\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :: row[y] + col[x] - a[y][x]\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tdo cui@print(a[y].join(\" \"))\n\t\tdo cui@print(\"\\n\")\n\tend for\nend func\n" }, { "id": 51, "name": "005", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long modpow(long long a, long long b, long long m) {\n\n\tlong long p = 1, q = a;\n\n\tfor (int i = 0; i < 63; i++) {\n\n\t\tif ((b & (1LL << i)) != 0) {\n\n\t\t\tp *= q;\n\n\t\t\tp %= m;\n\n\t\t}\n\n\t\tq *= q;\n\n\t\tq %= m;\n\n\t}\n\n\treturn p;\n\n}\n\n\n\nconst long long mod = 1000000007;\n\n\n\n// 入力\n\nlong long N, B, K;\n\nlong long C[11];\n\n\n\n// その他の変数\n\nlong long power10[64];\n\nlong long DP[64][1009];\n\nlong long Answer[64][1009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> B >> K;\n\n\tfor (int i = 1; i <= K; i++) cin >> C[i];\n\n\t\n\n\t// Step #2. 前計算\n\n\tfor (int i = 0; i <= 62; i++) {\n\n\t\tpower10[i] = modpow(10LL, (1LL << i), B);\n\n\t}\n\n\t\n\n\t// Step #3. dp[1][i] を求める\n\n\tfor (int i = 1; i <= K; i++) {\n\n\t\tDP[0][C[i] % B] += 1;\n\n\t}\n\n\n\n\t// Step #4. dp[1][i], dp[2][i], ..., dp[2^n][i] を求める\n\n\tfor (int i = 0; i < 62; i++) {\n\n\t\tfor (int j = 0; j < B; j++) {\n\n\t\t\tfor (int k = 0; k < B; k++) {\n\n\t\t\t\tint nex = (j * power10[i] + k) % B;\n\n\t\t\t\tDP[i + 1][nex] += DP[i][j] * DP[i][k];\n\n\t\t\t\tDP[i + 1][nex] %= mod;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #5. 繰り返し二乗法により dp[N][i] を求める\n\n\tAnswer[0][0] = 1;\n\n\tfor (int i = 0; i < 62; i++) {\n\n\t\tif ((N & (1LL << i)) != 0LL) {\n\n\t\t\tfor (int j = 0; j < B; j++) {\n\n\t\t\t\tfor (int k = 0; k < B; k++) {\n\n\t\t\t\t\tint nex = (j * power10[i] + k) % B;\n\n\t\t\t\t\tAnswer[i + 1][nex] += Answer[i][j] * DP[i][k];\n\n\t\t\t\t\tAnswer[i + 1][nex] %= mod;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\telse {\n\n\t\t\tfor (int j = 0; j < B; j++) Answer[i + 1][j] = Answer[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #6. 出力\n\n\tcout << Answer[62][0] << endl;\n\n\treturn 0;\n\n}", "Crystal": "struct Mint\n MOD = 1000000007i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n @value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n getter value : Int64\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD &- value : 0i64)\n end\n\n def +(v)\n self + v.to_m\n end\n\n def +(m : self)\n x = value &+ m.value\n x &-= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - v.to_m\n end\n\n def -(m : self)\n x = value &- m.value\n x &+= MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * v.to_m\n end\n\n def *(m : self)\n Mint.new(value &* m.value)\n end\n\n def /(v)\n self / v.to_m\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.to_i64, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a &-= t &* b\n a, b = b, a\n u &-= t &* v\n u, v = v, u\n end\n Mint.new(value &* u)\n end\n\n def //(v)\n self / v\n end\n\n def **(exponent : Int)\n t, res = self, Mint.raw(1i64)\n while exponent > 0\n res *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n res\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m : Int)\n raise NotImplementedError.new(\"==\")\n end\n\n def succ\n Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)\n end\n\n def pred\n Mint.raw(value != 0 ? value &- 1 : MOD &- 1)\n end\n\n def abs\n self\n end\n\n def to_i64 : Int64\n value\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nstruct Int\n {% for op in %w[+ - * / //] %}\n def {{op.id}}(value : Mint)\n to_m {{op.id}} value\n end\n {% end %}\n\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass String\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nstruct Int\n def powmod(exp : T, mod : self) forall T\n n = self % mod\n res = typeof(self).new(1)\n while exp > 0\n res = res * n % mod if exp.odd?\n n = n * n % mod\n exp >>= 1\n end\n res\n end\nend\n\nn, b, k = read_line.split.try { |(n, b, k)|\n {n.to_i64, b.to_i, k.to_i}\n}\na = read_line.split.map(&.to_i)\nm = Math.log2(n).ceil.to_i + 1\n\ndp_marge = ->(dp1 : Array(Mint), digit : Int64, dp2 : Array(Mint)) {\n dp_res = Array.new(b, Mint.zero)\n pow10 = 10.powmod(digit, b)\n (0...b).each do |i|\n (0...b).each do |j|\n dp_res[(i * pow10 + j) % b] += dp1[i] * dp2[j]\n end\n end\n dp_res\n}\n\ndoubling = Array.new(1) { [Mint.zero] * b }\na.each { |j|\n doubling[0][j % b] += 1\n}\n(1..m).each { |i|\n doubling << dp_marge.call(doubling[-1], 2i64**i.pred, doubling[-1])\n}\n\ndp = [Mint.zero] * b\ndp[0] = 1.to_m\n(0..m).select { |i| n.bit(i) == 1 }.each do |i|\n dp = dp_marge.call(dp, 2i64**i, doubling[i])\nend\nputs dp[0]\n" }, { "id": 52, "name": "005", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long modpow(long long a, long long b, long long m) {\n\n\tlong long p = 1, q = a;\n\n\tfor (int i = 0; i < 63; i++) {\n\n\t\tif ((b & (1LL << i)) != 0) {\n\n\t\t\tp *= q;\n\n\t\t\tp %= m;\n\n\t\t}\n\n\t\tq *= q;\n\n\t\tq %= m;\n\n\t}\n\n\treturn p;\n\n}\n\n\n\nconst long long mod = 1000000007;\n\n\n\n// 入力\n\nlong long N, B, K;\n\nlong long C[11];\n\n\n\n// その他の変数\n\nlong long power10[64];\n\nlong long DP[64][1009];\n\nlong long Answer[64][1009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> B >> K;\n\n\tfor (int i = 1; i <= K; i++) cin >> C[i];\n\n\t\n\n\t// Step #2. 前計算\n\n\tfor (int i = 0; i <= 62; i++) {\n\n\t\tpower10[i] = modpow(10LL, (1LL << i), B);\n\n\t}\n\n\t\n\n\t// Step #3. dp[1][i] を求める\n\n\tfor (int i = 1; i <= K; i++) {\n\n\t\tDP[0][C[i] % B] += 1;\n\n\t}\n\n\n\n\t// Step #4. dp[1][i], dp[2][i], ..., dp[2^n][i] を求める\n\n\tfor (int i = 0; i < 62; i++) {\n\n\t\tfor (int j = 0; j < B; j++) {\n\n\t\t\tfor (int k = 0; k < B; k++) {\n\n\t\t\t\tint nex = (j * power10[i] + k) % B;\n\n\t\t\t\tDP[i + 1][nex] += DP[i][j] * DP[i][k];\n\n\t\t\t\tDP[i + 1][nex] %= mod;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #5. 繰り返し二乗法により dp[N][i] を求める\n\n\tAnswer[0][0] = 1;\n\n\tfor (int i = 0; i < 62; i++) {\n\n\t\tif ((N & (1LL << i)) != 0LL) {\n\n\t\t\tfor (int j = 0; j < B; j++) {\n\n\t\t\t\tfor (int k = 0; k < B; k++) {\n\n\t\t\t\t\tint nex = (j * power10[i] + k) % B;\n\n\t\t\t\t\tAnswer[i + 1][nex] += Answer[i][j] * DP[i][k];\n\n\t\t\t\t\tAnswer[i + 1][nex] %= mod;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\telse {\n\n\t\t\tfor (int j = 0; j < B; j++) Answer[i + 1][j] = Answer[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #6. 出力\n\n\tcout << Answer[62][0] << endl;\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nMOD = 10**9 + 7\ndef main():\n input = sys.stdin.readline\n N, B, K = map(int, input().split())\n *C, = map(int, input().split())\n\n def f(left, right, shift):\n res = [0] * B\n for lm in range(B):\n for rm in range(B):\n nm = (lm * shift + rm) % B\n res[nm] = (res[nm] + left[lm] * right[rm]) % MOD\n return res\n\n t = [0] * B\n\n # 1桁のとき\n for c in C: t[c % B] += 1\n\n ans = [0] * B\n ans[0] = 1\n shift = 1\n for i in range(N.bit_length()):\n shift = pow(10, 1 << i, B)\n if N & (1 << i):\n ans = f(ans, t, shift)\n t = f(t, t, shift)\n print(ans[0])\n\nif __name__ == '__main__':\n main()\n" }, { "id": 53, "name": "005", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long modpow(long long a, long long b, long long m) {\n\n\tlong long p = 1, q = a;\n\n\tfor (int i = 0; i < 63; i++) {\n\n\t\tif ((b & (1LL << i)) != 0) {\n\n\t\t\tp *= q;\n\n\t\t\tp %= m;\n\n\t\t}\n\n\t\tq *= q;\n\n\t\tq %= m;\n\n\t}\n\n\treturn p;\n\n}\n\n\n\nconst long long mod = 1000000007;\n\n\n\n// 入力\n\nlong long N, B, K;\n\nlong long C[11];\n\n\n\n// その他の変数\n\nlong long power10[64];\n\nlong long DP[64][1009];\n\nlong long Answer[64][1009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> B >> K;\n\n\tfor (int i = 1; i <= K; i++) cin >> C[i];\n\n\t\n\n\t// Step #2. 前計算\n\n\tfor (int i = 0; i <= 62; i++) {\n\n\t\tpower10[i] = modpow(10LL, (1LL << i), B);\n\n\t}\n\n\t\n\n\t// Step #3. dp[1][i] を求める\n\n\tfor (int i = 1; i <= K; i++) {\n\n\t\tDP[0][C[i] % B] += 1;\n\n\t}\n\n\n\n\t// Step #4. dp[1][i], dp[2][i], ..., dp[2^n][i] を求める\n\n\tfor (int i = 0; i < 62; i++) {\n\n\t\tfor (int j = 0; j < B; j++) {\n\n\t\t\tfor (int k = 0; k < B; k++) {\n\n\t\t\t\tint nex = (j * power10[i] + k) % B;\n\n\t\t\t\tDP[i + 1][nex] += DP[i][j] * DP[i][k];\n\n\t\t\t\tDP[i + 1][nex] %= mod;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #5. 繰り返し二乗法により dp[N][i] を求める\n\n\tAnswer[0][0] = 1;\n\n\tfor (int i = 0; i < 62; i++) {\n\n\t\tif ((N & (1LL << i)) != 0LL) {\n\n\t\t\tfor (int j = 0; j < B; j++) {\n\n\t\t\t\tfor (int k = 0; k < B; k++) {\n\n\t\t\t\t\tint nex = (j * power10[i] + k) % B;\n\n\t\t\t\t\tAnswer[i + 1][nex] += Answer[i][j] * DP[i][k];\n\n\t\t\t\t\tAnswer[i + 1][nex] %= mod;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\telse {\n\n\t\t\tfor (int j = 0; j < B; j++) Answer[i + 1][j] = Answer[i][j];\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #6. 出力\n\n\tcout << Answer[62][0] << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tconst mod: int :: 1000000007\n\tvar n: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar dp: []int :: #[b]int\n\tfor i(0, k - 1)\n\t\tvar c: int :: cui@inputInt()\n\t\tdo dp[c % b] :+ 1\n\tend for\n\t\n\tvar ans: []int :: #[b]int\n\tvar pow10: int :: 10 % b\n\tdo ans[0] :: 1\n\twhile(n > 0)\n\t\tif(n % 2 = 1)\n\t\t\tvar ansNext: []int :: #[b]int\n\t\t\tfor i(0, b - 1)\n\t\t\t\tfor j(0, b - 1)\n\t\t\t\t\tdo ansNext[(i * pow10 + j) % b] :+ ans[i] * dp[j]\n\t\t\t\t\tdo ansNext[(i * pow10 + j) % b] :% mod\n\t\t\t\tend for\n\t\t\tend for\n\t\t\tdo ans :: ansNext\n\t\tend if\n\t\tblock\n\t\t\tvar dpNext: []int :: #[b]int\n\t\t\tfor i(0, b - 1)\n\t\t\t\tfor j(0, b - 1)\n\t\t\t\t\tdo dpNext[(i * pow10 + j) % b] :+ dp[i] * dp[j]\n\t\t\t\t\tdo dpNext[(i * pow10 + j) % b] :% mod\n\t\t\t\tend for\n\t\t\tend for\n\t\t\tdo dp :: dpNext\n\t\tend block\n\t\tdo pow10 :: (pow10 ^ 2) % b\n\t\tdo n :/ 2\n\tend while\n\tdo cui@print(\"\\{ans[0]}\\n\")\nend func\n" }, { "id": 54, "name": "005", "Crystal": "struct Mint\n MOD = 1000000007i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n @value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n getter value : Int64\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD &- value : 0i64)\n end\n\n def +(v)\n self + v.to_m\n end\n\n def +(m : self)\n x = value &+ m.value\n x &-= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - v.to_m\n end\n\n def -(m : self)\n x = value &- m.value\n x &+= MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * v.to_m\n end\n\n def *(m : self)\n Mint.new(value &* m.value)\n end\n\n def /(v)\n self / v.to_m\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.to_i64, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a &-= t &* b\n a, b = b, a\n u &-= t &* v\n u, v = v, u\n end\n Mint.new(value &* u)\n end\n\n def //(v)\n self / v\n end\n\n def **(exponent : Int)\n t, res = self, Mint.raw(1i64)\n while exponent > 0\n res *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n res\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m : Int)\n raise NotImplementedError.new(\"==\")\n end\n\n def succ\n Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)\n end\n\n def pred\n Mint.raw(value != 0 ? value &- 1 : MOD &- 1)\n end\n\n def abs\n self\n end\n\n def to_i64 : Int64\n value\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nstruct Int\n {% for op in %w[+ - * / //] %}\n def {{op.id}}(value : Mint)\n to_m {{op.id}} value\n end\n {% end %}\n\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass String\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nstruct Int\n def powmod(exp : T, mod : self) forall T\n n = self % mod\n res = typeof(self).new(1)\n while exp > 0\n res = res * n % mod if exp.odd?\n n = n * n % mod\n exp >>= 1\n end\n res\n end\nend\n\nn, b, k = read_line.split.try { |(n, b, k)|\n {n.to_i64, b.to_i, k.to_i}\n}\na = read_line.split.map(&.to_i)\nm = Math.log2(n).ceil.to_i + 1\n\ndp_marge = ->(dp1 : Array(Mint), digit : Int64, dp2 : Array(Mint)) {\n dp_res = Array.new(b, Mint.zero)\n pow10 = 10.powmod(digit, b)\n (0...b).each do |i|\n (0...b).each do |j|\n dp_res[(i * pow10 + j) % b] += dp1[i] * dp2[j]\n end\n end\n dp_res\n}\n\ndoubling = Array.new(1) { [Mint.zero] * b }\na.each { |j|\n doubling[0][j % b] += 1\n}\n(1..m).each { |i|\n doubling << dp_marge.call(doubling[-1], 2i64**i.pred, doubling[-1])\n}\n\ndp = [Mint.zero] * b\ndp[0] = 1.to_m\n(0..m).select { |i| n.bit(i) == 1 }.each do |i|\n dp = dp_marge.call(dp, 2i64**i, doubling[i])\nend\nputs dp[0]\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nMOD = 10**9 + 7\ndef main():\n input = sys.stdin.readline\n N, B, K = map(int, input().split())\n *C, = map(int, input().split())\n\n def f(left, right, shift):\n res = [0] * B\n for lm in range(B):\n for rm in range(B):\n nm = (lm * shift + rm) % B\n res[nm] = (res[nm] + left[lm] * right[rm]) % MOD\n return res\n\n t = [0] * B\n\n # 1桁のとき\n for c in C: t[c % B] += 1\n\n ans = [0] * B\n ans[0] = 1\n shift = 1\n for i in range(N.bit_length()):\n shift = pow(10, 1 << i, B)\n if N & (1 << i):\n ans = f(ans, t, shift)\n t = f(t, t, shift)\n print(ans[0])\n\nif __name__ == '__main__':\n main()\n" }, { "id": 55, "name": "005", "Crystal": "struct Mint\n MOD = 1000000007i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n @value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n getter value : Int64\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD &- value : 0i64)\n end\n\n def +(v)\n self + v.to_m\n end\n\n def +(m : self)\n x = value &+ m.value\n x &-= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - v.to_m\n end\n\n def -(m : self)\n x = value &- m.value\n x &+= MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * v.to_m\n end\n\n def *(m : self)\n Mint.new(value &* m.value)\n end\n\n def /(v)\n self / v.to_m\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.to_i64, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a &-= t &* b\n a, b = b, a\n u &-= t &* v\n u, v = v, u\n end\n Mint.new(value &* u)\n end\n\n def //(v)\n self / v\n end\n\n def **(exponent : Int)\n t, res = self, Mint.raw(1i64)\n while exponent > 0\n res *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n res\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m : Int)\n raise NotImplementedError.new(\"==\")\n end\n\n def succ\n Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)\n end\n\n def pred\n Mint.raw(value != 0 ? value &- 1 : MOD &- 1)\n end\n\n def abs\n self\n end\n\n def to_i64 : Int64\n value\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nstruct Int\n {% for op in %w[+ - * / //] %}\n def {{op.id}}(value : Mint)\n to_m {{op.id}} value\n end\n {% end %}\n\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass String\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nstruct Int\n def powmod(exp : T, mod : self) forall T\n n = self % mod\n res = typeof(self).new(1)\n while exp > 0\n res = res * n % mod if exp.odd?\n n = n * n % mod\n exp >>= 1\n end\n res\n end\nend\n\nn, b, k = read_line.split.try { |(n, b, k)|\n {n.to_i64, b.to_i, k.to_i}\n}\na = read_line.split.map(&.to_i)\nm = Math.log2(n).ceil.to_i + 1\n\ndp_marge = ->(dp1 : Array(Mint), digit : Int64, dp2 : Array(Mint)) {\n dp_res = Array.new(b, Mint.zero)\n pow10 = 10.powmod(digit, b)\n (0...b).each do |i|\n (0...b).each do |j|\n dp_res[(i * pow10 + j) % b] += dp1[i] * dp2[j]\n end\n end\n dp_res\n}\n\ndoubling = Array.new(1) { [Mint.zero] * b }\na.each { |j|\n doubling[0][j % b] += 1\n}\n(1..m).each { |i|\n doubling << dp_marge.call(doubling[-1], 2i64**i.pred, doubling[-1])\n}\n\ndp = [Mint.zero] * b\ndp[0] = 1.to_m\n(0..m).select { |i| n.bit(i) == 1 }.each do |i|\n dp = dp_marge.call(dp, 2i64**i, doubling[i])\nend\nputs dp[0]\n", "Kuin": "func main()\n\tconst mod: int :: 1000000007\n\tvar n: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar dp: []int :: #[b]int\n\tfor i(0, k - 1)\n\t\tvar c: int :: cui@inputInt()\n\t\tdo dp[c % b] :+ 1\n\tend for\n\t\n\tvar ans: []int :: #[b]int\n\tvar pow10: int :: 10 % b\n\tdo ans[0] :: 1\n\twhile(n > 0)\n\t\tif(n % 2 = 1)\n\t\t\tvar ansNext: []int :: #[b]int\n\t\t\tfor i(0, b - 1)\n\t\t\t\tfor j(0, b - 1)\n\t\t\t\t\tdo ansNext[(i * pow10 + j) % b] :+ ans[i] * dp[j]\n\t\t\t\t\tdo ansNext[(i * pow10 + j) % b] :% mod\n\t\t\t\tend for\n\t\t\tend for\n\t\t\tdo ans :: ansNext\n\t\tend if\n\t\tblock\n\t\t\tvar dpNext: []int :: #[b]int\n\t\t\tfor i(0, b - 1)\n\t\t\t\tfor j(0, b - 1)\n\t\t\t\t\tdo dpNext[(i * pow10 + j) % b] :+ dp[i] * dp[j]\n\t\t\t\t\tdo dpNext[(i * pow10 + j) % b] :% mod\n\t\t\t\tend for\n\t\t\tend for\n\t\t\tdo dp :: dpNext\n\t\tend block\n\t\tdo pow10 :: (pow10 ^ 2) % b\n\t\tdo n :/ 2\n\tend while\n\tdo cui@print(\"\\{ans[0]}\\n\")\nend func\n" }, { "id": 56, "name": "005", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nMOD = 10**9 + 7\ndef main():\n input = sys.stdin.readline\n N, B, K = map(int, input().split())\n *C, = map(int, input().split())\n\n def f(left, right, shift):\n res = [0] * B\n for lm in range(B):\n for rm in range(B):\n nm = (lm * shift + rm) % B\n res[nm] = (res[nm] + left[lm] * right[rm]) % MOD\n return res\n\n t = [0] * B\n\n # 1桁のとき\n for c in C: t[c % B] += 1\n\n ans = [0] * B\n ans[0] = 1\n shift = 1\n for i in range(N.bit_length()):\n shift = pow(10, 1 << i, B)\n if N & (1 << i):\n ans = f(ans, t, shift)\n t = f(t, t, shift)\n print(ans[0])\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tconst mod: int :: 1000000007\n\tvar n: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar dp: []int :: #[b]int\n\tfor i(0, k - 1)\n\t\tvar c: int :: cui@inputInt()\n\t\tdo dp[c % b] :+ 1\n\tend for\n\t\n\tvar ans: []int :: #[b]int\n\tvar pow10: int :: 10 % b\n\tdo ans[0] :: 1\n\twhile(n > 0)\n\t\tif(n % 2 = 1)\n\t\t\tvar ansNext: []int :: #[b]int\n\t\t\tfor i(0, b - 1)\n\t\t\t\tfor j(0, b - 1)\n\t\t\t\t\tdo ansNext[(i * pow10 + j) % b] :+ ans[i] * dp[j]\n\t\t\t\t\tdo ansNext[(i * pow10 + j) % b] :% mod\n\t\t\t\tend for\n\t\t\tend for\n\t\t\tdo ans :: ansNext\n\t\tend if\n\t\tblock\n\t\t\tvar dpNext: []int :: #[b]int\n\t\t\tfor i(0, b - 1)\n\t\t\t\tfor j(0, b - 1)\n\t\t\t\t\tdo dpNext[(i * pow10 + j) % b] :+ dp[i] * dp[j]\n\t\t\t\t\tdo dpNext[(i * pow10 + j) % b] :% mod\n\t\t\t\tend for\n\t\t\tend for\n\t\t\tdo dp :: dpNext\n\t\tend block\n\t\tdo pow10 :: (pow10 ^ 2) % b\n\t\tdo n :/ 2\n\tend while\n\tdo cui@print(\"\\{ans[0]}\\n\")\nend func\n" }, { "id": 57, "name": "006", "Crystal": "n, k = read_line.split.map(&.to_i)\ns = read_line\nnext_index = ('a'..'z').map { |c|\n prev_index = n\n (0...n).reverse_each.map { |i|\n if s[i] == c\n prev_index = i\n else\n prev_index\n end\n }.to_a.reverse\n}\n\nindex = 0\nputs (1..k).join { |size|\n ('a'..'z').find { |char|\n next_index[char - 'a'][index] <= n - (k - size + 1)\n }.not_nil!.tap { |char|\n index = next_index[char - 'a'][index] + 1\n }\n}\n", "C++": "/*\n競プロ典型90問　第6問　s\nhttps://atcoder.jp/contests/typical90/submissions/23191468\n*/\n#include \n#include \n#include \n#include \n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair P;\n\nint N, K;\nstring s;\n\nint main()\n{\n\n\tcin >> N >> K;\n\tcin >> s;\n\n\tpriority_queue, greater

> pq;\n\t//前からN - K + 1個をまず入れる。\n\tfor (int i = 0; i < N - K + 1; i++)\n\t\tpq.push(make_pair(s[i], i));\n\n\tstring ans = \"\";\n\tint topIdx = -1;\n\tfor (int i = 0; i < K; i++)\n\t{\n\t\tP top;\n\t\twhile (true)\n\t\t{\n\t\t\ttop = pq.top();\n\t\t\tpq.pop();\n\t\t\tif (top.second > topIdx)\n\t\t\t\tbreak;\n\t\t}\n\t\tans += top.first;\n\t\ttopIdx = top.second;\n\t\tpq.push(make_pair(s[N - K + 1 + i], N - K + 1 + i));\n\t}\n\tcout << ans << endl;\n\n\treturn 0;\n}" }, { "id": 58, "name": "006", "Crystal": "n, k = read_line.split.map(&.to_i)\ns = read_line\nnext_index = ('a'..'z').map { |c|\n prev_index = n\n (0...n).reverse_each.map { |i|\n if s[i] == c\n prev_index = i\n else\n prev_index\n end\n }.to_a.reverse\n}\n\nindex = 0\nputs (1..k).join { |size|\n ('a'..'z').find { |char|\n next_index[char - 'a'][index] <= n - (k - size + 1)\n }.not_nil!.tap { |char|\n index = next_index[char - 'a'][index] + 1\n }\n}\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\ndef main():\n N, K = map(int, input().split())\n S = input()\n a = ord('a')\n st = SegmentTree(\n f=min, identity_factory=lambda: (\n 27, len(S)), initial_values=[\n (ord(s) - a, i) for i, s in enumerate(S)])\n ans = []\n l = 0\n r = len(S) - K\n for _ in range(K):\n mn = st.query(l, r + 1)\n ans.append(mn[0])\n l = mn[1] + 1\n r += 1\n print(''.join(map(lambda x: chr(x + a), ans)))\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n" }, { "id": 59, "name": "006", "Crystal": "n, k = read_line.split.map(&.to_i)\ns = read_line\nnext_index = ('a'..'z').map { |c|\n prev_index = n\n (0...n).reverse_each.map { |i|\n if s[i] == c\n prev_index = i\n else\n prev_index\n end\n }.to_a.reverse\n}\n\nindex = 0\nputs (1..k).join { |size|\n ('a'..'z').find { |char|\n next_index[char - 'a'][index] <= n - (k - size + 1)\n }.not_nil!.tap { |char|\n index = next_index[char - 'a'][index] + 1\n }\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar s: []char :: cui@input()\n\tvar nextPos: [][]int :: #[n, 26]int\n\tvar pos: []int :: [n].repeat(26)\n\tfor i(n - 1, 0, -1)\n\t\tdo pos[s[i] $ int - 'a' $ int] :: i\n\t\tfor j(0, 25)\n\t\t\tdo nextPos[i][j] :: pos[j]\n\t\tend for\n\tend for\n\tvar p: int :: 0\n\tvar ans: []char :: #[k]char\n\tfor i(0, k - 1)\n\t\tfor j(0, 25)\n\t\t\tvar remains: int :: n - 1 - nextPos[p][j]\n\t\t\tif(remains >= k - 1 - i)\n\t\t\t\tdo ans[i] :: 'a'.offset(j)\n\t\t\t\tdo p :: nextPos[p][j] + 1\n\t\t\t\tbreak j\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 60, "name": "006", "C++": "/*\n競プロ典型90問　第6問　s\nhttps://atcoder.jp/contests/typical90/submissions/23191468\n*/\n#include \n#include \n#include \n#include \n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair P;\n\nint N, K;\nstring s;\n\nint main()\n{\n\n\tcin >> N >> K;\n\tcin >> s;\n\n\tpriority_queue, greater

> pq;\n\t//前からN - K + 1個をまず入れる。\n\tfor (int i = 0; i < N - K + 1; i++)\n\t\tpq.push(make_pair(s[i], i));\n\n\tstring ans = \"\";\n\tint topIdx = -1;\n\tfor (int i = 0; i < K; i++)\n\t{\n\t\tP top;\n\t\twhile (true)\n\t\t{\n\t\t\ttop = pq.top();\n\t\t\tpq.pop();\n\t\t\tif (top.second > topIdx)\n\t\t\t\tbreak;\n\t\t}\n\t\tans += top.first;\n\t\ttopIdx = top.second;\n\t\tpq.push(make_pair(s[N - K + 1 + i], N - K + 1 + i));\n\t}\n\tcout << ans << endl;\n\n\treturn 0;\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\ndef main():\n N, K = map(int, input().split())\n S = input()\n a = ord('a')\n st = SegmentTree(\n f=min, identity_factory=lambda: (\n 27, len(S)), initial_values=[\n (ord(s) - a, i) for i, s in enumerate(S)])\n ans = []\n l = 0\n r = len(S) - K\n for _ in range(K):\n mn = st.query(l, r + 1)\n ans.append(mn[0])\n l = mn[1] + 1\n r += 1\n print(''.join(map(lambda x: chr(x + a), ans)))\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n" }, { "id": 61, "name": "006", "C++": "/*\n競プロ典型90問　第6問　s\nhttps://atcoder.jp/contests/typical90/submissions/23191468\n*/\n#include \n#include \n#include \n#include \n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair P;\n\nint N, K;\nstring s;\n\nint main()\n{\n\n\tcin >> N >> K;\n\tcin >> s;\n\n\tpriority_queue, greater

> pq;\n\t//前からN - K + 1個をまず入れる。\n\tfor (int i = 0; i < N - K + 1; i++)\n\t\tpq.push(make_pair(s[i], i));\n\n\tstring ans = \"\";\n\tint topIdx = -1;\n\tfor (int i = 0; i < K; i++)\n\t{\n\t\tP top;\n\t\twhile (true)\n\t\t{\n\t\t\ttop = pq.top();\n\t\t\tpq.pop();\n\t\t\tif (top.second > topIdx)\n\t\t\t\tbreak;\n\t\t}\n\t\tans += top.first;\n\t\ttopIdx = top.second;\n\t\tpq.push(make_pair(s[N - K + 1 + i], N - K + 1 + i));\n\t}\n\tcout << ans << endl;\n\n\treturn 0;\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar s: []char :: cui@input()\n\tvar nextPos: [][]int :: #[n, 26]int\n\tvar pos: []int :: [n].repeat(26)\n\tfor i(n - 1, 0, -1)\n\t\tdo pos[s[i] $ int - 'a' $ int] :: i\n\t\tfor j(0, 25)\n\t\t\tdo nextPos[i][j] :: pos[j]\n\t\tend for\n\tend for\n\tvar p: int :: 0\n\tvar ans: []char :: #[k]char\n\tfor i(0, k - 1)\n\t\tfor j(0, 25)\n\t\t\tvar remains: int :: n - 1 - nextPos[p][j]\n\t\t\tif(remains >= k - 1 - i)\n\t\t\t\tdo ans[i] :: 'a'.offset(j)\n\t\t\t\tdo p :: nextPos[p][j] + 1\n\t\t\t\tbreak j\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 62, "name": "006", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\ndef main():\n N, K = map(int, input().split())\n S = input()\n a = ord('a')\n st = SegmentTree(\n f=min, identity_factory=lambda: (\n 27, len(S)), initial_values=[\n (ord(s) - a, i) for i, s in enumerate(S)])\n ans = []\n l = 0\n r = len(S) - K\n for _ in range(K):\n mn = st.query(l, r + 1)\n ans.append(mn[0])\n l = mn[1] + 1\n r += 1\n print(''.join(map(lambda x: chr(x + a), ans)))\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar s: []char :: cui@input()\n\tvar nextPos: [][]int :: #[n, 26]int\n\tvar pos: []int :: [n].repeat(26)\n\tfor i(n - 1, 0, -1)\n\t\tdo pos[s[i] $ int - 'a' $ int] :: i\n\t\tfor j(0, 25)\n\t\t\tdo nextPos[i][j] :: pos[j]\n\t\tend for\n\tend for\n\tvar p: int :: 0\n\tvar ans: []char :: #[k]char\n\tfor i(0, k - 1)\n\t\tfor j(0, 25)\n\t\t\tvar remains: int :: n - 1 - nextPos[p][j]\n\t\t\tif(remains >= k - 1 - i)\n\t\t\t\tdo ans[i] :: 'a'.offset(j)\n\t\t\t\tdo p :: nextPos[p][j] + 1\n\t\t\t\tbreak j\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 63, "name": "007", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nconst int INF = 2000000000;\n\nint N;\n\nint A[300009];\n\nint Q;\n\nint B[300009];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> B[i];\n\n\n\n\t// Step #2. Sorting\n\n\tsort(A + 1, A + N + 1);\n\n\n\n\t// Step #3. Binary Search\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tint pos1 = lower_bound(A + 1, A + N + 1, B[i]) - A;\n\n\t\tint Diff1 = INF, Diff2 = INF;\n\n\t\tif (pos1 <= N) Diff1 = abs(B[i] - A[pos1]);\n\n\t\tif (pos1 >= 2) Diff2 = abs(B[i] - A[pos1 - 1]);\n\n\t\tcout << min(Diff1, Diff2) << endl;\n\n\t}\n\n\treturn 0;\n\n}\n\n", "Crystal": "read_line\na = [-2*10**9] + read_line.split.map(&.to_i).sort + [2*10**9]\nread_line.to_i.times do\n b = read_line.to_i\n i = a.bsearch_index { |x| x > b }.not_nil!\n puts a[i - 1..i + 1].min_of { |x| (b - x).abs }\nend\n" }, { "id": 64, "name": "007", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nconst int INF = 2000000000;\n\nint N;\n\nint A[300009];\n\nint Q;\n\nint B[300009];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> B[i];\n\n\n\n\t// Step #2. Sorting\n\n\tsort(A + 1, A + N + 1);\n\n\n\n\t// Step #3. Binary Search\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tint pos1 = lower_bound(A + 1, A + N + 1, B[i]) - A;\n\n\t\tint Diff1 = INF, Diff2 = INF;\n\n\t\tif (pos1 <= N) Diff1 = abs(B[i] - A[pos1]);\n\n\t\tif (pos1 >= 2) Diff2 = abs(B[i] - A[pos1 - 1]);\n\n\t\tcout << min(Diff1, Diff2) << endl;\n\n\t}\n\n\treturn 0;\n\n}\n\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nN = int(input())\n*A, = map(int, input().split())\nQ = int(input())\nA.sort()\nfor _ in range(Q):\n b = int(input())\n i = bisect_left(A, b)\n u = 10**18\n if i < N:\n u = min(u, abs(A[i] - b))\n if i > 0:\n u = min(u, abs(A[i - 1] - b))\n print(u)\n" }, { "id": 65, "name": "007", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nconst int INF = 2000000000;\n\nint N;\n\nint A[300009];\n\nint Q;\n\nint B[300009];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> B[i];\n\n\n\n\t// Step #2. Sorting\n\n\tsort(A + 1, A + N + 1);\n\n\n\n\t// Step #3. Binary Search\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tint pos1 = lower_bound(A + 1, A + N + 1, B[i]) - A;\n\n\t\tint Diff1 = INF, Diff2 = INF;\n\n\t\tif (pos1 <= N) Diff1 = abs(B[i] - A[pos1]);\n\n\t\tif (pos1 >= 2) Diff2 = abs(B[i] - A[pos1 - 1]);\n\n\t\tcout << min(Diff1, Diff2) << endl;\n\n\t}\n\n\treturn 0;\n\n}\n\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a.sort()\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar b: int :: cui@inputInt()\n\t\tvar ok: int :: 0\n\t\tvar ng: int :: n\n\t\twhile((ok - ng).abs() > 1)\n\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\tif(a[mid] <= b)\n\t\t\t\tdo ok :: mid\n\t\t\telse\n\t\t\t\tdo ng :: mid\n\t\t\tend if\n\t\tend while\n\t\t\n\t\tvar ans: int :: (b - a[ok]).abs()\n\t\tif(ok <> n - 1)\n\t\t\tdo ans :: [ans, a[ok + 1] - b].min()\n\t\tend if\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 66, "name": "007", "Crystal": "read_line\na = [-2*10**9] + read_line.split.map(&.to_i).sort + [2*10**9]\nread_line.to_i.times do\n b = read_line.to_i\n i = a.bsearch_index { |x| x > b }.not_nil!\n puts a[i - 1..i + 1].min_of { |x| (b - x).abs }\nend\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nN = int(input())\n*A, = map(int, input().split())\nQ = int(input())\nA.sort()\nfor _ in range(Q):\n b = int(input())\n i = bisect_left(A, b)\n u = 10**18\n if i < N:\n u = min(u, abs(A[i] - b))\n if i > 0:\n u = min(u, abs(A[i - 1] - b))\n print(u)\n" }, { "id": 67, "name": "007", "Crystal": "read_line\na = [-2*10**9] + read_line.split.map(&.to_i).sort + [2*10**9]\nread_line.to_i.times do\n b = read_line.to_i\n i = a.bsearch_index { |x| x > b }.not_nil!\n puts a[i - 1..i + 1].min_of { |x| (b - x).abs }\nend\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a.sort()\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar b: int :: cui@inputInt()\n\t\tvar ok: int :: 0\n\t\tvar ng: int :: n\n\t\twhile((ok - ng).abs() > 1)\n\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\tif(a[mid] <= b)\n\t\t\t\tdo ok :: mid\n\t\t\telse\n\t\t\t\tdo ng :: mid\n\t\t\tend if\n\t\tend while\n\t\t\n\t\tvar ans: int :: (b - a[ok]).abs()\n\t\tif(ok <> n - 1)\n\t\t\tdo ans :: [ans, a[ok + 1] - b].min()\n\t\tend if\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 68, "name": "007", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nN = int(input())\n*A, = map(int, input().split())\nQ = int(input())\nA.sort()\nfor _ in range(Q):\n b = int(input())\n i = bisect_left(A, b)\n u = 10**18\n if i < N:\n u = min(u, abs(A[i] - b))\n if i > 0:\n u = min(u, abs(A[i - 1] - b))\n print(u)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tdo a.sort()\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar b: int :: cui@inputInt()\n\t\tvar ok: int :: 0\n\t\tvar ng: int :: n\n\t\twhile((ok - ng).abs() > 1)\n\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\tif(a[mid] <= b)\n\t\t\t\tdo ok :: mid\n\t\t\telse\n\t\t\t\tdo ng :: mid\n\t\t\tend if\n\t\tend while\n\t\t\n\t\tvar ans: int :: (b - a[ok]).abs()\n\t\tif(ok <> n - 1)\n\t\t\tdo ans :: [ans, a[ok + 1] - b].min()\n\t\tend if\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 69, "name": "008", "C++": "#include \n#include \n#include \n#define mod 1000000007\nusing namespace std;\n\n//19[ms]\nstring t = \"atcoder\";\nint main(){\n int n;\n string s;\n cin >> n >> s;\n vector> dp(8, vector(n + 1));\n for(int i = 0; i <= n; i++) dp[0][i] = 1;\n for(int i = 0; i < 7; i++){\n for(int j = 0; j < n; j++){\n if(t[i] == s[j]){\n dp[i + 1][j + 1] += dp[i][j];\n dp[i + 1][j + 1] %= mod;\n }\n dp[i + 1][j + 1] += dp[i + 1][j];\n dp[i + 1][j + 1] %= mod;\n }\n }\n cout << dp[7][n] << \"\\n\";\n}", "Crystal": "read_line\ns = read_line\n\natcoder = \"?atcoder\"\nm = atcoder.size\nputs s.chars.each_with_object([1] + [0] * m.pred) { |c, dp|\n if i = atcoder.index(c)\n dp[i] = (dp[i] + dp[i - 1]) % (10**9 + 7)\n end\n}.last\n" }, { "id": 70, "name": "008", "C++": "#include \n#include \n#include \n#define mod 1000000007\nusing namespace std;\n\n//19[ms]\nstring t = \"atcoder\";\nint main(){\n int n;\n string s;\n cin >> n >> s;\n vector> dp(8, vector(n + 1));\n for(int i = 0; i <= n; i++) dp[0][i] = 1;\n for(int i = 0; i < 7; i++){\n for(int j = 0; j < n; j++){\n if(t[i] == s[j]){\n dp[i + 1][j + 1] += dp[i][j];\n dp[i + 1][j + 1] %= mod;\n }\n dp[i + 1][j + 1] += dp[i + 1][j];\n dp[i + 1][j + 1] %= mod;\n }\n }\n cout << dp[7][n] << \"\\n\";\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom collections import defaultdict\nMOD = 10**9 + 7\nN = int(input())\nS = input()\nC = defaultdict(int)\nATCODER = 'atcoder'\ndp = [0] * len(ATCODER)\nfor s in S[::-1]:\n if s in ATCODER:\n i = ATCODER.index(s)\n if i == len(ATCODER) - 1:\n dp[i] += 1\n else:\n dp[i] = (dp[i] + dp[i + 1]) % MOD\nprint(dp[0])\n" }, { "id": 71, "name": "008", "C++": "#include \n#include \n#include \n#define mod 1000000007\nusing namespace std;\n\n//19[ms]\nstring t = \"atcoder\";\nint main(){\n int n;\n string s;\n cin >> n >> s;\n vector> dp(8, vector(n + 1));\n for(int i = 0; i <= n; i++) dp[0][i] = 1;\n for(int i = 0; i < 7; i++){\n for(int j = 0; j < n; j++){\n if(t[i] == s[j]){\n dp[i + 1][j + 1] += dp[i][j];\n dp[i + 1][j + 1] %= mod;\n }\n dp[i + 1][j + 1] += dp[i + 1][j];\n dp[i + 1][j + 1] %= mod;\n }\n }\n cout << dp[7][n] << \"\\n\";\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar s: []char :: cui@input()\n\tvar atcoder: []char :: \"atcoder\"\n\t\n\tvar dp: []int :: #[^atcoder + 1]int\n\tdo dp[0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, ^atcoder - 1)\n\t\t\tif(s[i] = atcoder[j])\n\t\t\t\tdo dp[j + 1] :+ dp[j]\n\t\t\t\tdo dp[j + 1] :% 10 ^ 9 + 7\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[^atcoder]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 72, "name": "008", "Crystal": "read_line\ns = read_line\n\natcoder = \"?atcoder\"\nm = atcoder.size\nputs s.chars.each_with_object([1] + [0] * m.pred) { |c, dp|\n if i = atcoder.index(c)\n dp[i] = (dp[i] + dp[i - 1]) % (10**9 + 7)\n end\n}.last\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom collections import defaultdict\nMOD = 10**9 + 7\nN = int(input())\nS = input()\nC = defaultdict(int)\nATCODER = 'atcoder'\ndp = [0] * len(ATCODER)\nfor s in S[::-1]:\n if s in ATCODER:\n i = ATCODER.index(s)\n if i == len(ATCODER) - 1:\n dp[i] += 1\n else:\n dp[i] = (dp[i] + dp[i + 1]) % MOD\nprint(dp[0])\n" }, { "id": 73, "name": "008", "Crystal": "read_line\ns = read_line\n\natcoder = \"?atcoder\"\nm = atcoder.size\nputs s.chars.each_with_object([1] + [0] * m.pred) { |c, dp|\n if i = atcoder.index(c)\n dp[i] = (dp[i] + dp[i - 1]) % (10**9 + 7)\n end\n}.last\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar s: []char :: cui@input()\n\tvar atcoder: []char :: \"atcoder\"\n\t\n\tvar dp: []int :: #[^atcoder + 1]int\n\tdo dp[0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, ^atcoder - 1)\n\t\t\tif(s[i] = atcoder[j])\n\t\t\t\tdo dp[j + 1] :+ dp[j]\n\t\t\t\tdo dp[j + 1] :% 10 ^ 9 + 7\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[^atcoder]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 74, "name": "008", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom collections import defaultdict\nMOD = 10**9 + 7\nN = int(input())\nS = input()\nC = defaultdict(int)\nATCODER = 'atcoder'\ndp = [0] * len(ATCODER)\nfor s in S[::-1]:\n if s in ATCODER:\n i = ATCODER.index(s)\n if i == len(ATCODER) - 1:\n dp[i] += 1\n else:\n dp[i] = (dp[i] + dp[i + 1]) % MOD\nprint(dp[0])\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar s: []char :: cui@input()\n\tvar atcoder: []char :: \"atcoder\"\n\t\n\tvar dp: []int :: #[^atcoder + 1]int\n\tdo dp[0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, ^atcoder - 1)\n\t\t\tif(s[i] = atcoder[j])\n\t\t\t\tdo dp[j + 1] :+ dp[j]\n\t\t\t\tdo dp[j + 1] :% 10 ^ 9 + 7\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[^atcoder]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 75, "name": "009", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nstruct Point {\n\n\tdouble px, py;\n\n};\n\n\n\nPoint operator-(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n\n}\n\n\n\ndouble getangle(Point G) {\n\n\t// 点 G の偏角を求める\n\n\tif (G.py >= 0.0) {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn kaku;\n\n\t}\n\n\telse {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn 360.0 - kaku;\n\n\t}\n\n}\n\n\n\ndouble getangle2(double I1, double I2) {\n\n\t// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める\n\n\t// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°\n\n\tdouble res = abs(I1 - I2);\n\n\tif (res >= 180.0) return 360.0 - res;\n\n\treturn res;\n\n}\n\n\n\nint N;\n\nPoint G[2009];\n\n\n\ndouble solve(int pos) {\n\n\t// 最初に偏角の昇順にソートする\n\n\tvector vec;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i == pos) continue;\n\n\t\tPoint SA = G[i] - G[pos];\n\n\t\tdouble angle = getangle(SA);\n\n\t\tvec.push_back(angle);\n\n\t}\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める\n\n\tdouble ret = 0.0;\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tdouble target = vec[i] + 180.0;\n\n\t\tif (target >= 360.0) target -= 360.0;\n\n\t\tint pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();\n\n\n\n\t\t// 点 C の候補は高々 2 つに絞れる\n\n\t\tint CandIdx1 = pos1 % vec.size();\n\n\t\tint CandIdx2 = (pos1 + vec.size() - 1) % vec.size();\n\n\t\tdouble Candidate1 = getangle2(vec[i], vec[CandIdx1]);\n\n\t\tdouble Candidate2 = getangle2(vec[i], vec[CandIdx2]);\n\n\t\tret = max({ ret, Candidate1, Candidate2 });\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\n// O(N^3) のアルゴリズム（点 A, B, C を全探索）\n\ndouble solve_Slow() {\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 1; j <= N; j++) {\n\n\t\t\tfor (int k = 1; k <= N; k++) {\n\n\t\t\t\tif (i == j || i == k || j == k) continue;\n\n\t\t\t\tdouble I1 = getangle(G[i] - G[j]);\n\n\t\t\t\tdouble I2 = getangle(G[k] - G[j]);\n\n\t\t\t\tAnswer = max(Answer, getangle2(I1, I2));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\n// O(N^2 log N) のアルゴリズム\n\ndouble solve_Fast() {\n\n\t// 点 B を全探索\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tdouble ret = solve(i);\n\n\t\tAnswer = max(Answer, ret);\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> G[i].px >> G[i].py;\n\n\t}\n\n\n\n\t// Step #2. 出力\n\n\tdouble FinalAns = solve_Fast();\n\n\tprintf(\"%.12lf\\n\", FinalAns);\n\n\treturn 0;\n\n}", "Crystal": "# 0.36.0 以降は Math::TAU があります\nTAU = Math::PI * 2\nn = read_line.to_i\nxy = (1..n).map {\n {Int32, Int32}.from read_line.split.map(&.to_i)\n}\nputs (0...n).max_of { |i|\n angle = (0...n).select { |j| i != j }.map { |j|\n Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])\n }\n angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort\n angle.max_of { |a|\n index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!\n {angles[index - 1], angles[index]}.max_of { |b|\n res = (b - a) % TAU\n res > Math::PI ? Math::PI - res : res\n }\n }\n} * 360 / TAU\n" }, { "id": 76, "name": "009", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nstruct Point {\n\n\tdouble px, py;\n\n};\n\n\n\nPoint operator-(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n\n}\n\n\n\ndouble getangle(Point G) {\n\n\t// 点 G の偏角を求める\n\n\tif (G.py >= 0.0) {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn kaku;\n\n\t}\n\n\telse {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn 360.0 - kaku;\n\n\t}\n\n}\n\n\n\ndouble getangle2(double I1, double I2) {\n\n\t// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める\n\n\t// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°\n\n\tdouble res = abs(I1 - I2);\n\n\tif (res >= 180.0) return 360.0 - res;\n\n\treturn res;\n\n}\n\n\n\nint N;\n\nPoint G[2009];\n\n\n\ndouble solve(int pos) {\n\n\t// 最初に偏角の昇順にソートする\n\n\tvector vec;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i == pos) continue;\n\n\t\tPoint SA = G[i] - G[pos];\n\n\t\tdouble angle = getangle(SA);\n\n\t\tvec.push_back(angle);\n\n\t}\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める\n\n\tdouble ret = 0.0;\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tdouble target = vec[i] + 180.0;\n\n\t\tif (target >= 360.0) target -= 360.0;\n\n\t\tint pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();\n\n\n\n\t\t// 点 C の候補は高々 2 つに絞れる\n\n\t\tint CandIdx1 = pos1 % vec.size();\n\n\t\tint CandIdx2 = (pos1 + vec.size() - 1) % vec.size();\n\n\t\tdouble Candidate1 = getangle2(vec[i], vec[CandIdx1]);\n\n\t\tdouble Candidate2 = getangle2(vec[i], vec[CandIdx2]);\n\n\t\tret = max({ ret, Candidate1, Candidate2 });\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\n// O(N^3) のアルゴリズム（点 A, B, C を全探索）\n\ndouble solve_Slow() {\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 1; j <= N; j++) {\n\n\t\t\tfor (int k = 1; k <= N; k++) {\n\n\t\t\t\tif (i == j || i == k || j == k) continue;\n\n\t\t\t\tdouble I1 = getangle(G[i] - G[j]);\n\n\t\t\t\tdouble I2 = getangle(G[k] - G[j]);\n\n\t\t\t\tAnswer = max(Answer, getangle2(I1, I2));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\n// O(N^2 log N) のアルゴリズム\n\ndouble solve_Fast() {\n\n\t// 点 B を全探索\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tdouble ret = solve(i);\n\n\t\tAnswer = max(Answer, ret);\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> G[i].px >> G[i].py;\n\n\t}\n\n\n\n\t// Step #2. 出力\n\n\tdouble FinalAns = solve_Fast();\n\n\tprintf(\"%.12lf\\n\", FinalAns);\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nfrom cmath import phase, pi\nfrom typing import List\nC = 2 * pi\nN = int(input())\nP: List[complex] = []\nfor _ in range(N):\n x, y = map(int, input().split())\n P.append(x + y * 1j)\nans = 0\nfor i in range(N):\n A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)\n now = 0\n for Aj in A:\n k = bisect_left(A, Aj + 180)\n r = A[k % len(A)] - Aj\n if r < 0: r += 360\n if r > 180: r = 360 - r\n l = A[k % len(A) - 1] - Aj\n if l < 0: l += 360\n if l > 180: l = 360 - l\n now = max(now, l, r)\n ans = max(ans, now)\nprint(ans)\n" }, { "id": 77, "name": "009", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nstruct Point {\n\n\tdouble px, py;\n\n};\n\n\n\nPoint operator-(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n\n}\n\n\n\ndouble getangle(Point G) {\n\n\t// 点 G の偏角を求める\n\n\tif (G.py >= 0.0) {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn kaku;\n\n\t}\n\n\telse {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn 360.0 - kaku;\n\n\t}\n\n}\n\n\n\ndouble getangle2(double I1, double I2) {\n\n\t// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める\n\n\t// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°\n\n\tdouble res = abs(I1 - I2);\n\n\tif (res >= 180.0) return 360.0 - res;\n\n\treturn res;\n\n}\n\n\n\nint N;\n\nPoint G[2009];\n\n\n\ndouble solve(int pos) {\n\n\t// 最初に偏角の昇順にソートする\n\n\tvector vec;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i == pos) continue;\n\n\t\tPoint SA = G[i] - G[pos];\n\n\t\tdouble angle = getangle(SA);\n\n\t\tvec.push_back(angle);\n\n\t}\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める\n\n\tdouble ret = 0.0;\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tdouble target = vec[i] + 180.0;\n\n\t\tif (target >= 360.0) target -= 360.0;\n\n\t\tint pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();\n\n\n\n\t\t// 点 C の候補は高々 2 つに絞れる\n\n\t\tint CandIdx1 = pos1 % vec.size();\n\n\t\tint CandIdx2 = (pos1 + vec.size() - 1) % vec.size();\n\n\t\tdouble Candidate1 = getangle2(vec[i], vec[CandIdx1]);\n\n\t\tdouble Candidate2 = getangle2(vec[i], vec[CandIdx2]);\n\n\t\tret = max({ ret, Candidate1, Candidate2 });\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\n// O(N^3) のアルゴリズム（点 A, B, C を全探索）\n\ndouble solve_Slow() {\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 1; j <= N; j++) {\n\n\t\t\tfor (int k = 1; k <= N; k++) {\n\n\t\t\t\tif (i == j || i == k || j == k) continue;\n\n\t\t\t\tdouble I1 = getangle(G[i] - G[j]);\n\n\t\t\t\tdouble I2 = getangle(G[k] - G[j]);\n\n\t\t\t\tAnswer = max(Answer, getangle2(I1, I2));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\n// O(N^2 log N) のアルゴリズム\n\ndouble solve_Fast() {\n\n\t// 点 B を全探索\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tdouble ret = solve(i);\n\n\t\tAnswer = max(Answer, ret);\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> G[i].px >> G[i].py;\n\n\t}\n\n\n\n\t// Step #2. 出力\n\n\tdouble FinalAns = solve_Fast();\n\n\tprintf(\"%.12lf\\n\", FinalAns);\n\n\treturn 0;\n\n}", "Ruby": "EPS = 1e-8\n\nn = readline.to_i\nz = Array.new(n) do\n x, y = readline.split.map(&:to_i)\n Complex(x, y)\nend\n\nans = 0\n\nfor z_i in z\n angles = z.reject { |z_j| z_j == z_i }.map do |z_j|\n (z_j - z_i).angle\n end\n angles.sort!\n\n max = angles[0]\n max_i = 0\n for min in angles\n while max - min < Math::PI + EPS do\n ans = max - min if ans < max - min\n max_i += 1\n if max_i < angles.size then\n max = angles[max_i]\n else\n max = angles[max_i % angles.size] + 2 * Math::PI\n end\n end\n end\nend\n\nputs ans / Math::PI * 180.0\n" }, { "id": 78, "name": "009", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nstruct Point {\n\n\tdouble px, py;\n\n};\n\n\n\nPoint operator-(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n\n}\n\n\n\ndouble getangle(Point G) {\n\n\t// 点 G の偏角を求める\n\n\tif (G.py >= 0.0) {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn kaku;\n\n\t}\n\n\telse {\n\n\t\tdouble I = G.px / sqrt(G.px * G.px + G.py * G.py);\n\n\t\tdouble kaku = acos(I) * 180.0 / 3.14159265358979;\n\n\t\treturn 360.0 - kaku;\n\n\t}\n\n}\n\n\n\ndouble getangle2(double I1, double I2) {\n\n\t// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める\n\n\t// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°\n\n\tdouble res = abs(I1 - I2);\n\n\tif (res >= 180.0) return 360.0 - res;\n\n\treturn res;\n\n}\n\n\n\nint N;\n\nPoint G[2009];\n\n\n\ndouble solve(int pos) {\n\n\t// 最初に偏角の昇順にソートする\n\n\tvector vec;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i == pos) continue;\n\n\t\tPoint SA = G[i] - G[pos];\n\n\t\tdouble angle = getangle(SA);\n\n\t\tvec.push_back(angle);\n\n\t}\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める\n\n\tdouble ret = 0.0;\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tdouble target = vec[i] + 180.0;\n\n\t\tif (target >= 360.0) target -= 360.0;\n\n\t\tint pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();\n\n\n\n\t\t// 点 C の候補は高々 2 つに絞れる\n\n\t\tint CandIdx1 = pos1 % vec.size();\n\n\t\tint CandIdx2 = (pos1 + vec.size() - 1) % vec.size();\n\n\t\tdouble Candidate1 = getangle2(vec[i], vec[CandIdx1]);\n\n\t\tdouble Candidate2 = getangle2(vec[i], vec[CandIdx2]);\n\n\t\tret = max({ ret, Candidate1, Candidate2 });\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\n// O(N^3) のアルゴリズム（点 A, B, C を全探索）\n\ndouble solve_Slow() {\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 1; j <= N; j++) {\n\n\t\t\tfor (int k = 1; k <= N; k++) {\n\n\t\t\t\tif (i == j || i == k || j == k) continue;\n\n\t\t\t\tdouble I1 = getangle(G[i] - G[j]);\n\n\t\t\t\tdouble I2 = getangle(G[k] - G[j]);\n\n\t\t\t\tAnswer = max(Answer, getangle2(I1, I2));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\n// O(N^2 log N) のアルゴリズム\n\ndouble solve_Fast() {\n\n\t// 点 B を全探索\n\n\tdouble Answer = 0.0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tdouble ret = solve(i);\n\n\t\tAnswer = max(Answer, ret);\n\n\t}\n\n\treturn Answer;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> G[i].px >> G[i].py;\n\n\t}\n\n\n\n\t// Step #2. 出力\n\n\tdouble FinalAns = solve_Fast();\n\n\tprintf(\"%.12lf\\n\", FinalAns);\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar x: []float :: #[n]float\n\tvar y: []float :: #[n]float\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputFloat()\n\t\tdo y[i] :: cui@inputFloat()\n\tend for\n\t\n\tvar ans: float :: 0.0\n\tfor i(0, n - 1)\n\t\tvar rots: []float :: #[n]float\n\t\tfor j(0, n - 1)\n\t\t\tif(i = j)\n\t\t\t\tif(i = 0)\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])\n\t\t\t\telse\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])\n\t\t\tend if\n\t\tend for\n\t\tdo rots.sort()\n\t\tvar rots2: []float :: #[2 * n]float\n\t\tfor j(0, n - 1)\n\t\t\tdo rots2[j] :: rots[j]\n\t\tend for\n\t\tfor j(n, 2 * n - 1)\n\t\t\tdo rots2[j] :: rots[j - n] + 2.0 * lib@pi\n\t\tend for\n\t\tfor j(0, n - 1)\n\t\t\tvar target: float :: rots[j] + lib@pi\n\t\t\tvar ok: int :: j\n\t\t\tvar ng: int :: j + n\n\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\tif(rots2[mid] <= target)\n\t\t\t\t\tdo ok :: mid\n\t\t\t\telse\n\t\t\t\t\tdo ng :: mid\n\t\t\t\tend if\n\t\t\tend while\n\t\t\tdo ans :: [ans, f(rots2[ok] - rots[j])].max()\n\t\t\tdo ans :: [ans, f(rots2[ok + 1] - rots[j])].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{lib@toDegree(ans)}\\n\")\n\t\n\tfunc f(t: float): float\n\t\tif(t > lib@pi)\n\t\t\tdo t :: 2.0 * lib@pi - t\n\t\tend if\n\t\tret t\n\tend func\nend func\n" }, { "id": 79, "name": "009", "Crystal": "# 0.36.0 以降は Math::TAU があります\nTAU = Math::PI * 2\nn = read_line.to_i\nxy = (1..n).map {\n {Int32, Int32}.from read_line.split.map(&.to_i)\n}\nputs (0...n).max_of { |i|\n angle = (0...n).select { |j| i != j }.map { |j|\n Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])\n }\n angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort\n angle.max_of { |a|\n index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!\n {angles[index - 1], angles[index]}.max_of { |b|\n res = (b - a) % TAU\n res > Math::PI ? Math::PI - res : res\n }\n }\n} * 360 / TAU\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nfrom cmath import phase, pi\nfrom typing import List\nC = 2 * pi\nN = int(input())\nP: List[complex] = []\nfor _ in range(N):\n x, y = map(int, input().split())\n P.append(x + y * 1j)\nans = 0\nfor i in range(N):\n A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)\n now = 0\n for Aj in A:\n k = bisect_left(A, Aj + 180)\n r = A[k % len(A)] - Aj\n if r < 0: r += 360\n if r > 180: r = 360 - r\n l = A[k % len(A) - 1] - Aj\n if l < 0: l += 360\n if l > 180: l = 360 - l\n now = max(now, l, r)\n ans = max(ans, now)\nprint(ans)\n" }, { "id": 80, "name": "009", "Crystal": "# 0.36.0 以降は Math::TAU があります\nTAU = Math::PI * 2\nn = read_line.to_i\nxy = (1..n).map {\n {Int32, Int32}.from read_line.split.map(&.to_i)\n}\nputs (0...n).max_of { |i|\n angle = (0...n).select { |j| i != j }.map { |j|\n Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])\n }\n angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort\n angle.max_of { |a|\n index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!\n {angles[index - 1], angles[index]}.max_of { |b|\n res = (b - a) % TAU\n res > Math::PI ? Math::PI - res : res\n }\n }\n} * 360 / TAU\n", "Ruby": "EPS = 1e-8\n\nn = readline.to_i\nz = Array.new(n) do\n x, y = readline.split.map(&:to_i)\n Complex(x, y)\nend\n\nans = 0\n\nfor z_i in z\n angles = z.reject { |z_j| z_j == z_i }.map do |z_j|\n (z_j - z_i).angle\n end\n angles.sort!\n\n max = angles[0]\n max_i = 0\n for min in angles\n while max - min < Math::PI + EPS do\n ans = max - min if ans < max - min\n max_i += 1\n if max_i < angles.size then\n max = angles[max_i]\n else\n max = angles[max_i % angles.size] + 2 * Math::PI\n end\n end\n end\nend\n\nputs ans / Math::PI * 180.0\n" }, { "id": 81, "name": "009", "Crystal": "# 0.36.0 以降は Math::TAU があります\nTAU = Math::PI * 2\nn = read_line.to_i\nxy = (1..n).map {\n {Int32, Int32}.from read_line.split.map(&.to_i)\n}\nputs (0...n).max_of { |i|\n angle = (0...n).select { |j| i != j }.map { |j|\n Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])\n }\n angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort\n angle.max_of { |a|\n index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!\n {angles[index - 1], angles[index]}.max_of { |b|\n res = (b - a) % TAU\n res > Math::PI ? Math::PI - res : res\n }\n }\n} * 360 / TAU\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar x: []float :: #[n]float\n\tvar y: []float :: #[n]float\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputFloat()\n\t\tdo y[i] :: cui@inputFloat()\n\tend for\n\t\n\tvar ans: float :: 0.0\n\tfor i(0, n - 1)\n\t\tvar rots: []float :: #[n]float\n\t\tfor j(0, n - 1)\n\t\t\tif(i = j)\n\t\t\t\tif(i = 0)\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])\n\t\t\t\telse\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])\n\t\t\tend if\n\t\tend for\n\t\tdo rots.sort()\n\t\tvar rots2: []float :: #[2 * n]float\n\t\tfor j(0, n - 1)\n\t\t\tdo rots2[j] :: rots[j]\n\t\tend for\n\t\tfor j(n, 2 * n - 1)\n\t\t\tdo rots2[j] :: rots[j - n] + 2.0 * lib@pi\n\t\tend for\n\t\tfor j(0, n - 1)\n\t\t\tvar target: float :: rots[j] + lib@pi\n\t\t\tvar ok: int :: j\n\t\t\tvar ng: int :: j + n\n\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\tif(rots2[mid] <= target)\n\t\t\t\t\tdo ok :: mid\n\t\t\t\telse\n\t\t\t\t\tdo ng :: mid\n\t\t\t\tend if\n\t\t\tend while\n\t\t\tdo ans :: [ans, f(rots2[ok] - rots[j])].max()\n\t\t\tdo ans :: [ans, f(rots2[ok + 1] - rots[j])].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{lib@toDegree(ans)}\\n\")\n\t\n\tfunc f(t: float): float\n\t\tif(t > lib@pi)\n\t\t\tdo t :: 2.0 * lib@pi - t\n\t\tend if\n\t\tret t\n\tend func\nend func\n" }, { "id": 82, "name": "009", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nfrom cmath import phase, pi\nfrom typing import List\nC = 2 * pi\nN = int(input())\nP: List[complex] = []\nfor _ in range(N):\n x, y = map(int, input().split())\n P.append(x + y * 1j)\nans = 0\nfor i in range(N):\n A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)\n now = 0\n for Aj in A:\n k = bisect_left(A, Aj + 180)\n r = A[k % len(A)] - Aj\n if r < 0: r += 360\n if r > 180: r = 360 - r\n l = A[k % len(A) - 1] - Aj\n if l < 0: l += 360\n if l > 180: l = 360 - l\n now = max(now, l, r)\n ans = max(ans, now)\nprint(ans)\n", "Ruby": "EPS = 1e-8\n\nn = readline.to_i\nz = Array.new(n) do\n x, y = readline.split.map(&:to_i)\n Complex(x, y)\nend\n\nans = 0\n\nfor z_i in z\n angles = z.reject { |z_j| z_j == z_i }.map do |z_j|\n (z_j - z_i).angle\n end\n angles.sort!\n\n max = angles[0]\n max_i = 0\n for min in angles\n while max - min < Math::PI + EPS do\n ans = max - min if ans < max - min\n max_i += 1\n if max_i < angles.size then\n max = angles[max_i]\n else\n max = angles[max_i % angles.size] + 2 * Math::PI\n end\n end\n end\nend\n\nputs ans / Math::PI * 180.0\n" }, { "id": 83, "name": "009", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom bisect import bisect_left\nfrom cmath import phase, pi\nfrom typing import List\nC = 2 * pi\nN = int(input())\nP: List[complex] = []\nfor _ in range(N):\n x, y = map(int, input().split())\n P.append(x + y * 1j)\nans = 0\nfor i in range(N):\n A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)\n now = 0\n for Aj in A:\n k = bisect_left(A, Aj + 180)\n r = A[k % len(A)] - Aj\n if r < 0: r += 360\n if r > 180: r = 360 - r\n l = A[k % len(A) - 1] - Aj\n if l < 0: l += 360\n if l > 180: l = 360 - l\n now = max(now, l, r)\n ans = max(ans, now)\nprint(ans)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar x: []float :: #[n]float\n\tvar y: []float :: #[n]float\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputFloat()\n\t\tdo y[i] :: cui@inputFloat()\n\tend for\n\t\n\tvar ans: float :: 0.0\n\tfor i(0, n - 1)\n\t\tvar rots: []float :: #[n]float\n\t\tfor j(0, n - 1)\n\t\t\tif(i = j)\n\t\t\t\tif(i = 0)\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])\n\t\t\t\telse\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])\n\t\t\tend if\n\t\tend for\n\t\tdo rots.sort()\n\t\tvar rots2: []float :: #[2 * n]float\n\t\tfor j(0, n - 1)\n\t\t\tdo rots2[j] :: rots[j]\n\t\tend for\n\t\tfor j(n, 2 * n - 1)\n\t\t\tdo rots2[j] :: rots[j - n] + 2.0 * lib@pi\n\t\tend for\n\t\tfor j(0, n - 1)\n\t\t\tvar target: float :: rots[j] + lib@pi\n\t\t\tvar ok: int :: j\n\t\t\tvar ng: int :: j + n\n\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\tif(rots2[mid] <= target)\n\t\t\t\t\tdo ok :: mid\n\t\t\t\telse\n\t\t\t\t\tdo ng :: mid\n\t\t\t\tend if\n\t\t\tend while\n\t\t\tdo ans :: [ans, f(rots2[ok] - rots[j])].max()\n\t\t\tdo ans :: [ans, f(rots2[ok + 1] - rots[j])].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{lib@toDegree(ans)}\\n\")\n\t\n\tfunc f(t: float): float\n\t\tif(t > lib@pi)\n\t\t\tdo t :: 2.0 * lib@pi - t\n\t\tend if\n\t\tret t\n\tend func\nend func\n" }, { "id": 84, "name": "009", "Ruby": "EPS = 1e-8\n\nn = readline.to_i\nz = Array.new(n) do\n x, y = readline.split.map(&:to_i)\n Complex(x, y)\nend\n\nans = 0\n\nfor z_i in z\n angles = z.reject { |z_j| z_j == z_i }.map do |z_j|\n (z_j - z_i).angle\n end\n angles.sort!\n\n max = angles[0]\n max_i = 0\n for min in angles\n while max - min < Math::PI + EPS do\n ans = max - min if ans < max - min\n max_i += 1\n if max_i < angles.size then\n max = angles[max_i]\n else\n max = angles[max_i % angles.size] + 2 * Math::PI\n end\n end\n end\nend\n\nputs ans / Math::PI * 180.0\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar x: []float :: #[n]float\n\tvar y: []float :: #[n]float\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputFloat()\n\t\tdo y[i] :: cui@inputFloat()\n\tend for\n\t\n\tvar ans: float :: 0.0\n\tfor i(0, n - 1)\n\t\tvar rots: []float :: #[n]float\n\t\tfor j(0, n - 1)\n\t\t\tif(i = j)\n\t\t\t\tif(i = 0)\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])\n\t\t\t\telse\n\t\t\t\t\tdo rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tdo rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])\n\t\t\tend if\n\t\tend for\n\t\tdo rots.sort()\n\t\tvar rots2: []float :: #[2 * n]float\n\t\tfor j(0, n - 1)\n\t\t\tdo rots2[j] :: rots[j]\n\t\tend for\n\t\tfor j(n, 2 * n - 1)\n\t\t\tdo rots2[j] :: rots[j - n] + 2.0 * lib@pi\n\t\tend for\n\t\tfor j(0, n - 1)\n\t\t\tvar target: float :: rots[j] + lib@pi\n\t\t\tvar ok: int :: j\n\t\t\tvar ng: int :: j + n\n\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\tif(rots2[mid] <= target)\n\t\t\t\t\tdo ok :: mid\n\t\t\t\telse\n\t\t\t\t\tdo ng :: mid\n\t\t\t\tend if\n\t\t\tend while\n\t\t\tdo ans :: [ans, f(rots2[ok] - rots[j])].max()\n\t\t\tdo ans :: [ans, f(rots2[ok + 1] - rots[j])].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{lib@toDegree(ans)}\\n\")\n\t\n\tfunc f(t: float): float\n\t\tif(t > lib@pi)\n\t\t\tdo t :: 2.0 * lib@pi - t\n\t\tend if\n\t\tret t\n\tend func\nend func\n" }, { "id": 85, "name": "010", "C++": "#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint C[100009], P[100009];\n\nint Q;\n\nint L[100009], R[100009];\n\n\n\n// 累積和\n\nint Sum1[100009];\n\nint Sum2[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> C[i] >> P[i];\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. 1 組・2 組それぞれの累積和を取る\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tSum1[i] = Sum1[i - 1];\n\n\t\tSum2[i] = Sum2[i - 1];\n\n\t\tif (C[i] == 1) Sum1[i] += P[i];\n\n\t\tif (C[i] == 2) Sum2[i] += P[i];\n\n\t}\n\n\n\n\t// Step #3. クエリに答える\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tint Answer1 = Sum1[R[i]] - Sum1[L[i] - 1];\n\n\t\tint Answer2 = Sum2[R[i]] - Sum2[L[i] - 1];\n\n\t\tcout << Answer1 << \" \" << Answer2 << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n = read_line.to_i\nsums = {0, 1}.map { [0] * n.succ }\nn.times do |i|\n c, p = read_line.split.map(&.to_i)\n sums.each { |sum| sum[i + 1] += sum[i] }\n sums[c - 1][i + 1] += p\nend\nread_line.to_i.times do\n l, r = read_line.split.map(&.to_i)\n puts sums.join(' ') { |sum| sum[r] - sum[l - 1] }\nend\n" }, { "id": 86, "name": "010", "C++": "#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint C[100009], P[100009];\n\nint Q;\n\nint L[100009], R[100009];\n\n\n\n// 累積和\n\nint Sum1[100009];\n\nint Sum2[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> C[i] >> P[i];\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. 1 組・2 組それぞれの累積和を取る\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tSum1[i] = Sum1[i - 1];\n\n\t\tSum2[i] = Sum2[i - 1];\n\n\t\tif (C[i] == 1) Sum1[i] += P[i];\n\n\t\tif (C[i] == 2) Sum2[i] += P[i];\n\n\t}\n\n\n\n\t// Step #3. クエリに答える\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tint Answer1 = Sum1[R[i]] - Sum1[L[i] - 1];\n\n\t\tint Answer2 = Sum2[R[i]] - Sum2[L[i] - 1];\n\n\t\tcout << Answer1 << \" \" << Answer2 << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nS = [[0] * (N + 1) for _ in range(2)]\nfor i in range(N):\n c, p = map(int, input().split())\n S[c - 1][i + 1] = p\nfor i in range(N):\n for j in range(2):\n S[j][i + 1] += S[j][i]\nQ = int(input())\nLR = [tuple(map(int, input().split())) for _ in range(Q)]\nfor l, r in LR:\n print(S[0][r] - S[0][l - 1], S[1][r] - S[1][l - 1])\n" }, { "id": 87, "name": "010", "C++": "#include \n\nusing namespace std;\n\n\n\n// 入力\n\nint N;\n\nint C[100009], P[100009];\n\nint Q;\n\nint L[100009], R[100009];\n\n\n\n// 累積和\n\nint Sum1[100009];\n\nint Sum2[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> C[i] >> P[i];\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. 1 組・2 組それぞれの累積和を取る\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tSum1[i] = Sum1[i - 1];\n\n\t\tSum2[i] = Sum2[i - 1];\n\n\t\tif (C[i] == 1) Sum1[i] += P[i];\n\n\t\tif (C[i] == 2) Sum2[i] += P[i];\n\n\t}\n\n\n\n\t// Step #3. クエリに答える\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tint Answer1 = Sum1[R[i]] - Sum1[L[i] - 1];\n\n\t\tint Answer2 = Sum2[R[i]] - Sum2[L[i] - 1];\n\n\t\tcout << Answer1 << \" \" << Answer2 << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar cum1: []int :: #[n + 1]int\n\tvar cum2: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tvar c: int :: cui@inputInt()\n\t\tvar p: int :: cui@inputInt()\n\t\tdo cum1[i + 1] :: cum1[i]\n\t\tdo cum2[i + 1] :: cum2[i]\n\t\tif(c = 1)\n\t\t\tdo cum1[i + 1] :+ p\n\t\telse\n\t\t\tdo cum2[i + 1] :+ p\n\t\tend if\n\tend for\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt()\n\t\tdo cui@print(\"\\{cum1[r] - cum1[l]} \\{cum2[r] - cum2[l]}\\n\")\n\tend for\nend func\n" }, { "id": 88, "name": "010", "Crystal": "n = read_line.to_i\nsums = {0, 1}.map { [0] * n.succ }\nn.times do |i|\n c, p = read_line.split.map(&.to_i)\n sums.each { |sum| sum[i + 1] += sum[i] }\n sums[c - 1][i + 1] += p\nend\nread_line.to_i.times do\n l, r = read_line.split.map(&.to_i)\n puts sums.join(' ') { |sum| sum[r] - sum[l - 1] }\nend\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nS = [[0] * (N + 1) for _ in range(2)]\nfor i in range(N):\n c, p = map(int, input().split())\n S[c - 1][i + 1] = p\nfor i in range(N):\n for j in range(2):\n S[j][i + 1] += S[j][i]\nQ = int(input())\nLR = [tuple(map(int, input().split())) for _ in range(Q)]\nfor l, r in LR:\n print(S[0][r] - S[0][l - 1], S[1][r] - S[1][l - 1])\n" }, { "id": 89, "name": "010", "Crystal": "n = read_line.to_i\nsums = {0, 1}.map { [0] * n.succ }\nn.times do |i|\n c, p = read_line.split.map(&.to_i)\n sums.each { |sum| sum[i + 1] += sum[i] }\n sums[c - 1][i + 1] += p\nend\nread_line.to_i.times do\n l, r = read_line.split.map(&.to_i)\n puts sums.join(' ') { |sum| sum[r] - sum[l - 1] }\nend\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar cum1: []int :: #[n + 1]int\n\tvar cum2: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tvar c: int :: cui@inputInt()\n\t\tvar p: int :: cui@inputInt()\n\t\tdo cum1[i + 1] :: cum1[i]\n\t\tdo cum2[i + 1] :: cum2[i]\n\t\tif(c = 1)\n\t\t\tdo cum1[i + 1] :+ p\n\t\telse\n\t\t\tdo cum2[i + 1] :+ p\n\t\tend if\n\tend for\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt()\n\t\tdo cui@print(\"\\{cum1[r] - cum1[l]} \\{cum2[r] - cum2[l]}\\n\")\n\tend for\nend func\n" }, { "id": 90, "name": "010", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nS = [[0] * (N + 1) for _ in range(2)]\nfor i in range(N):\n c, p = map(int, input().split())\n S[c - 1][i + 1] = p\nfor i in range(N):\n for j in range(2):\n S[j][i + 1] += S[j][i]\nQ = int(input())\nLR = [tuple(map(int, input().split())) for _ in range(Q)]\nfor l, r in LR:\n print(S[0][r] - S[0][l - 1], S[1][r] - S[1][l - 1])\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar cum1: []int :: #[n + 1]int\n\tvar cum2: []int :: #[n + 1]int\n\tfor i(0, n - 1)\n\t\tvar c: int :: cui@inputInt()\n\t\tvar p: int :: cui@inputInt()\n\t\tdo cum1[i + 1] :: cum1[i]\n\t\tdo cum2[i + 1] :: cum2[i]\n\t\tif(c = 1)\n\t\t\tdo cum1[i + 1] :+ p\n\t\telse\n\t\t\tdo cum2[i + 1] :+ p\n\t\tend if\n\tend for\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt()\n\t\tdo cui@print(\"\\{cum1[r] - cum1[l]} \\{cum2[r] - cum2[l]}\\n\")\n\tend for\nend func\n" }, { "id": 91, "name": "011", "C++": "#include \n#include \n#include \n#include \nusing ll = long long;\nusing namespace std;\ntemplate\nT &chmax(T &a, const U &b){ if(a < b) a = b; return a; }\n\n//43[ms]\nint main(){\n int n;\n cin >> n;\n vector> v(n);\n for(int i = 0; i < n; i++){\n int d,c,s;\n cin >> d >> c >> s;\n v[i] = {d,c,s};\n }\n sort(v.begin(), v.end());\n vector cur(5001), next(5001);\n for(int i = 0; i < n; i++){\n int d,c,s;\n tie(d,c,s) = v[i];\n for(int j = 0; j <= 5000; j++){\n next[j] = cur[j];\n if(j > d || j < c) continue;\n chmax(next[j], cur[j - c] + s);\n }\n swap(cur, next);\n }\n ll ans = 0;\n for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);\n cout << ans << \"\\n\";\n}", "Crystal": "n = read_line.to_i\ndcs = (1..n).map {\n read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }\n}.sort\nday = dcs.max_of { |(d, c, s)| d }\n\nputs dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|\n (c..d).reverse_each do |i|\n dp[i] = {dp[i], dp[i - c] + s}.max\n end\n (0...day).each do |i|\n dp[i + 1] = {dp[i + 1], dp[i]}.max\n end\n}.max\n" }, { "id": 92, "name": "011", "C++": "#include \n#include \n#include \n#include \nusing ll = long long;\nusing namespace std;\ntemplate\nT &chmax(T &a, const U &b){ if(a < b) a = b; return a; }\n\n//43[ms]\nint main(){\n int n;\n cin >> n;\n vector> v(n);\n for(int i = 0; i < n; i++){\n int d,c,s;\n cin >> d >> c >> s;\n v[i] = {d,c,s};\n }\n sort(v.begin(), v.end());\n vector cur(5001), next(5001);\n for(int i = 0; i < n; i++){\n int d,c,s;\n tie(d,c,s) = v[i];\n for(int j = 0; j <= 5000; j++){\n next[j] = cur[j];\n if(j > d || j < c) continue;\n chmax(next[j], cur[j - c] + s);\n }\n swap(cur, next);\n }\n ll ans = 0;\n for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);\n cout << ans << \"\\n\";\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N = int(input())\n DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])\n M = max(d for d, c, s in DCS)\n dp = [[0] * (M + 1) for _ in range(N + 1)]\n for i in range(N):\n d, c, s = DCS[i]\n for j in range(M + 1):\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\n if j + c > d: continue\n dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)\n print(max(dp[N]))\n\nif __name__ == '__main__':\n main()\n" }, { "id": 93, "name": "011", "C++": "#include \n#include \n#include \n#include \nusing ll = long long;\nusing namespace std;\ntemplate\nT &chmax(T &a, const U &b){ if(a < b) a = b; return a; }\n\n//43[ms]\nint main(){\n int n;\n cin >> n;\n vector> v(n);\n for(int i = 0; i < n; i++){\n int d,c,s;\n cin >> d >> c >> s;\n v[i] = {d,c,s};\n }\n sort(v.begin(), v.end());\n vector cur(5001), next(5001);\n for(int i = 0; i < n; i++){\n int d,c,s;\n tie(d,c,s) = v[i];\n for(int j = 0; j <= 5000; j++){\n next[j] = cur[j];\n if(j > d || j < c) continue;\n chmax(next[j], cur[j - c] + s);\n }\n swap(cur, next);\n }\n ll ans = 0;\n for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);\n cout << ans << \"\\n\";\n}", "Ruby": "Task = Struct.new(:d, :c, :s)\n\nn = readline.to_i\ntasks = Array.new(n) do\n Task.new(*readline.split.map(&:to_i))\nend\n\ntasks.sort_by! { |t| -t.d }\nprofit = [0] * 5001\n\nfor t in tasks\n d, c, s = t.d, t.c, t.s\n for k in 0..(d - c)\n profit[k] = [profit[k], profit[k + c] + s].max\n end\nend\n\nputs profit[0]\n" }, { "id": 94, "name": "011", "C++": "#include \n#include \n#include \n#include \nusing ll = long long;\nusing namespace std;\ntemplate\nT &chmax(T &a, const U &b){ if(a < b) a = b; return a; }\n\n//43[ms]\nint main(){\n int n;\n cin >> n;\n vector> v(n);\n for(int i = 0; i < n; i++){\n int d,c,s;\n cin >> d >> c >> s;\n v[i] = {d,c,s};\n }\n sort(v.begin(), v.end());\n vector cur(5001), next(5001);\n for(int i = 0; i < n; i++){\n int d,c,s;\n tie(d,c,s) = v[i];\n for(int j = 0; j <= 5000; j++){\n next[j] = cur[j];\n if(j > d || j < c) continue;\n chmax(next[j], cur[j - c] + s);\n }\n swap(cur, next);\n }\n ll ans = 0;\n for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);\n cout << ans << \"\\n\";\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar works: []Work :: #[n]Work\n\tvar dMax: int :: 0\n\tfor i(0, n - 1)\n\t\tvar d: int :: cui@inputInt()\n\t\tvar c: int :: cui@inputInt()\n\t\tvar s: int :: cui@inputInt()\n\t\tdo works[i] :: (#Work).init(d, c, s)\n\t\tdo dMax :: [dMax, d].max()\n\tend for\n\tdo works.sort()\n\t\n\t; dp[仕事番号][合計仕事時間] = 合計金額\n\tvar dp: [][]int :: #[n + 1, dMax + 1]int\n\t; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。\n\tdo dp[0][0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, dMax)\n\t\t\tvar d: int :: works[i].d\n\t\t\tvar c: int :: works[i].c\n\t\t\tvar s: int :: works[i].s\n\t\t\tif(j + c <= d)\n\t\t\t\tdo dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()\n\t\t\tend if\n\t\t\tdo dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()\n\t\tend for\n\tend for\n\tvar ans: int :: 0\n\tfor j(0, dMax)\n\t\tdo ans :: [ans, dp[n][j]].max()\n\tend for\n\tdo ans :- 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Work()\n\t\t+var d: int\n\t\t+var c: int\n\t\t+var s: int\n\t\t+func init(d: int, c: int, s: int): Work\n\t\t\tdo me.d :: d\n\t\t\tdo me.c :: c\n\t\t\tdo me.s :: s\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.d < (t $ Work).d)\n\t\t\t\tret - 1\n\t\t\telif(me.d > (t $ Work).d)\n\t\t\t\tret 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n" }, { "id": 95, "name": "011", "Crystal": "n = read_line.to_i\ndcs = (1..n).map {\n read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }\n}.sort\nday = dcs.max_of { |(d, c, s)| d }\n\nputs dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|\n (c..d).reverse_each do |i|\n dp[i] = {dp[i], dp[i - c] + s}.max\n end\n (0...day).each do |i|\n dp[i + 1] = {dp[i + 1], dp[i]}.max\n end\n}.max\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N = int(input())\n DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])\n M = max(d for d, c, s in DCS)\n dp = [[0] * (M + 1) for _ in range(N + 1)]\n for i in range(N):\n d, c, s = DCS[i]\n for j in range(M + 1):\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\n if j + c > d: continue\n dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)\n print(max(dp[N]))\n\nif __name__ == '__main__':\n main()\n" }, { "id": 96, "name": "011", "Crystal": "n = read_line.to_i\ndcs = (1..n).map {\n read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }\n}.sort\nday = dcs.max_of { |(d, c, s)| d }\n\nputs dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|\n (c..d).reverse_each do |i|\n dp[i] = {dp[i], dp[i - c] + s}.max\n end\n (0...day).each do |i|\n dp[i + 1] = {dp[i + 1], dp[i]}.max\n end\n}.max\n", "Ruby": "Task = Struct.new(:d, :c, :s)\n\nn = readline.to_i\ntasks = Array.new(n) do\n Task.new(*readline.split.map(&:to_i))\nend\n\ntasks.sort_by! { |t| -t.d }\nprofit = [0] * 5001\n\nfor t in tasks\n d, c, s = t.d, t.c, t.s\n for k in 0..(d - c)\n profit[k] = [profit[k], profit[k + c] + s].max\n end\nend\n\nputs profit[0]\n" }, { "id": 97, "name": "011", "Crystal": "n = read_line.to_i\ndcs = (1..n).map {\n read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }\n}.sort\nday = dcs.max_of { |(d, c, s)| d }\n\nputs dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|\n (c..d).reverse_each do |i|\n dp[i] = {dp[i], dp[i - c] + s}.max\n end\n (0...day).each do |i|\n dp[i + 1] = {dp[i + 1], dp[i]}.max\n end\n}.max\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar works: []Work :: #[n]Work\n\tvar dMax: int :: 0\n\tfor i(0, n - 1)\n\t\tvar d: int :: cui@inputInt()\n\t\tvar c: int :: cui@inputInt()\n\t\tvar s: int :: cui@inputInt()\n\t\tdo works[i] :: (#Work).init(d, c, s)\n\t\tdo dMax :: [dMax, d].max()\n\tend for\n\tdo works.sort()\n\t\n\t; dp[仕事番号][合計仕事時間] = 合計金額\n\tvar dp: [][]int :: #[n + 1, dMax + 1]int\n\t; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。\n\tdo dp[0][0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, dMax)\n\t\t\tvar d: int :: works[i].d\n\t\t\tvar c: int :: works[i].c\n\t\t\tvar s: int :: works[i].s\n\t\t\tif(j + c <= d)\n\t\t\t\tdo dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()\n\t\t\tend if\n\t\t\tdo dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()\n\t\tend for\n\tend for\n\tvar ans: int :: 0\n\tfor j(0, dMax)\n\t\tdo ans :: [ans, dp[n][j]].max()\n\tend for\n\tdo ans :- 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Work()\n\t\t+var d: int\n\t\t+var c: int\n\t\t+var s: int\n\t\t+func init(d: int, c: int, s: int): Work\n\t\t\tdo me.d :: d\n\t\t\tdo me.c :: c\n\t\t\tdo me.s :: s\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.d < (t $ Work).d)\n\t\t\t\tret - 1\n\t\t\telif(me.d > (t $ Work).d)\n\t\t\t\tret 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n" }, { "id": 98, "name": "011", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N = int(input())\n DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])\n M = max(d for d, c, s in DCS)\n dp = [[0] * (M + 1) for _ in range(N + 1)]\n for i in range(N):\n d, c, s = DCS[i]\n for j in range(M + 1):\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\n if j + c > d: continue\n dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)\n print(max(dp[N]))\n\nif __name__ == '__main__':\n main()\n", "Ruby": "Task = Struct.new(:d, :c, :s)\n\nn = readline.to_i\ntasks = Array.new(n) do\n Task.new(*readline.split.map(&:to_i))\nend\n\ntasks.sort_by! { |t| -t.d }\nprofit = [0] * 5001\n\nfor t in tasks\n d, c, s = t.d, t.c, t.s\n for k in 0..(d - c)\n profit[k] = [profit[k], profit[k + c] + s].max\n end\nend\n\nputs profit[0]\n" }, { "id": 99, "name": "011", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N = int(input())\n DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])\n M = max(d for d, c, s in DCS)\n dp = [[0] * (M + 1) for _ in range(N + 1)]\n for i in range(N):\n d, c, s = DCS[i]\n for j in range(M + 1):\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\n if j + c > d: continue\n dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)\n print(max(dp[N]))\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar works: []Work :: #[n]Work\n\tvar dMax: int :: 0\n\tfor i(0, n - 1)\n\t\tvar d: int :: cui@inputInt()\n\t\tvar c: int :: cui@inputInt()\n\t\tvar s: int :: cui@inputInt()\n\t\tdo works[i] :: (#Work).init(d, c, s)\n\t\tdo dMax :: [dMax, d].max()\n\tend for\n\tdo works.sort()\n\t\n\t; dp[仕事番号][合計仕事時間] = 合計金額\n\tvar dp: [][]int :: #[n + 1, dMax + 1]int\n\t; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。\n\tdo dp[0][0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, dMax)\n\t\t\tvar d: int :: works[i].d\n\t\t\tvar c: int :: works[i].c\n\t\t\tvar s: int :: works[i].s\n\t\t\tif(j + c <= d)\n\t\t\t\tdo dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()\n\t\t\tend if\n\t\t\tdo dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()\n\t\tend for\n\tend for\n\tvar ans: int :: 0\n\tfor j(0, dMax)\n\t\tdo ans :: [ans, dp[n][j]].max()\n\tend for\n\tdo ans :- 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Work()\n\t\t+var d: int\n\t\t+var c: int\n\t\t+var s: int\n\t\t+func init(d: int, c: int, s: int): Work\n\t\t\tdo me.d :: d\n\t\t\tdo me.c :: c\n\t\t\tdo me.s :: s\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.d < (t $ Work).d)\n\t\t\t\tret - 1\n\t\t\telif(me.d > (t $ Work).d)\n\t\t\t\tret 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n" }, { "id": 100, "name": "011", "Ruby": "Task = Struct.new(:d, :c, :s)\n\nn = readline.to_i\ntasks = Array.new(n) do\n Task.new(*readline.split.map(&:to_i))\nend\n\ntasks.sort_by! { |t| -t.d }\nprofit = [0] * 5001\n\nfor t in tasks\n d, c, s = t.d, t.c, t.s\n for k in 0..(d - c)\n profit[k] = [profit[k], profit[k + c] + s].max\n end\nend\n\nputs profit[0]\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar works: []Work :: #[n]Work\n\tvar dMax: int :: 0\n\tfor i(0, n - 1)\n\t\tvar d: int :: cui@inputInt()\n\t\tvar c: int :: cui@inputInt()\n\t\tvar s: int :: cui@inputInt()\n\t\tdo works[i] :: (#Work).init(d, c, s)\n\t\tdo dMax :: [dMax, d].max()\n\tend for\n\tdo works.sort()\n\t\n\t; dp[仕事番号][合計仕事時間] = 合計金額\n\tvar dp: [][]int :: #[n + 1, dMax + 1]int\n\t; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。\n\tdo dp[0][0] :: 1\n\tfor i(0, n - 1)\n\t\tfor j(0, dMax)\n\t\t\tvar d: int :: works[i].d\n\t\t\tvar c: int :: works[i].c\n\t\t\tvar s: int :: works[i].s\n\t\t\tif(j + c <= d)\n\t\t\t\tdo dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()\n\t\t\tend if\n\t\t\tdo dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()\n\t\tend for\n\tend for\n\tvar ans: int :: 0\n\tfor j(0, dMax)\n\t\tdo ans :: [ans, dp[n][j]].max()\n\tend for\n\tdo ans :- 1\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Work()\n\t\t+var d: int\n\t\t+var c: int\n\t\t+var s: int\n\t\t+func init(d: int, c: int, s: int): Work\n\t\t\tdo me.d :: d\n\t\t\tdo me.c :: c\n\t\t\tdo me.s :: s\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.d < (t $ Work).d)\n\t\t\t\tret - 1\n\t\t\telif(me.d > (t $ Work).d)\n\t\t\t\tret 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n" }, { "id": 101, "name": "012", "C++": "#include \n\n#include \n\n\n\n#define rep(i,n) for(int i=0;i < (n);i++)\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(),(a).end()\n\n\n\ntypedef long long ll;\n\n\n\nusing namespace std;\n\nusing namespace atcoder;\n\n\n\nint i,j,k,tmp;\n\nint ans = 0;\n\n\n\nint main()\n\n{\n\n\tcin.tie(0);\tios::sync_with_stdio(false);\n\n\tint H, W, Q; cin >> H >> W >> Q;\n\n\tint P[H][W]; rep(i,H){rep(j,W){P[i][j] = 0;}}\n\n\tdsu d(H * W);\n\n\n\n\trep(i, Q){\n\n\t\tint t; cin >> t;\n\n\t\tif(t == 1){\n\n\t\t\tint r, c; cin >> r >> c; r--; c--;\n\n\t\t\tint now = r * W + c;\n\n\t\t\tP[r][c] = 1;\n\n\t\t\tif(r > 0){if(P[r-1][c] == 1){d.merge(now, now - W);}}\n\n\t\t\tif(r < H-1){if(P[r+1][c] == 1){d.merge(now, now + W);}}\n\n\t\t\tif(c > 0){if(P[r][c-1] == 1){d.merge(now, now - 1);}}\n\n\t\t\tif(c < W-1){if(P[r][c+1] == 1){d.merge(now, now + 1);}}\n\n\t\t}\n\n\t\telse{\n\n\t\t\tint ra, ca, rb, cb;\n\n\t\t\tcin >> ra >> ca >> rb >> cb;\n\n\t\t\tra--; ca--; rb--; cb--;\n\n\t\t\tint posa = ra * W + ca;\n\n\t\t\tint posb = rb * W + cb;\n\n\t\t\tif(P[ra][ca] == 1 && P[rb][cb] == 1 && d.same(posa, posb) == true){\n\n\t\t\t\tcout << \"Yes\" << endl;\n\n\t\t\t}\n\n\t\t\telse{cout << \"No\" << endl;}\n\n\t\t}\n\n\t}\n\n\n\n return 0;\n\n}", "Crystal": "class UnionFind\n @d : Array(Int32)\n\n def initialize(n : Int32)\n @d = Array.new(n, -1)\n end\n\n def root(x : Int32)\n @d[x] < 0 ? x : (@d[x] = root(@d[x]))\n end\n\n def unite(x : Int32, y : Int32)\n x = root(x)\n y = root(y)\n return false if x == y\n x, y = y, x if @d[x] > @d[y]\n @d[x] += @d[y]\n @d[y] = x\n true\n end\n\n def same?(x : Int32, y : Int32)\n root(x) == root(y)\n end\n\n def size(x : Int32)\n -@d[root(x)]\n end\nend\n\nh, w = read_line.split.map(&.to_i)\nuf = UnionFind.new(h * w)\nred = Array.new(h) { [false] * w }\n\nread_line.to_i.times do |i|\n query = read_line.split.map(&.to_i.pred)\n case query.shift\n when 0\n i, j = query\n red[i][j] = true\n [{i - 1, j}, {i + 1, j}, {i, j - 1}, {i, j + 1}].each do |(i2, j2)|\n if (0...h).includes?(i2) && (0...w).includes?(j2) && red[i2][j2]\n uf.unite(i * w + j, i2 * w + j2)\n end\n end\n when 1\n i1, j1, i2, j2 = query\n puts red[i1][j1] && uf.same?(i1 * w + j1, i2 * w + j2) ? \"Yes\" : \"No\"\n end\nend\n" }, { "id": 102, "name": "012", "C++": "#include \n\n#include \n\n\n\n#define rep(i,n) for(int i=0;i < (n);i++)\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(),(a).end()\n\n\n\ntypedef long long ll;\n\n\n\nusing namespace std;\n\nusing namespace atcoder;\n\n\n\nint i,j,k,tmp;\n\nint ans = 0;\n\n\n\nint main()\n\n{\n\n\tcin.tie(0);\tios::sync_with_stdio(false);\n\n\tint H, W, Q; cin >> H >> W >> Q;\n\n\tint P[H][W]; rep(i,H){rep(j,W){P[i][j] = 0;}}\n\n\tdsu d(H * W);\n\n\n\n\trep(i, Q){\n\n\t\tint t; cin >> t;\n\n\t\tif(t == 1){\n\n\t\t\tint r, c; cin >> r >> c; r--; c--;\n\n\t\t\tint now = r * W + c;\n\n\t\t\tP[r][c] = 1;\n\n\t\t\tif(r > 0){if(P[r-1][c] == 1){d.merge(now, now - W);}}\n\n\t\t\tif(r < H-1){if(P[r+1][c] == 1){d.merge(now, now + W);}}\n\n\t\t\tif(c > 0){if(P[r][c-1] == 1){d.merge(now, now - 1);}}\n\n\t\t\tif(c < W-1){if(P[r][c+1] == 1){d.merge(now, now + 1);}}\n\n\t\t}\n\n\t\telse{\n\n\t\t\tint ra, ca, rb, cb;\n\n\t\t\tcin >> ra >> ca >> rb >> cb;\n\n\t\t\tra--; ca--; rb--; cb--;\n\n\t\t\tint posa = ra * W + ca;\n\n\t\t\tint posb = rb * W + cb;\n\n\t\t\tif(P[ra][ca] == 1 && P[rb][cb] == 1 && d.same(posa, posb) == true){\n\n\t\t\t\tcout << \"Yes\" << endl;\n\n\t\t\t}\n\n\t\t\telse{cout << \"No\" << endl;}\n\n\t\t}\n\n\t}\n\n\n\n return 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom typing import Iterable, List\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n Q = int(input())\n M = [[0] * W for _ in range(H)]\n uf = UnionFindTree(H * W)\n for _ in range(Q):\n t, *p = map(int, input().split())\n if t == 1:\n x, y = p\n x, y = x - 1, y - 1\n M[x][y] = 1\n for i, j in ((x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)):\n if i < 0 or i >= H or j < 0 or j >= W: continue\n if M[i][j]:\n uf.union(x * W + y, i * W + j)\n else:\n xa, ya, xb, yb = map(lambda x: x - 1, p)\n print('Yes' if M[xa][ya] and uf.same(xa * W + ya, xb * W + yb) else 'No')\n\nclass UnionFindTree:\n __slots__ = ('parent')\n\n def __init__(self, n: int) -> None:\n self.parent = [-1] * n\n\n def find(self, x: int) -> int:\n p = self.parent\n par, seq = p[x], []\n while par >= 0:\n seq.append(x)\n x, par = par, p[par]\n for c in seq: p[c] = x\n return x\n\n def union(self, x: int, y: int) -> bool:\n x, y, p = self.find(x), self.find(y), self.parent\n if x == y: return False\n if p[x] > p[y]: x, y = y, x\n p[x], p[y] = p[x] + p[y], x\n return True\n\n def same(self, x: int, y: int) -> bool:\n return self.find(x) == self.find(y)\n\n def size(self, x: int) -> int:\n return -self.parent[self.find(x)]\n\n def same_all(self, indices: Iterable[int]) -> bool:\n f, v = self.find, self.find(indices[0])\n return all(f(i) == v for i in indices)\n\n def groups(self) -> List[int]:\n return [i for i, p in enumerate(self.parent) if p < 0]\n\nif __name__ == '__main__':\n main()\n" }, { "id": 103, "name": "012", "C++": "#include \n\n#include \n\n\n\n#define rep(i,n) for(int i=0;i < (n);i++)\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(),(a).end()\n\n\n\ntypedef long long ll;\n\n\n\nusing namespace std;\n\nusing namespace atcoder;\n\n\n\nint i,j,k,tmp;\n\nint ans = 0;\n\n\n\nint main()\n\n{\n\n\tcin.tie(0);\tios::sync_with_stdio(false);\n\n\tint H, W, Q; cin >> H >> W >> Q;\n\n\tint P[H][W]; rep(i,H){rep(j,W){P[i][j] = 0;}}\n\n\tdsu d(H * W);\n\n\n\n\trep(i, Q){\n\n\t\tint t; cin >> t;\n\n\t\tif(t == 1){\n\n\t\t\tint r, c; cin >> r >> c; r--; c--;\n\n\t\t\tint now = r * W + c;\n\n\t\t\tP[r][c] = 1;\n\n\t\t\tif(r > 0){if(P[r-1][c] == 1){d.merge(now, now - W);}}\n\n\t\t\tif(r < H-1){if(P[r+1][c] == 1){d.merge(now, now + W);}}\n\n\t\t\tif(c > 0){if(P[r][c-1] == 1){d.merge(now, now - 1);}}\n\n\t\t\tif(c < W-1){if(P[r][c+1] == 1){d.merge(now, now + 1);}}\n\n\t\t}\n\n\t\telse{\n\n\t\t\tint ra, ca, rb, cb;\n\n\t\t\tcin >> ra >> ca >> rb >> cb;\n\n\t\t\tra--; ca--; rb--; cb--;\n\n\t\t\tint posa = ra * W + ca;\n\n\t\t\tint posb = rb * W + cb;\n\n\t\t\tif(P[ra][ca] == 1 && P[rb][cb] == 1 && d.same(posa, posb) == true){\n\n\t\t\t\tcout << \"Yes\" << endl;\n\n\t\t\t}\n\n\t\t\telse{cout << \"No\" << endl;}\n\n\t\t}\n\n\t}\n\n\n\n return 0;\n\n}", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar m: [][]bool :: #[h, w]bool\n\tvar uni: UnionFind :: (#UnionFind).init(h * w)\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tif(t = 1)\n\t\t\tvar r: int :: cui@inputInt() - 1\n\t\t\tvar c: int :: cui@inputInt() - 1\n\t\t\tdo m[r][c] :: true\n\t\t\tvar u: int :: r * w + c\n\t\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\t\tfor i(0, 3)\n\t\t\t\tvar c2: int :: c + dx[i]\n\t\t\t\tvar r2: int :: r + dy[i]\n\t\t\t\tif(c2 < 0 | w <= c2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tif(r2 < 0 | h <= r2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tif(!m[r2][c2])\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tvar v: int :: r2 * w + c2\n\t\t\t\tdo uni.unite(u, v)\n\t\t\tend for\n\t\telse\n\t\t\tvar ra: int :: cui@inputInt() - 1\n\t\t\tvar ca: int :: cui@inputInt() - 1\n\t\t\tvar rb: int :: cui@inputInt() - 1\n\t\t\tvar cb: int :: cui@inputInt() - 1\n\t\t\tvar ans: bool :: false\n\t\t\tif(m[ra][ca] & m[rb][cb])\n\t\t\t\tdo ans :: uni.same(ra * w + ca, rb * w + cb)\n\t\t\tend if\n\t\t\tdo cui@print(ans ?(\"Yes\\n\", \"No\\n\"))\n\t\tend if\n\tend for\n\t\n\tclass UnionFind()\n\t\tvar parents: []int\n\t\t+func init(n: int): UnionFind\n\t\t\tdo me.parents :: [-1].repeat(n)\n\t\t\tret me\n\t\tend func\n\t\t+func size(x: int): int\n\t\t\tret - me.parents[me.root(x)]\n\t\tend func\n\t\t+func same(x: int, y: int): bool\n\t\t\tret me.root(x) = me.root(y)\n\t\tend func\n\t\t+func unite(x: int, y: int): bool\n\t\t\tdo x :: me.root(x)\n\t\t\tdo y :: me.root(y)\n\t\t\tif(x = y)\n\t\t\t\tret false\n\t\t\tend if\n\t\t\tif(me.size(x) < me.size(y))\n\t\t\t\tdo me.parents[y] :+ me.parents[x]\n\t\t\t\tdo me.parents[x] :: y\n\t\t\telse\n\t\t\t\tdo me.parents[x] :+ me.parents[y]\n\t\t\t\tdo me.parents[y] :: x\n\t\t\tend if\n\t\t\tret true\n\t\tend func\n\t\t\n\t\tfunc root(x: int): int\n\t\t\tif(me.parents[x] < 0)\n\t\t\t\tret x\n\t\t\telse\n\t\t\t\tdo me.parents[x] :: me.root(me.parents[x])\n\t\t\t\tret me.parents[x]\n\t\t\tend if\n\t\tend func\n\tend class\nend func\n" }, { "id": 104, "name": "012", "Crystal": "class UnionFind\n @d : Array(Int32)\n\n def initialize(n : Int32)\n @d = Array.new(n, -1)\n end\n\n def root(x : Int32)\n @d[x] < 0 ? x : (@d[x] = root(@d[x]))\n end\n\n def unite(x : Int32, y : Int32)\n x = root(x)\n y = root(y)\n return false if x == y\n x, y = y, x if @d[x] > @d[y]\n @d[x] += @d[y]\n @d[y] = x\n true\n end\n\n def same?(x : Int32, y : Int32)\n root(x) == root(y)\n end\n\n def size(x : Int32)\n -@d[root(x)]\n end\nend\n\nh, w = read_line.split.map(&.to_i)\nuf = UnionFind.new(h * w)\nred = Array.new(h) { [false] * w }\n\nread_line.to_i.times do |i|\n query = read_line.split.map(&.to_i.pred)\n case query.shift\n when 0\n i, j = query\n red[i][j] = true\n [{i - 1, j}, {i + 1, j}, {i, j - 1}, {i, j + 1}].each do |(i2, j2)|\n if (0...h).includes?(i2) && (0...w).includes?(j2) && red[i2][j2]\n uf.unite(i * w + j, i2 * w + j2)\n end\n end\n when 1\n i1, j1, i2, j2 = query\n puts red[i1][j1] && uf.same?(i1 * w + j1, i2 * w + j2) ? \"Yes\" : \"No\"\n end\nend\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom typing import Iterable, List\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n Q = int(input())\n M = [[0] * W for _ in range(H)]\n uf = UnionFindTree(H * W)\n for _ in range(Q):\n t, *p = map(int, input().split())\n if t == 1:\n x, y = p\n x, y = x - 1, y - 1\n M[x][y] = 1\n for i, j in ((x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)):\n if i < 0 or i >= H or j < 0 or j >= W: continue\n if M[i][j]:\n uf.union(x * W + y, i * W + j)\n else:\n xa, ya, xb, yb = map(lambda x: x - 1, p)\n print('Yes' if M[xa][ya] and uf.same(xa * W + ya, xb * W + yb) else 'No')\n\nclass UnionFindTree:\n __slots__ = ('parent')\n\n def __init__(self, n: int) -> None:\n self.parent = [-1] * n\n\n def find(self, x: int) -> int:\n p = self.parent\n par, seq = p[x], []\n while par >= 0:\n seq.append(x)\n x, par = par, p[par]\n for c in seq: p[c] = x\n return x\n\n def union(self, x: int, y: int) -> bool:\n x, y, p = self.find(x), self.find(y), self.parent\n if x == y: return False\n if p[x] > p[y]: x, y = y, x\n p[x], p[y] = p[x] + p[y], x\n return True\n\n def same(self, x: int, y: int) -> bool:\n return self.find(x) == self.find(y)\n\n def size(self, x: int) -> int:\n return -self.parent[self.find(x)]\n\n def same_all(self, indices: Iterable[int]) -> bool:\n f, v = self.find, self.find(indices[0])\n return all(f(i) == v for i in indices)\n\n def groups(self) -> List[int]:\n return [i for i, p in enumerate(self.parent) if p < 0]\n\nif __name__ == '__main__':\n main()\n" }, { "id": 105, "name": "012", "Crystal": "class UnionFind\n @d : Array(Int32)\n\n def initialize(n : Int32)\n @d = Array.new(n, -1)\n end\n\n def root(x : Int32)\n @d[x] < 0 ? x : (@d[x] = root(@d[x]))\n end\n\n def unite(x : Int32, y : Int32)\n x = root(x)\n y = root(y)\n return false if x == y\n x, y = y, x if @d[x] > @d[y]\n @d[x] += @d[y]\n @d[y] = x\n true\n end\n\n def same?(x : Int32, y : Int32)\n root(x) == root(y)\n end\n\n def size(x : Int32)\n -@d[root(x)]\n end\nend\n\nh, w = read_line.split.map(&.to_i)\nuf = UnionFind.new(h * w)\nred = Array.new(h) { [false] * w }\n\nread_line.to_i.times do |i|\n query = read_line.split.map(&.to_i.pred)\n case query.shift\n when 0\n i, j = query\n red[i][j] = true\n [{i - 1, j}, {i + 1, j}, {i, j - 1}, {i, j + 1}].each do |(i2, j2)|\n if (0...h).includes?(i2) && (0...w).includes?(j2) && red[i2][j2]\n uf.unite(i * w + j, i2 * w + j2)\n end\n end\n when 1\n i1, j1, i2, j2 = query\n puts red[i1][j1] && uf.same?(i1 * w + j1, i2 * w + j2) ? \"Yes\" : \"No\"\n end\nend\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar m: [][]bool :: #[h, w]bool\n\tvar uni: UnionFind :: (#UnionFind).init(h * w)\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tif(t = 1)\n\t\t\tvar r: int :: cui@inputInt() - 1\n\t\t\tvar c: int :: cui@inputInt() - 1\n\t\t\tdo m[r][c] :: true\n\t\t\tvar u: int :: r * w + c\n\t\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\t\tfor i(0, 3)\n\t\t\t\tvar c2: int :: c + dx[i]\n\t\t\t\tvar r2: int :: r + dy[i]\n\t\t\t\tif(c2 < 0 | w <= c2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tif(r2 < 0 | h <= r2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tif(!m[r2][c2])\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tvar v: int :: r2 * w + c2\n\t\t\t\tdo uni.unite(u, v)\n\t\t\tend for\n\t\telse\n\t\t\tvar ra: int :: cui@inputInt() - 1\n\t\t\tvar ca: int :: cui@inputInt() - 1\n\t\t\tvar rb: int :: cui@inputInt() - 1\n\t\t\tvar cb: int :: cui@inputInt() - 1\n\t\t\tvar ans: bool :: false\n\t\t\tif(m[ra][ca] & m[rb][cb])\n\t\t\t\tdo ans :: uni.same(ra * w + ca, rb * w + cb)\n\t\t\tend if\n\t\t\tdo cui@print(ans ?(\"Yes\\n\", \"No\\n\"))\n\t\tend if\n\tend for\n\t\n\tclass UnionFind()\n\t\tvar parents: []int\n\t\t+func init(n: int): UnionFind\n\t\t\tdo me.parents :: [-1].repeat(n)\n\t\t\tret me\n\t\tend func\n\t\t+func size(x: int): int\n\t\t\tret - me.parents[me.root(x)]\n\t\tend func\n\t\t+func same(x: int, y: int): bool\n\t\t\tret me.root(x) = me.root(y)\n\t\tend func\n\t\t+func unite(x: int, y: int): bool\n\t\t\tdo x :: me.root(x)\n\t\t\tdo y :: me.root(y)\n\t\t\tif(x = y)\n\t\t\t\tret false\n\t\t\tend if\n\t\t\tif(me.size(x) < me.size(y))\n\t\t\t\tdo me.parents[y] :+ me.parents[x]\n\t\t\t\tdo me.parents[x] :: y\n\t\t\telse\n\t\t\t\tdo me.parents[x] :+ me.parents[y]\n\t\t\t\tdo me.parents[y] :: x\n\t\t\tend if\n\t\t\tret true\n\t\tend func\n\t\t\n\t\tfunc root(x: int): int\n\t\t\tif(me.parents[x] < 0)\n\t\t\t\tret x\n\t\t\telse\n\t\t\t\tdo me.parents[x] :: me.root(me.parents[x])\n\t\t\t\tret me.parents[x]\n\t\t\tend if\n\t\tend func\n\tend class\nend func\n" }, { "id": 106, "name": "012", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom typing import Iterable, List\nimport sys\ndef main():\n input = sys.stdin.readline\n H, W = map(int, input().split())\n Q = int(input())\n M = [[0] * W for _ in range(H)]\n uf = UnionFindTree(H * W)\n for _ in range(Q):\n t, *p = map(int, input().split())\n if t == 1:\n x, y = p\n x, y = x - 1, y - 1\n M[x][y] = 1\n for i, j in ((x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)):\n if i < 0 or i >= H or j < 0 or j >= W: continue\n if M[i][j]:\n uf.union(x * W + y, i * W + j)\n else:\n xa, ya, xb, yb = map(lambda x: x - 1, p)\n print('Yes' if M[xa][ya] and uf.same(xa * W + ya, xb * W + yb) else 'No')\n\nclass UnionFindTree:\n __slots__ = ('parent')\n\n def __init__(self, n: int) -> None:\n self.parent = [-1] * n\n\n def find(self, x: int) -> int:\n p = self.parent\n par, seq = p[x], []\n while par >= 0:\n seq.append(x)\n x, par = par, p[par]\n for c in seq: p[c] = x\n return x\n\n def union(self, x: int, y: int) -> bool:\n x, y, p = self.find(x), self.find(y), self.parent\n if x == y: return False\n if p[x] > p[y]: x, y = y, x\n p[x], p[y] = p[x] + p[y], x\n return True\n\n def same(self, x: int, y: int) -> bool:\n return self.find(x) == self.find(y)\n\n def size(self, x: int) -> int:\n return -self.parent[self.find(x)]\n\n def same_all(self, indices: Iterable[int]) -> bool:\n f, v = self.find, self.find(indices[0])\n return all(f(i) == v for i in indices)\n\n def groups(self) -> List[int]:\n return [i for i, p in enumerate(self.parent) if p < 0]\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar m: [][]bool :: #[h, w]bool\n\tvar uni: UnionFind :: (#UnionFind).init(h * w)\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tif(t = 1)\n\t\t\tvar r: int :: cui@inputInt() - 1\n\t\t\tvar c: int :: cui@inputInt() - 1\n\t\t\tdo m[r][c] :: true\n\t\t\tvar u: int :: r * w + c\n\t\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\t\tfor i(0, 3)\n\t\t\t\tvar c2: int :: c + dx[i]\n\t\t\t\tvar r2: int :: r + dy[i]\n\t\t\t\tif(c2 < 0 | w <= c2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tif(r2 < 0 | h <= r2)\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tif(!m[r2][c2])\n\t\t\t\t\tskip i\n\t\t\t\tend if\n\t\t\t\tvar v: int :: r2 * w + c2\n\t\t\t\tdo uni.unite(u, v)\n\t\t\tend for\n\t\telse\n\t\t\tvar ra: int :: cui@inputInt() - 1\n\t\t\tvar ca: int :: cui@inputInt() - 1\n\t\t\tvar rb: int :: cui@inputInt() - 1\n\t\t\tvar cb: int :: cui@inputInt() - 1\n\t\t\tvar ans: bool :: false\n\t\t\tif(m[ra][ca] & m[rb][cb])\n\t\t\t\tdo ans :: uni.same(ra * w + ca, rb * w + cb)\n\t\t\tend if\n\t\t\tdo cui@print(ans ?(\"Yes\\n\", \"No\\n\"))\n\t\tend if\n\tend for\n\t\n\tclass UnionFind()\n\t\tvar parents: []int\n\t\t+func init(n: int): UnionFind\n\t\t\tdo me.parents :: [-1].repeat(n)\n\t\t\tret me\n\t\tend func\n\t\t+func size(x: int): int\n\t\t\tret - me.parents[me.root(x)]\n\t\tend func\n\t\t+func same(x: int, y: int): bool\n\t\t\tret me.root(x) = me.root(y)\n\t\tend func\n\t\t+func unite(x: int, y: int): bool\n\t\t\tdo x :: me.root(x)\n\t\t\tdo y :: me.root(y)\n\t\t\tif(x = y)\n\t\t\t\tret false\n\t\t\tend if\n\t\t\tif(me.size(x) < me.size(y))\n\t\t\t\tdo me.parents[y] :+ me.parents[x]\n\t\t\t\tdo me.parents[x] :: y\n\t\t\telse\n\t\t\t\tdo me.parents[x] :+ me.parents[y]\n\t\t\t\tdo me.parents[y] :: x\n\t\t\tend if\n\t\t\tret true\n\t\tend func\n\t\t\n\t\tfunc root(x: int): int\n\t\t\tif(me.parents[x] < 0)\n\t\t\t\tret x\n\t\t\telse\n\t\t\t\tdo me.parents[x] :: me.root(me.parents[x])\n\t\t\t\tret me.parents[x]\n\t\t\tend if\n\t\tend func\n\tend class\nend func\n" }, { "id": 107, "name": "013", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nconst int inf = 2e9;\n\nvector bfs_with_cost(int n, vector>> to, int start) {\n vector dist(n + 1, inf);\n queue q;\n dist[start] = 0;\n q.push(start);\n while (q.size() > 0) {\n int now = q.front();\n q.pop();\n for (auto next_pair : to[now]) {\n int next = next_pair.first;\n int cost = next_pair.second;\n if (dist[next] <= dist[now] + cost) {\n continue;\n }\n dist[next] = dist[now] + cost;\n q.push(next);\n }\n }\n return dist;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector>> to(n + 1, vector>(0));\n rep(i, m) {\n int a, b;\n ll c;\n cin >> a >> b >> c;\n to[a].push_back({b, c});\n to[b].push_back({a, c});\n }\n vector dist_start = bfs_with_cost(n, to, 1);\n vector dist_end = bfs_with_cost(n, to, n);\n rep1(i, n) { cout << dist_start[i] + dist_end[i] << endl; }\n}", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements standard priority queue like [std::priority_queue](https://en.cppreference.com/w/cpp/container/priority_queue).\n #\n # ```\n # q = AtCoder::PriorityQueue(Int64).new\n # q << 1_i64\n # q << 3_i64\n # q << 2_i64\n # q.pop # => 3\n # q.pop # => 2\n # q.pop # => 1\n # ```\n class PriorityQueue(T)\n getter heap : Array(T)\n\n def initialize\n initialize(&.itself)\n end\n\n # Initializes queue with the custom comperator.\n #\n # ```\n # q = AtCoder::PriorityQueue(Int64).new { |n| -n }\n # q << 1_i64\n # q << 3_i64\n # q << 2_i64\n # q.pop # => 1\n # q.pop # => 2\n # q.pop # => 3\n # ```\n def initialize(&block : T -> (Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32 | UInt64))\n @heap = Array(T).new\n @priority_proc = block\n end\n\n # Pushes value into the queue.\n def push(v : T)\n @heap << v\n index = @heap.size - 1\n while index != 0\n parent = (index - 1) // 2\n if @priority_proc.call(@heap[parent]) >= @priority_proc.call(@heap[index])\n break\n end\n @heap[parent], @heap[index] = @heap[index], @heap[parent]\n index = parent\n end\n end\n\n # Alias of `push`\n def <<(v : T)\n push(v)\n end\n\n # Pops value from the queue.\n def pop\n if @heap.size == 0\n return nil\n end\n if @heap.size == 1\n return @heap.pop\n end\n ret = @heap.first\n @heap[0] = @heap.pop\n index = 0\n while index * 2 + 1 < @heap.size\n child = if index * 2 + 2 < @heap.size && @priority_proc.call(@heap[index * 2 + 1]) < @priority_proc.call(@heap[index * 2 + 2])\n index * 2 + 2\n else\n index * 2 + 1\n end\n if @priority_proc.call(@heap[index]) >= @priority_proc.call(@heap[child])\n break\n end\n @heap[child], @heap[index] = @heap[index], @heap[child]\n index = child\n end\n ret\n end\n\n # Returns `true` if the queue is empty.\n delegate :empty?, to: @heap\n\n # Returns size of the queue.\n delegate :size, to: @heap\n end\nend\n\nstruct Edge(T)\n include Comparable(Edge(T))\n\n property to : Int32\n property cost : T\n\n def initialize(@to : Int32, @cost : T)\n end\n\n def <=>(other : Edge(T))\n {cost, to} <=> {other.cost, other.to}\n end\n\n def to_s(io : IO) : Nil\n io << '(' << to << \", \" << cost << ')'\n end\nend\n\nclass Graph(T)\n getter graph : Array(Array(Edge(T)))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Edge(T)).new }\n end\n\n def add_edge(i : Int, j : Int, cost : T)\n @graph[i] << Edge.new(j, cost)\n @graph[j] << Edge.new(i, cost)\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def dijkstra(start : Int32)\n queue = AtCoder::PriorityQueue({Int32, T}).new { |(vertex, dist)| -dist }\n queue << {start, T.zero}\n dist = Array(T?).new(size, nil)\n dist[start] = T.zero\n\n until queue.empty?\n vertex, d = queue.pop.not_nil!\n dist_v = dist[vertex].not_nil!\n next if dist_v < d\n self[vertex].each do |edge|\n if dist[edge.to].nil? || dist[edge.to].not_nil! > dist_v + edge.cost\n dist[edge.to] = dist_v + edge.cost\n queue << {edge.to, dist_v + edge.cost}\n end\n end\n end\n\n dist\n end\n\n def dijkstra!(start : Int32)\n dijkstra(start).map(&.not_nil!)\n end\nend\n\nn, m = read_line.split.map(&.to_i)\ng = Graph(Int32).new(n)\nm.times do\n a, b, c = read_line.split.map(&.to_i)\n g.add_edge(a - 1, b - 1, c)\nend\ndist_1 = g.dijkstra!(0)\ndist_n = g.dijkstra!(n - 1)\nputs dist_1.zip(dist_n).join('\\n') { |d1, dn| d1 + dn }\n" }, { "id": 108, "name": "013", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nconst int inf = 2e9;\n\nvector bfs_with_cost(int n, vector>> to, int start) {\n vector dist(n + 1, inf);\n queue q;\n dist[start] = 0;\n q.push(start);\n while (q.size() > 0) {\n int now = q.front();\n q.pop();\n for (auto next_pair : to[now]) {\n int next = next_pair.first;\n int cost = next_pair.second;\n if (dist[next] <= dist[now] + cost) {\n continue;\n }\n dist[next] = dist[now] + cost;\n q.push(next);\n }\n }\n return dist;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector>> to(n + 1, vector>(0));\n rep(i, m) {\n int a, b;\n ll c;\n cin >> a >> b >> c;\n to[a].push_back({b, c});\n to[b].push_back({a, c});\n }\n vector dist_start = bfs_with_cost(n, to, 1);\n vector dist_end = bfs_with_cost(n, to, n);\n rep1(i, n) { cout << dist_start[i] + dist_end[i] << endl; }\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nfrom heapq import heappush, heappop\nINF = 10**18\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n G = [[] for _ in range(N)]\n for _ in range(M):\n x, y, c = map(int, input().split())\n x, y = x - 1, y - 1\n G[x].append((y, c))\n G[y].append((x, c))\n\n def f(s):\n q = [(0, s)]\n dist = [INF] * N\n dist[s] = 0\n while q:\n d, v = heappop(q)\n if dist[v] != d: continue\n for nv, c in G[v]:\n nd = d + c\n if dist[nv] <= nd: continue\n dist[nv] = nd\n heappush(q, (nd, nv))\n return dist\n\n D1 = f(0)\n Dn = f(N - 1)\n for i in range(N):\n print(D1[i] + Dn[i])\n\nif __name__ == '__main__':\n main()\n" }, { "id": 109, "name": "013", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nconst int inf = 2e9;\n\nvector bfs_with_cost(int n, vector>> to, int start) {\n vector dist(n + 1, inf);\n queue q;\n dist[start] = 0;\n q.push(start);\n while (q.size() > 0) {\n int now = q.front();\n q.pop();\n for (auto next_pair : to[now]) {\n int next = next_pair.first;\n int cost = next_pair.second;\n if (dist[next] <= dist[now] + cost) {\n continue;\n }\n dist[next] = dist[now] + cost;\n q.push(next);\n }\n }\n return dist;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector>> to(n + 1, vector>(0));\n rep(i, m) {\n int a, b;\n ll c;\n cin >> a >> b >> c;\n to[a].push_back({b, c});\n to[b].push_back({a, c});\n }\n vector dist_start = bfs_with_cost(n, to, 1);\n vector dist_end = bfs_with_cost(n, to, n);\n rep1(i, n) { cout << dist_start[i] + dist_end[i] << endl; }\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, m - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tvar c: int :: cui@inputInt()\n\t\tdo graph[a].add((#Edge).init(b, c))\n\t\tdo graph[b].add((#Edge).init(a, c))\n\tend for\n\t\n\tvar dist1: []int :: dists(graph, 0)\n\tvar distN: []int :: dists(graph, n - 1)\n\t\n\tfor i(0, n - 1)\n\t\tvar ans: int :: dist1[i] + distN[i]\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\n\t\n\tfunc dists(graph: []list, start: int): []int\n\t\tvar n: int :: ^graph\n\t\tvar res: []int :: [lib@intMax].repeat(^graph)\n\t\tdo res[start] :: 0\n\t\tvar pq: PriorityQueue :: #PriorityQueue\n\t\tdo pq.add(-(0 + start))\n\t\twhile loop(pq.len <> 0)\n\t\t\tvar data: int :: -pq.top()\n\t\t\tdo pq.pop()\n\t\t\tvar u: int :: data % n\n\t\t\tif(res[u] < data / n)\n\t\t\t\tskip loop\n\t\t\tend if\n\t\t\t\n\t\t\tdo graph[u].head()\n\t\t\tfor i(0, ^graph[u] - 1)\n\t\t\t\tvar e: Edge :: graph[u].get()\n\t\t\t\tvar v: int :: e.v\n\t\t\t\tvar dist: int :: e.dist\n\t\t\t\tif(res[u] + dist < res[v])\n\t\t\t\t\tdo res[v] :: res[u] + dist\n\t\t\t\t\tdo pq.add(-(res[v] * n + v))\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend for\n\t\tend while\n\t\tret res\n\t\t\n\t\tclass PriorityQueue()\n\t\t\tvar data: []int\n\t\t\t+var len: int\n\t\t\t*func ctor()\n\t\t\t\tdo me.data :: #[1024]int\n\t\t\t\tdo me.len :: 0\n\t\t\tend func\n\t\t\t+func add(elem: int)\n\t\t\t\tvar n: int :: me.len\n\t\t\t\tif(^me.data = me.len)\n\t\t\t\t\tdo me.data :~ #[me.len]int\n\t\t\t\tend if\n\t\t\t\tdo me.data[me.len] :: elem\n\t\t\t\tdo me.len :+ 1\n\t\t\t\t\n\t\t\t\twhile(n <> 0)\n\t\t\t\t\tvar i: int :: (n - 1) / 2\n\t\t\t\t\tif(me.data[n] > me.data[i])\n\t\t\t\t\t\tvar tmp: int :: me.data[n]\n\t\t\t\t\t\tdo me.data[n] :: me.data[i]\n\t\t\t\t\t\tdo me.data[i] :: tmp\n\t\t\t\t\tend if\n\t\t\t\t\tdo n :: i\n\t\t\t\tend while\n\t\t\tend func\n\t\t\t+func pop()\n\t\t\t\tvar n: int :: me.len - 1\n\t\t\t\tdo me.data[0] :: me.data[n]\n\t\t\t\tdo me.len :- 1\n\t\t\t\tvar i: int :: 0\n\t\t\t\tvar j: int :: 1\n\t\t\t\twhile(j < n)\n\t\t\t\t\tif(j <> n - 1 & me.data[j] < me.data[j + 1])\n\t\t\t\t\t\tdo j :+ 1\n\t\t\t\t\tend if\n\t\t\t\t\tif(me.data[i] < me.data[j])\n\t\t\t\t\t\tvar tmp: int :: me.data[j]\n\t\t\t\t\t\tdo me.data[j] :: me.data[i]\n\t\t\t\t\t\tdo me.data[i] :: tmp\n\t\t\t\t\tend if\n\t\t\t\t\tdo i :: j\n\t\t\t\t\tdo j :: 2 * i + 1\n\t\t\t\tend while\n\t\t\tend func\n\t\t\t+func top(): int\n\t\t\t\tret me.data[0]\n\t\t\tend func\n\t\tend class\n\tend func\n\t\n\tclass Edge()\n\t\t+var v: int\n\t\t+var dist: int\n\t\t+func init(v: int, dist: int): Edge\n\t\t\tdo me.v :: v\n\t\t\tdo me.dist :: dist\n\t\t\tret me\n\t\tend func\n\tend class\nend func\n" }, { "id": 110, "name": "013", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements standard priority queue like [std::priority_queue](https://en.cppreference.com/w/cpp/container/priority_queue).\n #\n # ```\n # q = AtCoder::PriorityQueue(Int64).new\n # q << 1_i64\n # q << 3_i64\n # q << 2_i64\n # q.pop # => 3\n # q.pop # => 2\n # q.pop # => 1\n # ```\n class PriorityQueue(T)\n getter heap : Array(T)\n\n def initialize\n initialize(&.itself)\n end\n\n # Initializes queue with the custom comperator.\n #\n # ```\n # q = AtCoder::PriorityQueue(Int64).new { |n| -n }\n # q << 1_i64\n # q << 3_i64\n # q << 2_i64\n # q.pop # => 1\n # q.pop # => 2\n # q.pop # => 3\n # ```\n def initialize(&block : T -> (Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32 | UInt64))\n @heap = Array(T).new\n @priority_proc = block\n end\n\n # Pushes value into the queue.\n def push(v : T)\n @heap << v\n index = @heap.size - 1\n while index != 0\n parent = (index - 1) // 2\n if @priority_proc.call(@heap[parent]) >= @priority_proc.call(@heap[index])\n break\n end\n @heap[parent], @heap[index] = @heap[index], @heap[parent]\n index = parent\n end\n end\n\n # Alias of `push`\n def <<(v : T)\n push(v)\n end\n\n # Pops value from the queue.\n def pop\n if @heap.size == 0\n return nil\n end\n if @heap.size == 1\n return @heap.pop\n end\n ret = @heap.first\n @heap[0] = @heap.pop\n index = 0\n while index * 2 + 1 < @heap.size\n child = if index * 2 + 2 < @heap.size && @priority_proc.call(@heap[index * 2 + 1]) < @priority_proc.call(@heap[index * 2 + 2])\n index * 2 + 2\n else\n index * 2 + 1\n end\n if @priority_proc.call(@heap[index]) >= @priority_proc.call(@heap[child])\n break\n end\n @heap[child], @heap[index] = @heap[index], @heap[child]\n index = child\n end\n ret\n end\n\n # Returns `true` if the queue is empty.\n delegate :empty?, to: @heap\n\n # Returns size of the queue.\n delegate :size, to: @heap\n end\nend\n\nstruct Edge(T)\n include Comparable(Edge(T))\n\n property to : Int32\n property cost : T\n\n def initialize(@to : Int32, @cost : T)\n end\n\n def <=>(other : Edge(T))\n {cost, to} <=> {other.cost, other.to}\n end\n\n def to_s(io : IO) : Nil\n io << '(' << to << \", \" << cost << ')'\n end\nend\n\nclass Graph(T)\n getter graph : Array(Array(Edge(T)))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Edge(T)).new }\n end\n\n def add_edge(i : Int, j : Int, cost : T)\n @graph[i] << Edge.new(j, cost)\n @graph[j] << Edge.new(i, cost)\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def dijkstra(start : Int32)\n queue = AtCoder::PriorityQueue({Int32, T}).new { |(vertex, dist)| -dist }\n queue << {start, T.zero}\n dist = Array(T?).new(size, nil)\n dist[start] = T.zero\n\n until queue.empty?\n vertex, d = queue.pop.not_nil!\n dist_v = dist[vertex].not_nil!\n next if dist_v < d\n self[vertex].each do |edge|\n if dist[edge.to].nil? || dist[edge.to].not_nil! > dist_v + edge.cost\n dist[edge.to] = dist_v + edge.cost\n queue << {edge.to, dist_v + edge.cost}\n end\n end\n end\n\n dist\n end\n\n def dijkstra!(start : Int32)\n dijkstra(start).map(&.not_nil!)\n end\nend\n\nn, m = read_line.split.map(&.to_i)\ng = Graph(Int32).new(n)\nm.times do\n a, b, c = read_line.split.map(&.to_i)\n g.add_edge(a - 1, b - 1, c)\nend\ndist_1 = g.dijkstra!(0)\ndist_n = g.dijkstra!(n - 1)\nputs dist_1.zip(dist_n).join('\\n') { |d1, dn| d1 + dn }\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nfrom heapq import heappush, heappop\nINF = 10**18\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n G = [[] for _ in range(N)]\n for _ in range(M):\n x, y, c = map(int, input().split())\n x, y = x - 1, y - 1\n G[x].append((y, c))\n G[y].append((x, c))\n\n def f(s):\n q = [(0, s)]\n dist = [INF] * N\n dist[s] = 0\n while q:\n d, v = heappop(q)\n if dist[v] != d: continue\n for nv, c in G[v]:\n nd = d + c\n if dist[nv] <= nd: continue\n dist[nv] = nd\n heappush(q, (nd, nv))\n return dist\n\n D1 = f(0)\n Dn = f(N - 1)\n for i in range(N):\n print(D1[i] + Dn[i])\n\nif __name__ == '__main__':\n main()\n" }, { "id": 111, "name": "013", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements standard priority queue like [std::priority_queue](https://en.cppreference.com/w/cpp/container/priority_queue).\n #\n # ```\n # q = AtCoder::PriorityQueue(Int64).new\n # q << 1_i64\n # q << 3_i64\n # q << 2_i64\n # q.pop # => 3\n # q.pop # => 2\n # q.pop # => 1\n # ```\n class PriorityQueue(T)\n getter heap : Array(T)\n\n def initialize\n initialize(&.itself)\n end\n\n # Initializes queue with the custom comperator.\n #\n # ```\n # q = AtCoder::PriorityQueue(Int64).new { |n| -n }\n # q << 1_i64\n # q << 3_i64\n # q << 2_i64\n # q.pop # => 1\n # q.pop # => 2\n # q.pop # => 3\n # ```\n def initialize(&block : T -> (Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32 | UInt64))\n @heap = Array(T).new\n @priority_proc = block\n end\n\n # Pushes value into the queue.\n def push(v : T)\n @heap << v\n index = @heap.size - 1\n while index != 0\n parent = (index - 1) // 2\n if @priority_proc.call(@heap[parent]) >= @priority_proc.call(@heap[index])\n break\n end\n @heap[parent], @heap[index] = @heap[index], @heap[parent]\n index = parent\n end\n end\n\n # Alias of `push`\n def <<(v : T)\n push(v)\n end\n\n # Pops value from the queue.\n def pop\n if @heap.size == 0\n return nil\n end\n if @heap.size == 1\n return @heap.pop\n end\n ret = @heap.first\n @heap[0] = @heap.pop\n index = 0\n while index * 2 + 1 < @heap.size\n child = if index * 2 + 2 < @heap.size && @priority_proc.call(@heap[index * 2 + 1]) < @priority_proc.call(@heap[index * 2 + 2])\n index * 2 + 2\n else\n index * 2 + 1\n end\n if @priority_proc.call(@heap[index]) >= @priority_proc.call(@heap[child])\n break\n end\n @heap[child], @heap[index] = @heap[index], @heap[child]\n index = child\n end\n ret\n end\n\n # Returns `true` if the queue is empty.\n delegate :empty?, to: @heap\n\n # Returns size of the queue.\n delegate :size, to: @heap\n end\nend\n\nstruct Edge(T)\n include Comparable(Edge(T))\n\n property to : Int32\n property cost : T\n\n def initialize(@to : Int32, @cost : T)\n end\n\n def <=>(other : Edge(T))\n {cost, to} <=> {other.cost, other.to}\n end\n\n def to_s(io : IO) : Nil\n io << '(' << to << \", \" << cost << ')'\n end\nend\n\nclass Graph(T)\n getter graph : Array(Array(Edge(T)))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Edge(T)).new }\n end\n\n def add_edge(i : Int, j : Int, cost : T)\n @graph[i] << Edge.new(j, cost)\n @graph[j] << Edge.new(i, cost)\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def dijkstra(start : Int32)\n queue = AtCoder::PriorityQueue({Int32, T}).new { |(vertex, dist)| -dist }\n queue << {start, T.zero}\n dist = Array(T?).new(size, nil)\n dist[start] = T.zero\n\n until queue.empty?\n vertex, d = queue.pop.not_nil!\n dist_v = dist[vertex].not_nil!\n next if dist_v < d\n self[vertex].each do |edge|\n if dist[edge.to].nil? || dist[edge.to].not_nil! > dist_v + edge.cost\n dist[edge.to] = dist_v + edge.cost\n queue << {edge.to, dist_v + edge.cost}\n end\n end\n end\n\n dist\n end\n\n def dijkstra!(start : Int32)\n dijkstra(start).map(&.not_nil!)\n end\nend\n\nn, m = read_line.split.map(&.to_i)\ng = Graph(Int32).new(n)\nm.times do\n a, b, c = read_line.split.map(&.to_i)\n g.add_edge(a - 1, b - 1, c)\nend\ndist_1 = g.dijkstra!(0)\ndist_n = g.dijkstra!(n - 1)\nputs dist_1.zip(dist_n).join('\\n') { |d1, dn| d1 + dn }\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, m - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tvar c: int :: cui@inputInt()\n\t\tdo graph[a].add((#Edge).init(b, c))\n\t\tdo graph[b].add((#Edge).init(a, c))\n\tend for\n\t\n\tvar dist1: []int :: dists(graph, 0)\n\tvar distN: []int :: dists(graph, n - 1)\n\t\n\tfor i(0, n - 1)\n\t\tvar ans: int :: dist1[i] + distN[i]\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\n\t\n\tfunc dists(graph: []list, start: int): []int\n\t\tvar n: int :: ^graph\n\t\tvar res: []int :: [lib@intMax].repeat(^graph)\n\t\tdo res[start] :: 0\n\t\tvar pq: PriorityQueue :: #PriorityQueue\n\t\tdo pq.add(-(0 + start))\n\t\twhile loop(pq.len <> 0)\n\t\t\tvar data: int :: -pq.top()\n\t\t\tdo pq.pop()\n\t\t\tvar u: int :: data % n\n\t\t\tif(res[u] < data / n)\n\t\t\t\tskip loop\n\t\t\tend if\n\t\t\t\n\t\t\tdo graph[u].head()\n\t\t\tfor i(0, ^graph[u] - 1)\n\t\t\t\tvar e: Edge :: graph[u].get()\n\t\t\t\tvar v: int :: e.v\n\t\t\t\tvar dist: int :: e.dist\n\t\t\t\tif(res[u] + dist < res[v])\n\t\t\t\t\tdo res[v] :: res[u] + dist\n\t\t\t\t\tdo pq.add(-(res[v] * n + v))\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend for\n\t\tend while\n\t\tret res\n\t\t\n\t\tclass PriorityQueue()\n\t\t\tvar data: []int\n\t\t\t+var len: int\n\t\t\t*func ctor()\n\t\t\t\tdo me.data :: #[1024]int\n\t\t\t\tdo me.len :: 0\n\t\t\tend func\n\t\t\t+func add(elem: int)\n\t\t\t\tvar n: int :: me.len\n\t\t\t\tif(^me.data = me.len)\n\t\t\t\t\tdo me.data :~ #[me.len]int\n\t\t\t\tend if\n\t\t\t\tdo me.data[me.len] :: elem\n\t\t\t\tdo me.len :+ 1\n\t\t\t\t\n\t\t\t\twhile(n <> 0)\n\t\t\t\t\tvar i: int :: (n - 1) / 2\n\t\t\t\t\tif(me.data[n] > me.data[i])\n\t\t\t\t\t\tvar tmp: int :: me.data[n]\n\t\t\t\t\t\tdo me.data[n] :: me.data[i]\n\t\t\t\t\t\tdo me.data[i] :: tmp\n\t\t\t\t\tend if\n\t\t\t\t\tdo n :: i\n\t\t\t\tend while\n\t\t\tend func\n\t\t\t+func pop()\n\t\t\t\tvar n: int :: me.len - 1\n\t\t\t\tdo me.data[0] :: me.data[n]\n\t\t\t\tdo me.len :- 1\n\t\t\t\tvar i: int :: 0\n\t\t\t\tvar j: int :: 1\n\t\t\t\twhile(j < n)\n\t\t\t\t\tif(j <> n - 1 & me.data[j] < me.data[j + 1])\n\t\t\t\t\t\tdo j :+ 1\n\t\t\t\t\tend if\n\t\t\t\t\tif(me.data[i] < me.data[j])\n\t\t\t\t\t\tvar tmp: int :: me.data[j]\n\t\t\t\t\t\tdo me.data[j] :: me.data[i]\n\t\t\t\t\t\tdo me.data[i] :: tmp\n\t\t\t\t\tend if\n\t\t\t\t\tdo i :: j\n\t\t\t\t\tdo j :: 2 * i + 1\n\t\t\t\tend while\n\t\t\tend func\n\t\t\t+func top(): int\n\t\t\t\tret me.data[0]\n\t\t\tend func\n\t\tend class\n\tend func\n\t\n\tclass Edge()\n\t\t+var v: int\n\t\t+var dist: int\n\t\t+func init(v: int, dist: int): Edge\n\t\t\tdo me.v :: v\n\t\t\tdo me.dist :: dist\n\t\t\tret me\n\t\tend func\n\tend class\nend func\n" }, { "id": 112, "name": "013", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\nfrom heapq import heappush, heappop\nINF = 10**18\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n G = [[] for _ in range(N)]\n for _ in range(M):\n x, y, c = map(int, input().split())\n x, y = x - 1, y - 1\n G[x].append((y, c))\n G[y].append((x, c))\n\n def f(s):\n q = [(0, s)]\n dist = [INF] * N\n dist[s] = 0\n while q:\n d, v = heappop(q)\n if dist[v] != d: continue\n for nv, c in G[v]:\n nd = d + c\n if dist[nv] <= nd: continue\n dist[nv] = nd\n heappush(q, (nd, nv))\n return dist\n\n D1 = f(0)\n Dn = f(N - 1)\n for i in range(N):\n print(D1[i] + Dn[i])\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, m - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tvar c: int :: cui@inputInt()\n\t\tdo graph[a].add((#Edge).init(b, c))\n\t\tdo graph[b].add((#Edge).init(a, c))\n\tend for\n\t\n\tvar dist1: []int :: dists(graph, 0)\n\tvar distN: []int :: dists(graph, n - 1)\n\t\n\tfor i(0, n - 1)\n\t\tvar ans: int :: dist1[i] + distN[i]\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\n\t\n\tfunc dists(graph: []list, start: int): []int\n\t\tvar n: int :: ^graph\n\t\tvar res: []int :: [lib@intMax].repeat(^graph)\n\t\tdo res[start] :: 0\n\t\tvar pq: PriorityQueue :: #PriorityQueue\n\t\tdo pq.add(-(0 + start))\n\t\twhile loop(pq.len <> 0)\n\t\t\tvar data: int :: -pq.top()\n\t\t\tdo pq.pop()\n\t\t\tvar u: int :: data % n\n\t\t\tif(res[u] < data / n)\n\t\t\t\tskip loop\n\t\t\tend if\n\t\t\t\n\t\t\tdo graph[u].head()\n\t\t\tfor i(0, ^graph[u] - 1)\n\t\t\t\tvar e: Edge :: graph[u].get()\n\t\t\t\tvar v: int :: e.v\n\t\t\t\tvar dist: int :: e.dist\n\t\t\t\tif(res[u] + dist < res[v])\n\t\t\t\t\tdo res[v] :: res[u] + dist\n\t\t\t\t\tdo pq.add(-(res[v] * n + v))\n\t\t\t\tend if\n\t\t\t\tdo graph[u].next()\n\t\t\tend for\n\t\tend while\n\t\tret res\n\t\t\n\t\tclass PriorityQueue()\n\t\t\tvar data: []int\n\t\t\t+var len: int\n\t\t\t*func ctor()\n\t\t\t\tdo me.data :: #[1024]int\n\t\t\t\tdo me.len :: 0\n\t\t\tend func\n\t\t\t+func add(elem: int)\n\t\t\t\tvar n: int :: me.len\n\t\t\t\tif(^me.data = me.len)\n\t\t\t\t\tdo me.data :~ #[me.len]int\n\t\t\t\tend if\n\t\t\t\tdo me.data[me.len] :: elem\n\t\t\t\tdo me.len :+ 1\n\t\t\t\t\n\t\t\t\twhile(n <> 0)\n\t\t\t\t\tvar i: int :: (n - 1) / 2\n\t\t\t\t\tif(me.data[n] > me.data[i])\n\t\t\t\t\t\tvar tmp: int :: me.data[n]\n\t\t\t\t\t\tdo me.data[n] :: me.data[i]\n\t\t\t\t\t\tdo me.data[i] :: tmp\n\t\t\t\t\tend if\n\t\t\t\t\tdo n :: i\n\t\t\t\tend while\n\t\t\tend func\n\t\t\t+func pop()\n\t\t\t\tvar n: int :: me.len - 1\n\t\t\t\tdo me.data[0] :: me.data[n]\n\t\t\t\tdo me.len :- 1\n\t\t\t\tvar i: int :: 0\n\t\t\t\tvar j: int :: 1\n\t\t\t\twhile(j < n)\n\t\t\t\t\tif(j <> n - 1 & me.data[j] < me.data[j + 1])\n\t\t\t\t\t\tdo j :+ 1\n\t\t\t\t\tend if\n\t\t\t\t\tif(me.data[i] < me.data[j])\n\t\t\t\t\t\tvar tmp: int :: me.data[j]\n\t\t\t\t\t\tdo me.data[j] :: me.data[i]\n\t\t\t\t\t\tdo me.data[i] :: tmp\n\t\t\t\t\tend if\n\t\t\t\t\tdo i :: j\n\t\t\t\t\tdo j :: 2 * i + 1\n\t\t\t\tend while\n\t\t\tend func\n\t\t\t+func top(): int\n\t\t\t\tret me.data[0]\n\t\t\tend func\n\t\tend class\n\tend func\n\t\n\tclass Edge()\n\t\t+var v: int\n\t\t+var dist: int\n\t\t+func init(v: int, dist: int): Edge\n\t\t\tdo me.v :: v\n\t\t\tdo me.dist :: dist\n\t\t\tret me\n\t\tend func\n\tend class\nend func\n" }, { "id": 113, "name": "014", "Crystal": "read_line\na = read_line.split.map(&.to_i64).sort\nb = read_line.split.map(&.to_i64).sort\nputs a.zip(b).sum { |i, j| (i - j).abs }\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nA = sorted(map(int, input().split()))\nB = sorted(map(int, input().split()))\nprint(sum(abs(a - b) for a, b in zip(A, B)))\n" }, { "id": 114, "name": "014", "Crystal": "read_line\na = read_line.split.map(&.to_i64).sort\nb = read_line.split.map(&.to_i64).sort\nputs a.zip(b).sum { |i, j| (i - j).abs }\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar b: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo b[i] :: cui@inputInt()\n\tend for\n\tdo a.sort()\n\tdo b.sort()\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tdo ans :+ (a[i] - b[i]).abs()\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 115, "name": "014", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nA = sorted(map(int, input().split()))\nB = sorted(map(int, input().split()))\nprint(sum(abs(a - b) for a, b in zip(A, B)))\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar b: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo b[i] :: cui@inputInt()\n\tend for\n\tdo a.sort()\n\tdo b.sort()\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tdo ans :+ (a[i] - b[i]).abs()\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 116, "name": "015", "C++": "#include \n#include \nusing ll = long long;\n#define mod 1000000007\nusing namespace std;\n\n//34[ms]\nstruct mint{\n ll x;\n mint(ll x = 0) : x((x + mod) % mod){}\n mint operator-() const{ return mint(-x); }\n mint operator+=(const mint &a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint &operator++(){\n if(++x == mod) x = 0;\n return *this;\n }\n mint operator++(int){\n mint temp = *this;\n if(++x == mod) x = 0;\n return temp;\n }\n mint &operator-=(const mint &a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n mint &operator--(){\n if(--x < 0) x += mod;\n return *this;\n }\n mint operator--(int){\n mint temp = *this;\n if(--x < 0) x += mod;\n return temp;\n }\n mint &operator*=(const mint &a){\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint &a) const{ return mint(*this) += a; }\n mint operator-(const mint &a) const{ return mint(*this) -= a; }\n mint operator*(const mint &a) const{ return mint(*this) *= a; }\n mint pow(ll t) const{\n if(!t) return 1;\n mint a = pow(t >> 1);\n a *= a;\n if (t & 1) a *= *this;\n return a;\n }\n mint inv() const{ return pow(mod - 2); }\n mint &operator/=(const mint &a){ return (*this) *= a.inv(); }\n mint operator/(const mint &a) const{ return mint(*this) /= a; }\n friend istream &operator>>(istream &is, mint &a){ return is >> a.x; }\n friend ostream &operator<<(ostream &os, const mint &a){ return os << a.x; }\n};\nconst int len = 100010;\nvector fact(len), invfact(len);\nmint choose(int n, int r){\n return fact[n] * invfact[n - r] * invfact[r];\n}\n\nint main(){\n fact[0] = fact[1] = 1;\n for(int i = 2; i < len; i++) fact[i] = fact[i - 1] * i;\n invfact[len - 1] = fact[len - 1].inv();\n for(int i = len - 2; i >= 0; i--) invfact[i] = invfact[i + 1] * (i + 1);\n\n int n;\n cin >> n;\n for(int k = 1; k <= n; k++){\n mint ans = 0;\n for(int j = 1; (j-1)*k+1 <= n; j++){\n int num = n - ((j-1)*k + 1);\n //j+1 H num\n ans += choose(j + num, j);\n }\n cout << ans << \"\\n\";\n }\n}", "Crystal": "struct Mint\n MOD = 1000000007i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n @value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n getter value : Int64\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD &- value : 0i64)\n end\n\n def +(v)\n self + v.to_m\n end\n\n def +(m : self)\n x = value &+ m.value\n x &-= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - v.to_m\n end\n\n def -(m : self)\n x = value &- m.value\n x &+= MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * v.to_m\n end\n\n def *(m : self)\n Mint.new(value &* m.value)\n end\n\n def /(v)\n self / v.to_m\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.to_i64, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a &-= t &* b\n a, b = b, a\n u &-= t &* v\n u, v = v, u\n end\n Mint.new(value &* u)\n end\n\n def //(v)\n self / v\n end\n\n def **(exponent : Int)\n t, res = self, Mint.raw(1i64)\n while exponent > 0\n res *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n res\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m : Int)\n raise NotImplementedError.new(\"==\")\n end\n\n def succ\n Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)\n end\n\n def pred\n Mint.raw(value != 0 ? value &- 1 : MOD &- 1)\n end\n\n def abs\n self\n end\n\n def to_i64 : Int64\n value\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nstruct Int\n {% for op in %w[+ - * / //] %}\n def {{op.id}}(value : Mint)\n to_m {{op.id}} value\n end\n {% end %}\n\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass String\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass Combination(T)\n def initialize\n @size = 2\n @factorial = [T.new(1), T.new(1)]\n @inv = [T.zero, T.new(1)]\n @finv = [T.new(1), T.new(1)]\n end\n\n private def expand_until(n : Int)\n while @size <= n\n @factorial << @factorial[-1] * @size\n @inv << -@inv[T::MOD % @size] * (T::MOD // @size)\n @finv << @finv[-1] * @inv[@size]\n @size += 1\n end\n end\n\n def factorial(n : Int)\n expand_until(n)\n @factorial[n]\n end\n\n def inv(n : Int)\n expand_until(n)\n @inv[n]\n end\n\n def finv(n : Int)\n expand_until(n)\n @finv[n]\n end\n\n def permutation(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(n - r)\n end\n\n def combination(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(r) * finv(n - r)\n end\n\n def repeated_combination(n : Int, r : Int)\n (n < 0 || r < 0) ? T.zero : r == 0 ? T.new(1) : combination(n + r - 1, r)\n end\nend\n\nn = read_line.to_i\nC = Combination(Mint).new\nputs (1..n).join('\\n') { |k|\n (1..(k == 1 ? n : n.pred // k.pred + 1)).sum { |a|\n C.combination(n - k.pred * a.pred, a)\n }\n}\n" }, { "id": 117, "name": "015", "C++": "#include \n#include \nusing ll = long long;\n#define mod 1000000007\nusing namespace std;\n\n//34[ms]\nstruct mint{\n ll x;\n mint(ll x = 0) : x((x + mod) % mod){}\n mint operator-() const{ return mint(-x); }\n mint operator+=(const mint &a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint &operator++(){\n if(++x == mod) x = 0;\n return *this;\n }\n mint operator++(int){\n mint temp = *this;\n if(++x == mod) x = 0;\n return temp;\n }\n mint &operator-=(const mint &a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n mint &operator--(){\n if(--x < 0) x += mod;\n return *this;\n }\n mint operator--(int){\n mint temp = *this;\n if(--x < 0) x += mod;\n return temp;\n }\n mint &operator*=(const mint &a){\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint &a) const{ return mint(*this) += a; }\n mint operator-(const mint &a) const{ return mint(*this) -= a; }\n mint operator*(const mint &a) const{ return mint(*this) *= a; }\n mint pow(ll t) const{\n if(!t) return 1;\n mint a = pow(t >> 1);\n a *= a;\n if (t & 1) a *= *this;\n return a;\n }\n mint inv() const{ return pow(mod - 2); }\n mint &operator/=(const mint &a){ return (*this) *= a.inv(); }\n mint operator/(const mint &a) const{ return mint(*this) /= a; }\n friend istream &operator>>(istream &is, mint &a){ return is >> a.x; }\n friend ostream &operator<<(ostream &os, const mint &a){ return os << a.x; }\n};\nconst int len = 100010;\nvector fact(len), invfact(len);\nmint choose(int n, int r){\n return fact[n] * invfact[n - r] * invfact[r];\n}\n\nint main(){\n fact[0] = fact[1] = 1;\n for(int i = 2; i < len; i++) fact[i] = fact[i - 1] * i;\n invfact[len - 1] = fact[len - 1].inv();\n for(int i = len - 2; i >= 0; i--) invfact[i] = invfact[i + 1] * (i + 1);\n\n int n;\n cin >> n;\n for(int k = 1; k <= n; k++){\n mint ans = 0;\n for(int j = 1; (j-1)*k+1 <= n; j++){\n int num = n - ((j-1)*k + 1);\n //j+1 H num\n ans += choose(j + num, j);\n }\n cout << ans << \"\\n\";\n }\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\n\nMOD = 10**9 + 7\nclass Mint:\n __slots__ = ('value')\n\n def __init__(self, value=0):\n self.value = int(value) % MOD\n if self.value < 0: self.value += MOD\n\n def inverse(self):\n a, b = self.value, MOD\n u, v = 1, 0\n while b:\n t = a // b\n b, a = a - t * b, b\n v, u = u - t * v, v\n if u < 0: u += MOD\n return u\n\n def __repr__(self): return str(self.value)\n def __int__(self): return self.value\n def __eq__(self, other): return self.value == other.value\n def __neg__(self): return Mint(-self.value)\n def __hash__(self): return hash(self.value)\n def __bool__(self): return self.value != 0\n\n def __iadd__(self, other):\n self.value = (self.value + int(other)) % MOD\n return self\n\n def __add__(self, other):\n new_obj = Mint(self.value)\n new_obj += other\n return new_obj\n __radd__ = __add__\n\n def __isub__(self, other):\n self.value = (self.value - int(other)) % MOD\n if self.value < 0: self.value += MOD\n return self\n\n def __sub__(self, other):\n new_obj = Mint(self.value)\n new_obj -= other\n return new_obj\n\n def __rsub__(self, other):\n new_obj = Mint(int(other))\n new_obj -= self\n return new_obj\n\n def __imul__(self, other):\n self.value = self.value * int(other) % MOD\n return self\n\n def __mul__(self, other):\n new_obj = Mint(self.value)\n new_obj *= other\n return new_obj\n __rmul__ = __mul__\n\n def __ifloordiv__(self, other):\n other = other if isinstance(other, Mint) else Mint(other)\n self *= other.inverse()\n return self\n\n def __floordiv__(self, other):\n new_obj = Mint(self.value)\n new_obj //= other\n return new_obj\n\n def __rfloordiv__(self, other):\n new_obj = Mint(int(other))\n new_obj //= self\n return new_obj\n\nclass FactorialUtils:\n __slots__ = ('fac', 'ifac')\n\n def __init__(self, n):\n self.fac = [1] * (n + 1)\n self.ifac = [1] * (n + 1)\n for i in range(2, n + 1): self.fac[i] = self.fac[i - 1] * i % MOD\n self.ifac[n] = pow(self.fac[n], MOD - 2, MOD)\n for i in range(n, 1, -1): self.ifac[i - 1] = self.ifac[i] * i % MOD\n\n def choose(self, n, r):\n if r < 0 or r > n: return 0\n return (self.fac[n] * self.ifac[n - r] % MOD) * self.ifac[r] % MOD\n\n def multichoose(self, u, k):\n return (self.fac[u + k - 1] * self.ifac[u - 1] % MOD) * self.ifac[k] % MOD\n\n def permutation(self, n, r):\n if r < 0 or r > n: return 0\n return self.fac[n] * self.ifac[n - r] % MOD\n\nfu = FactorialUtils(N)\nfor k in range(1, N + 1):\n ans = Mint()\n for i in range(N // k + 1):\n ans += fu.choose(N - (k - 1) * i, i + 1)\n print(ans)\n" }, { "id": 118, "name": "015", "C++": "#include \n#include \nusing ll = long long;\n#define mod 1000000007\nusing namespace std;\n\n//34[ms]\nstruct mint{\n ll x;\n mint(ll x = 0) : x((x + mod) % mod){}\n mint operator-() const{ return mint(-x); }\n mint operator+=(const mint &a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint &operator++(){\n if(++x == mod) x = 0;\n return *this;\n }\n mint operator++(int){\n mint temp = *this;\n if(++x == mod) x = 0;\n return temp;\n }\n mint &operator-=(const mint &a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n mint &operator--(){\n if(--x < 0) x += mod;\n return *this;\n }\n mint operator--(int){\n mint temp = *this;\n if(--x < 0) x += mod;\n return temp;\n }\n mint &operator*=(const mint &a){\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint &a) const{ return mint(*this) += a; }\n mint operator-(const mint &a) const{ return mint(*this) -= a; }\n mint operator*(const mint &a) const{ return mint(*this) *= a; }\n mint pow(ll t) const{\n if(!t) return 1;\n mint a = pow(t >> 1);\n a *= a;\n if (t & 1) a *= *this;\n return a;\n }\n mint inv() const{ return pow(mod - 2); }\n mint &operator/=(const mint &a){ return (*this) *= a.inv(); }\n mint operator/(const mint &a) const{ return mint(*this) /= a; }\n friend istream &operator>>(istream &is, mint &a){ return is >> a.x; }\n friend ostream &operator<<(ostream &os, const mint &a){ return os << a.x; }\n};\nconst int len = 100010;\nvector fact(len), invfact(len);\nmint choose(int n, int r){\n return fact[n] * invfact[n - r] * invfact[r];\n}\n\nint main(){\n fact[0] = fact[1] = 1;\n for(int i = 2; i < len; i++) fact[i] = fact[i - 1] * i;\n invfact[len - 1] = fact[len - 1].inv();\n for(int i = len - 2; i >= 0; i--) invfact[i] = invfact[i + 1] * (i + 1);\n\n int n;\n cin >> n;\n for(int k = 1; k <= n; k++){\n mint ans = 0;\n for(int j = 1; (j-1)*k+1 <= n; j++){\n int num = n - ((j-1)*k + 1);\n //j+1 H num\n ans += choose(j + num, j);\n }\n cout << ans << \"\\n\";\n }\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tconst mod: int :: 1000000007\n\tvar comb: @Comb :: (#@Comb).init(n, mod)\n\tvar ans: []int :: #[n + 1]int\n\tfor k(1, n)\n\t\tvar numMax: int :: (n - 1) / k + 1\n\t\tfor num(1, numMax)\n\t\t\tvar remains: int :: n - 1 - k * (num - 1)\n\t\t\tdo ans[k] :+ comb.comb(num + remains, remains)\n\t\t\tdo ans[k] :% mod\n\t\tend for\n\tend for\n\tfor k(1, n)\n\t\tdo cui@print(\"\\{ans[k]}\\n\")\n\tend for\nend func\n\nclass Comb()\n\tvar mod: int\n\tvar fact: []int\n\tvar inv: []int\n\t\n\t+func init(n: int, mod: int): Comb\n\t\tdo me.mod :: mod\n\t\tdo me.fact :: #[n + 1]int\n\t\tdo me.inv :: #[n + 1]int\n\t\tdo me.fact[0] :: 1\n\t\tfor i(1, n)\n\t\t\tdo me.fact[i] :: me.fact[i - 1] * i % mod\n\t\tend for\n\t\tdo me.inv[n] :: math@modPow(me.fact[n], mod - 2, mod)\n\t\tfor i(n, 1, -1)\n\t\t\tdo me.inv[i - 1] :: me.inv[i] * i % mod\n\t\tend for\n\t\tret me\n\tend func\n\t\n\t+func comb(n: int, r: int): int\n\t\tret me.fact[n] * me.inv[n - r] % me.mod * me.inv[r] % me.mod\n\tend func\nend class\n" }, { "id": 119, "name": "015", "Crystal": "struct Mint\n MOD = 1000000007i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n @value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n getter value : Int64\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD &- value : 0i64)\n end\n\n def +(v)\n self + v.to_m\n end\n\n def +(m : self)\n x = value &+ m.value\n x &-= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - v.to_m\n end\n\n def -(m : self)\n x = value &- m.value\n x &+= MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * v.to_m\n end\n\n def *(m : self)\n Mint.new(value &* m.value)\n end\n\n def /(v)\n self / v.to_m\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.to_i64, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a &-= t &* b\n a, b = b, a\n u &-= t &* v\n u, v = v, u\n end\n Mint.new(value &* u)\n end\n\n def //(v)\n self / v\n end\n\n def **(exponent : Int)\n t, res = self, Mint.raw(1i64)\n while exponent > 0\n res *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n res\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m : Int)\n raise NotImplementedError.new(\"==\")\n end\n\n def succ\n Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)\n end\n\n def pred\n Mint.raw(value != 0 ? value &- 1 : MOD &- 1)\n end\n\n def abs\n self\n end\n\n def to_i64 : Int64\n value\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nstruct Int\n {% for op in %w[+ - * / //] %}\n def {{op.id}}(value : Mint)\n to_m {{op.id}} value\n end\n {% end %}\n\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass String\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass Combination(T)\n def initialize\n @size = 2\n @factorial = [T.new(1), T.new(1)]\n @inv = [T.zero, T.new(1)]\n @finv = [T.new(1), T.new(1)]\n end\n\n private def expand_until(n : Int)\n while @size <= n\n @factorial << @factorial[-1] * @size\n @inv << -@inv[T::MOD % @size] * (T::MOD // @size)\n @finv << @finv[-1] * @inv[@size]\n @size += 1\n end\n end\n\n def factorial(n : Int)\n expand_until(n)\n @factorial[n]\n end\n\n def inv(n : Int)\n expand_until(n)\n @inv[n]\n end\n\n def finv(n : Int)\n expand_until(n)\n @finv[n]\n end\n\n def permutation(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(n - r)\n end\n\n def combination(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(r) * finv(n - r)\n end\n\n def repeated_combination(n : Int, r : Int)\n (n < 0 || r < 0) ? T.zero : r == 0 ? T.new(1) : combination(n + r - 1, r)\n end\nend\n\nn = read_line.to_i\nC = Combination(Mint).new\nputs (1..n).join('\\n') { |k|\n (1..(k == 1 ? n : n.pred // k.pred + 1)).sum { |a|\n C.combination(n - k.pred * a.pred, a)\n }\n}\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\n\nMOD = 10**9 + 7\nclass Mint:\n __slots__ = ('value')\n\n def __init__(self, value=0):\n self.value = int(value) % MOD\n if self.value < 0: self.value += MOD\n\n def inverse(self):\n a, b = self.value, MOD\n u, v = 1, 0\n while b:\n t = a // b\n b, a = a - t * b, b\n v, u = u - t * v, v\n if u < 0: u += MOD\n return u\n\n def __repr__(self): return str(self.value)\n def __int__(self): return self.value\n def __eq__(self, other): return self.value == other.value\n def __neg__(self): return Mint(-self.value)\n def __hash__(self): return hash(self.value)\n def __bool__(self): return self.value != 0\n\n def __iadd__(self, other):\n self.value = (self.value + int(other)) % MOD\n return self\n\n def __add__(self, other):\n new_obj = Mint(self.value)\n new_obj += other\n return new_obj\n __radd__ = __add__\n\n def __isub__(self, other):\n self.value = (self.value - int(other)) % MOD\n if self.value < 0: self.value += MOD\n return self\n\n def __sub__(self, other):\n new_obj = Mint(self.value)\n new_obj -= other\n return new_obj\n\n def __rsub__(self, other):\n new_obj = Mint(int(other))\n new_obj -= self\n return new_obj\n\n def __imul__(self, other):\n self.value = self.value * int(other) % MOD\n return self\n\n def __mul__(self, other):\n new_obj = Mint(self.value)\n new_obj *= other\n return new_obj\n __rmul__ = __mul__\n\n def __ifloordiv__(self, other):\n other = other if isinstance(other, Mint) else Mint(other)\n self *= other.inverse()\n return self\n\n def __floordiv__(self, other):\n new_obj = Mint(self.value)\n new_obj //= other\n return new_obj\n\n def __rfloordiv__(self, other):\n new_obj = Mint(int(other))\n new_obj //= self\n return new_obj\n\nclass FactorialUtils:\n __slots__ = ('fac', 'ifac')\n\n def __init__(self, n):\n self.fac = [1] * (n + 1)\n self.ifac = [1] * (n + 1)\n for i in range(2, n + 1): self.fac[i] = self.fac[i - 1] * i % MOD\n self.ifac[n] = pow(self.fac[n], MOD - 2, MOD)\n for i in range(n, 1, -1): self.ifac[i - 1] = self.ifac[i] * i % MOD\n\n def choose(self, n, r):\n if r < 0 or r > n: return 0\n return (self.fac[n] * self.ifac[n - r] % MOD) * self.ifac[r] % MOD\n\n def multichoose(self, u, k):\n return (self.fac[u + k - 1] * self.ifac[u - 1] % MOD) * self.ifac[k] % MOD\n\n def permutation(self, n, r):\n if r < 0 or r > n: return 0\n return self.fac[n] * self.ifac[n - r] % MOD\n\nfu = FactorialUtils(N)\nfor k in range(1, N + 1):\n ans = Mint()\n for i in range(N // k + 1):\n ans += fu.choose(N - (k - 1) * i, i + 1)\n print(ans)\n" }, { "id": 120, "name": "015", "Crystal": "struct Mint\n MOD = 1000000007i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n @value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n getter value : Int64\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD &- value : 0i64)\n end\n\n def +(v)\n self + v.to_m\n end\n\n def +(m : self)\n x = value &+ m.value\n x &-= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - v.to_m\n end\n\n def -(m : self)\n x = value &- m.value\n x &+= MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * v.to_m\n end\n\n def *(m : self)\n Mint.new(value &* m.value)\n end\n\n def /(v)\n self / v.to_m\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.to_i64, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a &-= t &* b\n a, b = b, a\n u &-= t &* v\n u, v = v, u\n end\n Mint.new(value &* u)\n end\n\n def //(v)\n self / v\n end\n\n def **(exponent : Int)\n t, res = self, Mint.raw(1i64)\n while exponent > 0\n res *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n res\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m : Int)\n raise NotImplementedError.new(\"==\")\n end\n\n def succ\n Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)\n end\n\n def pred\n Mint.raw(value != 0 ? value &- 1 : MOD &- 1)\n end\n\n def abs\n self\n end\n\n def to_i64 : Int64\n value\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nstruct Int\n {% for op in %w[+ - * / //] %}\n def {{op.id}}(value : Mint)\n to_m {{op.id}} value\n end\n {% end %}\n\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass String\n def to_m : Mint\n Mint.new(self)\n end\nend\n\nclass Combination(T)\n def initialize\n @size = 2\n @factorial = [T.new(1), T.new(1)]\n @inv = [T.zero, T.new(1)]\n @finv = [T.new(1), T.new(1)]\n end\n\n private def expand_until(n : Int)\n while @size <= n\n @factorial << @factorial[-1] * @size\n @inv << -@inv[T::MOD % @size] * (T::MOD // @size)\n @finv << @finv[-1] * @inv[@size]\n @size += 1\n end\n end\n\n def factorial(n : Int)\n expand_until(n)\n @factorial[n]\n end\n\n def inv(n : Int)\n expand_until(n)\n @inv[n]\n end\n\n def finv(n : Int)\n expand_until(n)\n @finv[n]\n end\n\n def permutation(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(n - r)\n end\n\n def combination(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(r) * finv(n - r)\n end\n\n def repeated_combination(n : Int, r : Int)\n (n < 0 || r < 0) ? T.zero : r == 0 ? T.new(1) : combination(n + r - 1, r)\n end\nend\n\nn = read_line.to_i\nC = Combination(Mint).new\nputs (1..n).join('\\n') { |k|\n (1..(k == 1 ? n : n.pred // k.pred + 1)).sum { |a|\n C.combination(n - k.pred * a.pred, a)\n }\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tconst mod: int :: 1000000007\n\tvar comb: @Comb :: (#@Comb).init(n, mod)\n\tvar ans: []int :: #[n + 1]int\n\tfor k(1, n)\n\t\tvar numMax: int :: (n - 1) / k + 1\n\t\tfor num(1, numMax)\n\t\t\tvar remains: int :: n - 1 - k * (num - 1)\n\t\t\tdo ans[k] :+ comb.comb(num + remains, remains)\n\t\t\tdo ans[k] :% mod\n\t\tend for\n\tend for\n\tfor k(1, n)\n\t\tdo cui@print(\"\\{ans[k]}\\n\")\n\tend for\nend func\n\nclass Comb()\n\tvar mod: int\n\tvar fact: []int\n\tvar inv: []int\n\t\n\t+func init(n: int, mod: int): Comb\n\t\tdo me.mod :: mod\n\t\tdo me.fact :: #[n + 1]int\n\t\tdo me.inv :: #[n + 1]int\n\t\tdo me.fact[0] :: 1\n\t\tfor i(1, n)\n\t\t\tdo me.fact[i] :: me.fact[i - 1] * i % mod\n\t\tend for\n\t\tdo me.inv[n] :: math@modPow(me.fact[n], mod - 2, mod)\n\t\tfor i(n, 1, -1)\n\t\t\tdo me.inv[i - 1] :: me.inv[i] * i % mod\n\t\tend for\n\t\tret me\n\tend func\n\t\n\t+func comb(n: int, r: int): int\n\t\tret me.fact[n] * me.inv[n - r] % me.mod * me.inv[r] % me.mod\n\tend func\nend class\n" }, { "id": 121, "name": "015", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\n\nMOD = 10**9 + 7\nclass Mint:\n __slots__ = ('value')\n\n def __init__(self, value=0):\n self.value = int(value) % MOD\n if self.value < 0: self.value += MOD\n\n def inverse(self):\n a, b = self.value, MOD\n u, v = 1, 0\n while b:\n t = a // b\n b, a = a - t * b, b\n v, u = u - t * v, v\n if u < 0: u += MOD\n return u\n\n def __repr__(self): return str(self.value)\n def __int__(self): return self.value\n def __eq__(self, other): return self.value == other.value\n def __neg__(self): return Mint(-self.value)\n def __hash__(self): return hash(self.value)\n def __bool__(self): return self.value != 0\n\n def __iadd__(self, other):\n self.value = (self.value + int(other)) % MOD\n return self\n\n def __add__(self, other):\n new_obj = Mint(self.value)\n new_obj += other\n return new_obj\n __radd__ = __add__\n\n def __isub__(self, other):\n self.value = (self.value - int(other)) % MOD\n if self.value < 0: self.value += MOD\n return self\n\n def __sub__(self, other):\n new_obj = Mint(self.value)\n new_obj -= other\n return new_obj\n\n def __rsub__(self, other):\n new_obj = Mint(int(other))\n new_obj -= self\n return new_obj\n\n def __imul__(self, other):\n self.value = self.value * int(other) % MOD\n return self\n\n def __mul__(self, other):\n new_obj = Mint(self.value)\n new_obj *= other\n return new_obj\n __rmul__ = __mul__\n\n def __ifloordiv__(self, other):\n other = other if isinstance(other, Mint) else Mint(other)\n self *= other.inverse()\n return self\n\n def __floordiv__(self, other):\n new_obj = Mint(self.value)\n new_obj //= other\n return new_obj\n\n def __rfloordiv__(self, other):\n new_obj = Mint(int(other))\n new_obj //= self\n return new_obj\n\nclass FactorialUtils:\n __slots__ = ('fac', 'ifac')\n\n def __init__(self, n):\n self.fac = [1] * (n + 1)\n self.ifac = [1] * (n + 1)\n for i in range(2, n + 1): self.fac[i] = self.fac[i - 1] * i % MOD\n self.ifac[n] = pow(self.fac[n], MOD - 2, MOD)\n for i in range(n, 1, -1): self.ifac[i - 1] = self.ifac[i] * i % MOD\n\n def choose(self, n, r):\n if r < 0 or r > n: return 0\n return (self.fac[n] * self.ifac[n - r] % MOD) * self.ifac[r] % MOD\n\n def multichoose(self, u, k):\n return (self.fac[u + k - 1] * self.ifac[u - 1] % MOD) * self.ifac[k] % MOD\n\n def permutation(self, n, r):\n if r < 0 or r > n: return 0\n return self.fac[n] * self.ifac[n - r] % MOD\n\nfu = FactorialUtils(N)\nfor k in range(1, N + 1):\n ans = Mint()\n for i in range(N // k + 1):\n ans += fu.choose(N - (k - 1) * i, i + 1)\n print(ans)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tconst mod: int :: 1000000007\n\tvar comb: @Comb :: (#@Comb).init(n, mod)\n\tvar ans: []int :: #[n + 1]int\n\tfor k(1, n)\n\t\tvar numMax: int :: (n - 1) / k + 1\n\t\tfor num(1, numMax)\n\t\t\tvar remains: int :: n - 1 - k * (num - 1)\n\t\t\tdo ans[k] :+ comb.comb(num + remains, remains)\n\t\t\tdo ans[k] :% mod\n\t\tend for\n\tend for\n\tfor k(1, n)\n\t\tdo cui@print(\"\\{ans[k]}\\n\")\n\tend for\nend func\n\nclass Comb()\n\tvar mod: int\n\tvar fact: []int\n\tvar inv: []int\n\t\n\t+func init(n: int, mod: int): Comb\n\t\tdo me.mod :: mod\n\t\tdo me.fact :: #[n + 1]int\n\t\tdo me.inv :: #[n + 1]int\n\t\tdo me.fact[0] :: 1\n\t\tfor i(1, n)\n\t\t\tdo me.fact[i] :: me.fact[i - 1] * i % mod\n\t\tend for\n\t\tdo me.inv[n] :: math@modPow(me.fact[n], mod - 2, mod)\n\t\tfor i(n, 1, -1)\n\t\t\tdo me.inv[i - 1] :: me.inv[i] * i % mod\n\t\tend for\n\t\tret me\n\tend func\n\t\n\t+func comb(n: int, r: int): int\n\t\tret me.fact[n] * me.inv[n - r] % me.mod * me.inv[r] % me.mod\n\tend func\nend class\n" }, { "id": 122, "name": "016", "C++": "#include \nusing namespace std;\nusing ll = long long;\nusing pll = pair;\n\n// ap + bq = gcd(a, b)\npll extGCD(ll a, ll b) {\n ll p11 = 1, p12 = 0, p21 = 0, p22 = 1;\n while (b) {\n ll s = a / b;\n // matrix{{0, 1}, {1, -s}}\n a -= s * b;\n swap(a, b);\n\n p11 -= s * p21;\n p12 -= s * p22;\n swap(p11, p21);\n swap(p12, p22);\n }\n return {p11, p12};\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N, A, B, C;\n cin >> N >> A >> B >> C;\n\n if (A < B)\n swap(A, B);\n if (A < C)\n swap(A, C);\n\n ll ans = INT_MAX;\n\n if (B > C)\n swap(B, C);\n ll g = gcd(B, C);\n ll CC = C / g, BB = B / g;\n auto [p, q] = extGCD(B, C);\n\n for (int i = 0; i < 10000; ++i) {\n ll rem = N - i * A;\n if (rem < 0)\n break;\n if (rem % g != 0)\n continue;\n\n ll mul = rem / g;\n ll ptmp = p, qtmp = q;\n ptmp *= mul, qtmp *= mul;\n if (ptmp >= 0) {\n ll d = ptmp / CC;\n ptmp -= d * CC;\n qtmp += d * BB;\n } else {\n ll d = (-ptmp + CC - 1) / CC;\n ptmp += d * CC;\n qtmp -= d * BB;\n }\n\n if (qtmp < 0)\n continue;\n\n ans = min(ans, i + ptmp + qtmp);\n }\n\n cout << ans << \"\\n\";\n\n return 0;\n}\n", "Crystal": "n = read_line.to_i\na, b, c = read_line.split.map(&.to_i)\n\nlimit = 10000\nans = limit\n(0..{limit, n // a}.min).each do |i|\n n2 = n - a * i\n (0..{limit, n2 // b}.min).each do |j|\n n3 = n2 - b * j\n ans = {ans, i + j + n3 // c}.min if n3 % c == 0\n end\nend\nputs ans\n" }, { "id": 123, "name": "016", "C++": "#include \nusing namespace std;\nusing ll = long long;\nusing pll = pair;\n\n// ap + bq = gcd(a, b)\npll extGCD(ll a, ll b) {\n ll p11 = 1, p12 = 0, p21 = 0, p22 = 1;\n while (b) {\n ll s = a / b;\n // matrix{{0, 1}, {1, -s}}\n a -= s * b;\n swap(a, b);\n\n p11 -= s * p21;\n p12 -= s * p22;\n swap(p11, p21);\n swap(p12, p22);\n }\n return {p11, p12};\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N, A, B, C;\n cin >> N >> A >> B >> C;\n\n if (A < B)\n swap(A, B);\n if (A < C)\n swap(A, C);\n\n ll ans = INT_MAX;\n\n if (B > C)\n swap(B, C);\n ll g = gcd(B, C);\n ll CC = C / g, BB = B / g;\n auto [p, q] = extGCD(B, C);\n\n for (int i = 0; i < 10000; ++i) {\n ll rem = N - i * A;\n if (rem < 0)\n break;\n if (rem % g != 0)\n continue;\n\n ll mul = rem / g;\n ll ptmp = p, qtmp = q;\n ptmp *= mul, qtmp *= mul;\n if (ptmp >= 0) {\n ll d = ptmp / CC;\n ptmp -= d * CC;\n qtmp += d * BB;\n } else {\n ll d = (-ptmp + CC - 1) / CC;\n ptmp += d * CC;\n qtmp -= d * BB;\n }\n\n if (qtmp < 0)\n continue;\n\n ans = min(ans, i + ptmp + qtmp);\n }\n\n cout << ans << \"\\n\";\n\n return 0;\n}\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nC, B, A = sorted(map(int, input().split()))\nM = 9999\nans = M\nfor a in range(min(M, N // A) + 1):\n n1 = N - a * A\n for b in range(min(M, n1 // B) + 1):\n n2 = n1 - b * B\n if n2 % C == 0:\n ans = min(ans, a + b + n2 // C)\nprint(ans)\n" }, { "id": 124, "name": "016", "C++": "#include \nusing namespace std;\nusing ll = long long;\nusing pll = pair;\n\n// ap + bq = gcd(a, b)\npll extGCD(ll a, ll b) {\n ll p11 = 1, p12 = 0, p21 = 0, p22 = 1;\n while (b) {\n ll s = a / b;\n // matrix{{0, 1}, {1, -s}}\n a -= s * b;\n swap(a, b);\n\n p11 -= s * p21;\n p12 -= s * p22;\n swap(p11, p21);\n swap(p12, p22);\n }\n return {p11, p12};\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N, A, B, C;\n cin >> N >> A >> B >> C;\n\n if (A < B)\n swap(A, B);\n if (A < C)\n swap(A, C);\n\n ll ans = INT_MAX;\n\n if (B > C)\n swap(B, C);\n ll g = gcd(B, C);\n ll CC = C / g, BB = B / g;\n auto [p, q] = extGCD(B, C);\n\n for (int i = 0; i < 10000; ++i) {\n ll rem = N - i * A;\n if (rem < 0)\n break;\n if (rem % g != 0)\n continue;\n\n ll mul = rem / g;\n ll ptmp = p, qtmp = q;\n ptmp *= mul, qtmp *= mul;\n if (ptmp >= 0) {\n ll d = ptmp / CC;\n ptmp -= d * CC;\n qtmp += d * BB;\n } else {\n ll d = (-ptmp + CC - 1) / CC;\n ptmp += d * CC;\n qtmp -= d * BB;\n }\n\n if (qtmp < 0)\n continue;\n\n ans = min(ans, i + ptmp + qtmp);\n }\n\n cout << ans << \"\\n\";\n\n return 0;\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar c: int :: cui@inputInt()\n\tconst max: int :: 9999\n\tvar ans: int :: max\n\tfor i(0, max)\n\t\tfor j(0, max - i)\n\t\t\tvar remains: int :: n - a * i - b * j\n\t\t\tif(remains >= 0 & remains % c = 0)\n\t\t\t\tdo ans :: lib@min(ans, i + j + remains / c)\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 125, "name": "016", "Crystal": "n = read_line.to_i\na, b, c = read_line.split.map(&.to_i)\n\nlimit = 10000\nans = limit\n(0..{limit, n // a}.min).each do |i|\n n2 = n - a * i\n (0..{limit, n2 // b}.min).each do |j|\n n3 = n2 - b * j\n ans = {ans, i + j + n3 // c}.min if n3 % c == 0\n end\nend\nputs ans\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nC, B, A = sorted(map(int, input().split()))\nM = 9999\nans = M\nfor a in range(min(M, N // A) + 1):\n n1 = N - a * A\n for b in range(min(M, n1 // B) + 1):\n n2 = n1 - b * B\n if n2 % C == 0:\n ans = min(ans, a + b + n2 // C)\nprint(ans)\n" }, { "id": 126, "name": "016", "Crystal": "n = read_line.to_i\na, b, c = read_line.split.map(&.to_i)\n\nlimit = 10000\nans = limit\n(0..{limit, n // a}.min).each do |i|\n n2 = n - a * i\n (0..{limit, n2 // b}.min).each do |j|\n n3 = n2 - b * j\n ans = {ans, i + j + n3 // c}.min if n3 % c == 0\n end\nend\nputs ans\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar c: int :: cui@inputInt()\n\tconst max: int :: 9999\n\tvar ans: int :: max\n\tfor i(0, max)\n\t\tfor j(0, max - i)\n\t\t\tvar remains: int :: n - a * i - b * j\n\t\t\tif(remains >= 0 & remains % c = 0)\n\t\t\t\tdo ans :: lib@min(ans, i + j + remains / c)\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 127, "name": "016", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nN = int(input())\nC, B, A = sorted(map(int, input().split()))\nM = 9999\nans = M\nfor a in range(min(M, N // A) + 1):\n n1 = N - a * A\n for b in range(min(M, n1 // B) + 1):\n n2 = n1 - b * B\n if n2 % C == 0:\n ans = min(ans, a + b + n2 // C)\nprint(ans)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar c: int :: cui@inputInt()\n\tconst max: int :: 9999\n\tvar ans: int :: max\n\tfor i(0, max)\n\t\tfor j(0, max - i)\n\t\t\tvar remains: int :: n - a * i - b * j\n\t\t\tif(remains >= 0 & remains % c = 0)\n\t\t\t\tdo ans :: lib@min(ans, i + j + remains / c)\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 128, "name": "017", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass BIT {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector bit;\n\n\n\n\tvoid init(int sz) {\n\n\t\tsize_ = sz + 2;\n\n\t\tbit.resize(size_ + 2, 0);\n\n\t}\n\n\tvoid add(int pos, long long x) {\n\n\t\tpos++;\n\n\t\twhile (pos <= size_) {\n\n\t\t\tbit[pos] += x;\n\n\t\t\tpos += (pos & -pos);\n\n\t\t}\n\n\t}\n\n\tlong long sum(int pos) {\n\n\t\tlong long s = 0; pos++;\n\n\t\twhile (pos >= 1) {\n\n\t\t\ts += bit[pos];\n\n\t\t\tpos -= (pos & -pos);\n\n\t\t}\n\n\t\treturn s;\n\n\t}\n\n};\n\n\n\n// Input\n\nlong long N, M;\n\nlong long L[1 << 18], R[1 << 18];\n\n\n\n// Kazoeage\n\nlong long V1[1 << 18], V2[1 << 18], V3[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. Get Answer1\n\n\tlong long Answer1 = 0;\n\n\tfor (int i = 1; i <= M; i++) V3[L[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V3[R[i]] += 1;\n\n\tfor (int i = 1; i <= N; i++) Answer1 += V3[i] * (V3[i] - 1LL) / 2LL;\n\n\n\n\t// Step #3. Get Answer2\n\n\tlong long Answer2 = 0;\n\n\tfor (int i = 1; i <= M; i++) V1[R[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V2[L[i] - 1] += 1;\n\n\tfor (int i = 1; i <= N; i++) V1[i] += V1[i - 1];\n\n\tfor (int i = 1; i <= N; i++) Answer2 += V1[i] * V2[i];\n\n\n\n\t// Step #4. Sorting\n\n\tvector> vec;\n\n\tfor (int i = 1; i <= M; i++) vec.push_back(make_pair(R[i], L[i]));\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// Step #5. Get Answer3\n\n\tlong long Answer3 = 0;\n\n\tBIT Z; Z.init(N + 2);\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tlong long cl = vec[i].second, cr = vec[i].first;\n\n\t\tlong long ret = Z.sum(cr) - Z.sum(cl);\n\n\t\tAnswer3 += ret;\n\n\t\tZ.add(cl, 1);\n\n\t}\n\n\n\n\t// Step #6. Output The Answer!\n\n\tlong long Total = M * (M - 1) / 2LL;\n\n\tlong long SumAns = Answer1 + Answer2 + Answer3;\n\n\tcout << Total - SumAns << endl;\n\n\treturn 0;\n\n}", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::fenwick_tree](https://atcoder.github.io/ac-library/master/document_en/fenwicktree.html).\n #\n # ```\n # tree = AtCoder::FenwickTree(Int64).new(10)\n # tree.add(3, 10)\n # tree.add(5, 20)\n # tree[3..5] # => 30\n # tree[3...5] # => 10\n # ```\n class FenwickTree(T)\n getter size : Int64\n getter bits : Array(T)\n\n def initialize(@size)\n @bits = Array(T).new(@size, T.zero)\n end\n\n # Implements atcoder::fenwick_tree.add(index, value)\n def add(index, value)\n index += 1 # convert to 1-indexed\n while index <= @size\n @bits[index - 1] += value\n index += index & -index\n end\n end\n\n # Exclusive left sum\n def left_sum(index)\n ret = T.zero\n while index >= 1\n ret += @bits[index - 1]\n index -= index & -index\n end\n ret\n end\n\n # Implements atcoder::fenwick_tree.sum(left, right)\n def sum(left, right)\n left_sum(right) - left_sum(left)\n end\n\n # :ditto:\n def [](range : Range(Int, Int))\n left = range.begin\n right = range.exclusive? ? range.end : range.end + 1\n sum(left, right)\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nlr = (1..m).map { {Int32, Int32}.from read_line.split.map(&.to_i.pred) }\n\ncnt = [0i64] * n\ncnt_r = [0i64] * n\nlr.each do |(l, r)|\n cnt[l] += 1\n cnt[r] += 1\n cnt_r[r] += 1\nend\nsum_r = cnt_r.reduce([0i64]) do |acc, x|\n acc << acc[-1] + x\nend\n\nans = m.to_i64 * m.pred // 2\nans -= cnt.sum { |x| x * x.pred // 2 }\nans -= lr.sum { |(l, r)| sum_r[l] }\n\nsum_l = AtCoder::FenwickTree(Int64).new(n.to_i64)\nlr.sort_by { |(l, r)| {r, l} }.each do |(l, r)|\n ans -= sum_l[l + 1...r]\n sum_l.add(l, 1i64)\nend\n\nputs ans\n" }, { "id": 129, "name": "017", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass BIT {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector bit;\n\n\n\n\tvoid init(int sz) {\n\n\t\tsize_ = sz + 2;\n\n\t\tbit.resize(size_ + 2, 0);\n\n\t}\n\n\tvoid add(int pos, long long x) {\n\n\t\tpos++;\n\n\t\twhile (pos <= size_) {\n\n\t\t\tbit[pos] += x;\n\n\t\t\tpos += (pos & -pos);\n\n\t\t}\n\n\t}\n\n\tlong long sum(int pos) {\n\n\t\tlong long s = 0; pos++;\n\n\t\twhile (pos >= 1) {\n\n\t\t\ts += bit[pos];\n\n\t\t\tpos -= (pos & -pos);\n\n\t\t}\n\n\t\treturn s;\n\n\t}\n\n};\n\n\n\n// Input\n\nlong long N, M;\n\nlong long L[1 << 18], R[1 << 18];\n\n\n\n// Kazoeage\n\nlong long V1[1 << 18], V2[1 << 18], V3[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. Get Answer1\n\n\tlong long Answer1 = 0;\n\n\tfor (int i = 1; i <= M; i++) V3[L[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V3[R[i]] += 1;\n\n\tfor (int i = 1; i <= N; i++) Answer1 += V3[i] * (V3[i] - 1LL) / 2LL;\n\n\n\n\t// Step #3. Get Answer2\n\n\tlong long Answer2 = 0;\n\n\tfor (int i = 1; i <= M; i++) V1[R[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V2[L[i] - 1] += 1;\n\n\tfor (int i = 1; i <= N; i++) V1[i] += V1[i - 1];\n\n\tfor (int i = 1; i <= N; i++) Answer2 += V1[i] * V2[i];\n\n\n\n\t// Step #4. Sorting\n\n\tvector> vec;\n\n\tfor (int i = 1; i <= M; i++) vec.push_back(make_pair(R[i], L[i]));\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// Step #5. Get Answer3\n\n\tlong long Answer3 = 0;\n\n\tBIT Z; Z.init(N + 2);\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tlong long cl = vec[i].second, cr = vec[i].first;\n\n\t\tlong long ret = Z.sum(cr) - Z.sum(cl);\n\n\t\tAnswer3 += ret;\n\n\t\tZ.add(cl, 1);\n\n\t}\n\n\n\n\t// Step #6. Output The Answer!\n\n\tlong long Total = M * (M - 1) / 2LL;\n\n\tlong long SumAns = Answer1 + Answer2 + Answer3;\n\n\tcout << Total - SumAns << endl;\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n S = [[] for _ in range(N)]\n T = [[] for _ in range(N)]\n E = []\n for i in range(M):\n s, t = map(lambda x: int(x) - 1, input().split())\n S[s].append(i)\n T[t].append(i)\n E.append((s, t))\n st = SegmentTree(N, f=lambda a, b: a + b)\n ans = 0\n for n in range(N):\n for i in T[n]:\n s, t = E[i]\n st.modify_at(s, -1)\n for i in T[n]:\n s, t = E[i]\n ans += st.query(s + 1, t)\n st.modify_at(n, len(S[n]))\n print(ans)\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def __repr__(self) -> str:\n n = self.__n\n return str([self.get_at(i) for i in range(n)])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n" }, { "id": 130, "name": "017", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass BIT {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector bit;\n\n\n\n\tvoid init(int sz) {\n\n\t\tsize_ = sz + 2;\n\n\t\tbit.resize(size_ + 2, 0);\n\n\t}\n\n\tvoid add(int pos, long long x) {\n\n\t\tpos++;\n\n\t\twhile (pos <= size_) {\n\n\t\t\tbit[pos] += x;\n\n\t\t\tpos += (pos & -pos);\n\n\t\t}\n\n\t}\n\n\tlong long sum(int pos) {\n\n\t\tlong long s = 0; pos++;\n\n\t\twhile (pos >= 1) {\n\n\t\t\ts += bit[pos];\n\n\t\t\tpos -= (pos & -pos);\n\n\t\t}\n\n\t\treturn s;\n\n\t}\n\n};\n\n\n\n// Input\n\nlong long N, M;\n\nlong long L[1 << 18], R[1 << 18];\n\n\n\n// Kazoeage\n\nlong long V1[1 << 18], V2[1 << 18], V3[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. Get Answer1\n\n\tlong long Answer1 = 0;\n\n\tfor (int i = 1; i <= M; i++) V3[L[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V3[R[i]] += 1;\n\n\tfor (int i = 1; i <= N; i++) Answer1 += V3[i] * (V3[i] - 1LL) / 2LL;\n\n\n\n\t// Step #3. Get Answer2\n\n\tlong long Answer2 = 0;\n\n\tfor (int i = 1; i <= M; i++) V1[R[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V2[L[i] - 1] += 1;\n\n\tfor (int i = 1; i <= N; i++) V1[i] += V1[i - 1];\n\n\tfor (int i = 1; i <= N; i++) Answer2 += V1[i] * V2[i];\n\n\n\n\t// Step #4. Sorting\n\n\tvector> vec;\n\n\tfor (int i = 1; i <= M; i++) vec.push_back(make_pair(R[i], L[i]));\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// Step #5. Get Answer3\n\n\tlong long Answer3 = 0;\n\n\tBIT Z; Z.init(N + 2);\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tlong long cl = vec[i].second, cr = vec[i].first;\n\n\t\tlong long ret = Z.sum(cr) - Z.sum(cl);\n\n\t\tAnswer3 += ret;\n\n\t\tZ.add(cl, 1);\n\n\t}\n\n\n\n\t// Step #6. Output The Answer!\n\n\tlong long Total = M * (M - 1) / 2LL;\n\n\tlong long SumAns = Answer1 + Answer2 + Answer3;\n\n\tcout << Total - SumAns << endl;\n\n\treturn 0;\n\n}", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * @n\n end\n\n def inc(i)\n m = 1\n while m <= @n\n @data[i] += 1 if (i & m) == 0\n i |= m; m <<= 1\n end\n end\n\n def sum(i)\n i += 1\n m = 1\n acc = 0\n while i > 0\n acc += @data[i - 1] if (i & m) != 0\n i &= ~m; m <<= 1\n end\n acc\n end\nend\n\ndef main\n n, m = readline.split.map(&:to_i)\n\n graph = Array.new(n) { [] }\n m.times do\n a, b = readline.split.map(&:to_i)\n graph[a - 1].push(b - 1)\n end\n os = OnlineSum.new(n)\n ans = 0\n for u in 0...n\n graph[u].sort!.reverse!\n for v in graph[u]\n ans += os.sum(v - 1) - os.sum(u)\n os.inc(v)\n end\n end\n puts ans\nend\n\nmain if __FILE__ == $0\n" }, { "id": 131, "name": "017", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass BIT {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector bit;\n\n\n\n\tvoid init(int sz) {\n\n\t\tsize_ = sz + 2;\n\n\t\tbit.resize(size_ + 2, 0);\n\n\t}\n\n\tvoid add(int pos, long long x) {\n\n\t\tpos++;\n\n\t\twhile (pos <= size_) {\n\n\t\t\tbit[pos] += x;\n\n\t\t\tpos += (pos & -pos);\n\n\t\t}\n\n\t}\n\n\tlong long sum(int pos) {\n\n\t\tlong long s = 0; pos++;\n\n\t\twhile (pos >= 1) {\n\n\t\t\ts += bit[pos];\n\n\t\t\tpos -= (pos & -pos);\n\n\t\t}\n\n\t\treturn s;\n\n\t}\n\n};\n\n\n\n// Input\n\nlong long N, M;\n\nlong long L[1 << 18], R[1 << 18];\n\n\n\n// Kazoeage\n\nlong long V1[1 << 18], V2[1 << 18], V3[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) cin >> L[i] >> R[i];\n\n\n\n\t// Step #2. Get Answer1\n\n\tlong long Answer1 = 0;\n\n\tfor (int i = 1; i <= M; i++) V3[L[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V3[R[i]] += 1;\n\n\tfor (int i = 1; i <= N; i++) Answer1 += V3[i] * (V3[i] - 1LL) / 2LL;\n\n\n\n\t// Step #3. Get Answer2\n\n\tlong long Answer2 = 0;\n\n\tfor (int i = 1; i <= M; i++) V1[R[i]] += 1;\n\n\tfor (int i = 1; i <= M; i++) V2[L[i] - 1] += 1;\n\n\tfor (int i = 1; i <= N; i++) V1[i] += V1[i - 1];\n\n\tfor (int i = 1; i <= N; i++) Answer2 += V1[i] * V2[i];\n\n\n\n\t// Step #4. Sorting\n\n\tvector> vec;\n\n\tfor (int i = 1; i <= M; i++) vec.push_back(make_pair(R[i], L[i]));\n\n\tsort(vec.begin(), vec.end());\n\n\n\n\t// Step #5. Get Answer3\n\n\tlong long Answer3 = 0;\n\n\tBIT Z; Z.init(N + 2);\n\n\tfor (int i = 0; i < vec.size(); i++) {\n\n\t\tlong long cl = vec[i].second, cr = vec[i].first;\n\n\t\tlong long ret = Z.sum(cr) - Z.sum(cl);\n\n\t\tAnswer3 += ret;\n\n\t\tZ.add(cl, 1);\n\n\t}\n\n\n\n\t// Step #6. Output The Answer!\n\n\tlong long Total = M * (M - 1) / 2LL;\n\n\tlong long SumAns = Answer1 + Answer2 + Answer3;\n\n\tcout << Total - SumAns << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar lr: []Lr :: #[m]Lr\n\tfor i(0, m - 1)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tdo lr[i] :: (#Lr).init(l, r)\n\tend for\n\tdo lr.sort()\n\t\n\tvar bitL: @Bit :: (#@Bit).init(n)\n\tvar bitR: @Bit :: (#@Bit).init(n)\n\tvar ans: int :: 0\n\tfor i(0, m - 1)\n\t\tvar l: int :: lr[i].l\n\t\tvar r: int :: lr[i].r\n\t\tif(l <> 0)\n\t\t\tdo ans :+ bitL.sum(l - 1)\n\t\t\tdo ans :- bitR.sum(l)\n\t\tend if\n\t\tdo bitL.add(l, 1)\n\t\tdo bitR.add(r, 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Lr()\n\t\t+var l: int\n\t\t+var r: int\n\t\t+func init(l: int, r: int): Lr\n\t\t\tdo me.l :: l\n\t\t\tdo me.r :: r\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.r < (t $ Lr).r)\n\t\t\t\tret - 1\n\t\t\telif(me.r > (t $ Lr).r)\n\t\t\t\tret 1\n\t\t\telif(me.l > (t $ Lr).l)\n\t\t\t\t; 今回の方法の場合、\n\t\t\t\t; rが等しいときは、lが大きい順にしないと、\n\t\t\t\t; 数え上げ時に重複しやすい。\n\t\t\t\tret - 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n\nclass Bit()\n\tvar n: int\n\tvar data: []int\n\t+func init(n: int): Bit\n\t\tdo me.n :: n\n\t\tdo me.data :: #[n + 1]int\n\t\tret me\n\tend func\n\t+func add(i: int, v: int)\n\t\tvar x: int :: i + 1\n\t\twhile(x <= me.n)\n\t\t\tdo me.data[x] :+ v\n\t\t\tdo x :+ (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\tend func\n\t+func sum(i: int): int\n\t\tvar x: int :: i + 1\n\t\tvar res: int :: 0\n\t\twhile(x > 0)\n\t\t\tdo res :+ me.data[x]\n\t\t\tdo x :- (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 132, "name": "017", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::fenwick_tree](https://atcoder.github.io/ac-library/master/document_en/fenwicktree.html).\n #\n # ```\n # tree = AtCoder::FenwickTree(Int64).new(10)\n # tree.add(3, 10)\n # tree.add(5, 20)\n # tree[3..5] # => 30\n # tree[3...5] # => 10\n # ```\n class FenwickTree(T)\n getter size : Int64\n getter bits : Array(T)\n\n def initialize(@size)\n @bits = Array(T).new(@size, T.zero)\n end\n\n # Implements atcoder::fenwick_tree.add(index, value)\n def add(index, value)\n index += 1 # convert to 1-indexed\n while index <= @size\n @bits[index - 1] += value\n index += index & -index\n end\n end\n\n # Exclusive left sum\n def left_sum(index)\n ret = T.zero\n while index >= 1\n ret += @bits[index - 1]\n index -= index & -index\n end\n ret\n end\n\n # Implements atcoder::fenwick_tree.sum(left, right)\n def sum(left, right)\n left_sum(right) - left_sum(left)\n end\n\n # :ditto:\n def [](range : Range(Int, Int))\n left = range.begin\n right = range.exclusive? ? range.end : range.end + 1\n sum(left, right)\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nlr = (1..m).map { {Int32, Int32}.from read_line.split.map(&.to_i.pred) }\n\ncnt = [0i64] * n\ncnt_r = [0i64] * n\nlr.each do |(l, r)|\n cnt[l] += 1\n cnt[r] += 1\n cnt_r[r] += 1\nend\nsum_r = cnt_r.reduce([0i64]) do |acc, x|\n acc << acc[-1] + x\nend\n\nans = m.to_i64 * m.pred // 2\nans -= cnt.sum { |x| x * x.pred // 2 }\nans -= lr.sum { |(l, r)| sum_r[l] }\n\nsum_l = AtCoder::FenwickTree(Int64).new(n.to_i64)\nlr.sort_by { |(l, r)| {r, l} }.each do |(l, r)|\n ans -= sum_l[l + 1...r]\n sum_l.add(l, 1i64)\nend\n\nputs ans\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n S = [[] for _ in range(N)]\n T = [[] for _ in range(N)]\n E = []\n for i in range(M):\n s, t = map(lambda x: int(x) - 1, input().split())\n S[s].append(i)\n T[t].append(i)\n E.append((s, t))\n st = SegmentTree(N, f=lambda a, b: a + b)\n ans = 0\n for n in range(N):\n for i in T[n]:\n s, t = E[i]\n st.modify_at(s, -1)\n for i in T[n]:\n s, t = E[i]\n ans += st.query(s + 1, t)\n st.modify_at(n, len(S[n]))\n print(ans)\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def __repr__(self) -> str:\n n = self.__n\n return str([self.get_at(i) for i in range(n)])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n" }, { "id": 133, "name": "017", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::fenwick_tree](https://atcoder.github.io/ac-library/master/document_en/fenwicktree.html).\n #\n # ```\n # tree = AtCoder::FenwickTree(Int64).new(10)\n # tree.add(3, 10)\n # tree.add(5, 20)\n # tree[3..5] # => 30\n # tree[3...5] # => 10\n # ```\n class FenwickTree(T)\n getter size : Int64\n getter bits : Array(T)\n\n def initialize(@size)\n @bits = Array(T).new(@size, T.zero)\n end\n\n # Implements atcoder::fenwick_tree.add(index, value)\n def add(index, value)\n index += 1 # convert to 1-indexed\n while index <= @size\n @bits[index - 1] += value\n index += index & -index\n end\n end\n\n # Exclusive left sum\n def left_sum(index)\n ret = T.zero\n while index >= 1\n ret += @bits[index - 1]\n index -= index & -index\n end\n ret\n end\n\n # Implements atcoder::fenwick_tree.sum(left, right)\n def sum(left, right)\n left_sum(right) - left_sum(left)\n end\n\n # :ditto:\n def [](range : Range(Int, Int))\n left = range.begin\n right = range.exclusive? ? range.end : range.end + 1\n sum(left, right)\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nlr = (1..m).map { {Int32, Int32}.from read_line.split.map(&.to_i.pred) }\n\ncnt = [0i64] * n\ncnt_r = [0i64] * n\nlr.each do |(l, r)|\n cnt[l] += 1\n cnt[r] += 1\n cnt_r[r] += 1\nend\nsum_r = cnt_r.reduce([0i64]) do |acc, x|\n acc << acc[-1] + x\nend\n\nans = m.to_i64 * m.pred // 2\nans -= cnt.sum { |x| x * x.pred // 2 }\nans -= lr.sum { |(l, r)| sum_r[l] }\n\nsum_l = AtCoder::FenwickTree(Int64).new(n.to_i64)\nlr.sort_by { |(l, r)| {r, l} }.each do |(l, r)|\n ans -= sum_l[l + 1...r]\n sum_l.add(l, 1i64)\nend\n\nputs ans\n", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * @n\n end\n\n def inc(i)\n m = 1\n while m <= @n\n @data[i] += 1 if (i & m) == 0\n i |= m; m <<= 1\n end\n end\n\n def sum(i)\n i += 1\n m = 1\n acc = 0\n while i > 0\n acc += @data[i - 1] if (i & m) != 0\n i &= ~m; m <<= 1\n end\n acc\n end\nend\n\ndef main\n n, m = readline.split.map(&:to_i)\n\n graph = Array.new(n) { [] }\n m.times do\n a, b = readline.split.map(&:to_i)\n graph[a - 1].push(b - 1)\n end\n os = OnlineSum.new(n)\n ans = 0\n for u in 0...n\n graph[u].sort!.reverse!\n for v in graph[u]\n ans += os.sum(v - 1) - os.sum(u)\n os.inc(v)\n end\n end\n puts ans\nend\n\nmain if __FILE__ == $0\n" }, { "id": 134, "name": "017", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::fenwick_tree](https://atcoder.github.io/ac-library/master/document_en/fenwicktree.html).\n #\n # ```\n # tree = AtCoder::FenwickTree(Int64).new(10)\n # tree.add(3, 10)\n # tree.add(5, 20)\n # tree[3..5] # => 30\n # tree[3...5] # => 10\n # ```\n class FenwickTree(T)\n getter size : Int64\n getter bits : Array(T)\n\n def initialize(@size)\n @bits = Array(T).new(@size, T.zero)\n end\n\n # Implements atcoder::fenwick_tree.add(index, value)\n def add(index, value)\n index += 1 # convert to 1-indexed\n while index <= @size\n @bits[index - 1] += value\n index += index & -index\n end\n end\n\n # Exclusive left sum\n def left_sum(index)\n ret = T.zero\n while index >= 1\n ret += @bits[index - 1]\n index -= index & -index\n end\n ret\n end\n\n # Implements atcoder::fenwick_tree.sum(left, right)\n def sum(left, right)\n left_sum(right) - left_sum(left)\n end\n\n # :ditto:\n def [](range : Range(Int, Int))\n left = range.begin\n right = range.exclusive? ? range.end : range.end + 1\n sum(left, right)\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nlr = (1..m).map { {Int32, Int32}.from read_line.split.map(&.to_i.pred) }\n\ncnt = [0i64] * n\ncnt_r = [0i64] * n\nlr.each do |(l, r)|\n cnt[l] += 1\n cnt[r] += 1\n cnt_r[r] += 1\nend\nsum_r = cnt_r.reduce([0i64]) do |acc, x|\n acc << acc[-1] + x\nend\n\nans = m.to_i64 * m.pred // 2\nans -= cnt.sum { |x| x * x.pred // 2 }\nans -= lr.sum { |(l, r)| sum_r[l] }\n\nsum_l = AtCoder::FenwickTree(Int64).new(n.to_i64)\nlr.sort_by { |(l, r)| {r, l} }.each do |(l, r)|\n ans -= sum_l[l + 1...r]\n sum_l.add(l, 1i64)\nend\n\nputs ans\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar lr: []Lr :: #[m]Lr\n\tfor i(0, m - 1)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tdo lr[i] :: (#Lr).init(l, r)\n\tend for\n\tdo lr.sort()\n\t\n\tvar bitL: @Bit :: (#@Bit).init(n)\n\tvar bitR: @Bit :: (#@Bit).init(n)\n\tvar ans: int :: 0\n\tfor i(0, m - 1)\n\t\tvar l: int :: lr[i].l\n\t\tvar r: int :: lr[i].r\n\t\tif(l <> 0)\n\t\t\tdo ans :+ bitL.sum(l - 1)\n\t\t\tdo ans :- bitR.sum(l)\n\t\tend if\n\t\tdo bitL.add(l, 1)\n\t\tdo bitR.add(r, 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Lr()\n\t\t+var l: int\n\t\t+var r: int\n\t\t+func init(l: int, r: int): Lr\n\t\t\tdo me.l :: l\n\t\t\tdo me.r :: r\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.r < (t $ Lr).r)\n\t\t\t\tret - 1\n\t\t\telif(me.r > (t $ Lr).r)\n\t\t\t\tret 1\n\t\t\telif(me.l > (t $ Lr).l)\n\t\t\t\t; 今回の方法の場合、\n\t\t\t\t; rが等しいときは、lが大きい順にしないと、\n\t\t\t\t; 数え上げ時に重複しやすい。\n\t\t\t\tret - 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n\nclass Bit()\n\tvar n: int\n\tvar data: []int\n\t+func init(n: int): Bit\n\t\tdo me.n :: n\n\t\tdo me.data :: #[n + 1]int\n\t\tret me\n\tend func\n\t+func add(i: int, v: int)\n\t\tvar x: int :: i + 1\n\t\twhile(x <= me.n)\n\t\t\tdo me.data[x] :+ v\n\t\t\tdo x :+ (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\tend func\n\t+func sum(i: int): int\n\t\tvar x: int :: i + 1\n\t\tvar res: int :: 0\n\t\twhile(x > 0)\n\t\t\tdo res :+ me.data[x]\n\t\t\tdo x :- (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 135, "name": "017", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n S = [[] for _ in range(N)]\n T = [[] for _ in range(N)]\n E = []\n for i in range(M):\n s, t = map(lambda x: int(x) - 1, input().split())\n S[s].append(i)\n T[t].append(i)\n E.append((s, t))\n st = SegmentTree(N, f=lambda a, b: a + b)\n ans = 0\n for n in range(N):\n for i in T[n]:\n s, t = E[i]\n st.modify_at(s, -1)\n for i in T[n]:\n s, t = E[i]\n ans += st.query(s + 1, t)\n st.modify_at(n, len(S[n]))\n print(ans)\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def __repr__(self) -> str:\n n = self.__n\n return str([self.get_at(i) for i in range(n)])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * @n\n end\n\n def inc(i)\n m = 1\n while m <= @n\n @data[i] += 1 if (i & m) == 0\n i |= m; m <<= 1\n end\n end\n\n def sum(i)\n i += 1\n m = 1\n acc = 0\n while i > 0\n acc += @data[i - 1] if (i & m) != 0\n i &= ~m; m <<= 1\n end\n acc\n end\nend\n\ndef main\n n, m = readline.split.map(&:to_i)\n\n graph = Array.new(n) { [] }\n m.times do\n a, b = readline.split.map(&:to_i)\n graph[a - 1].push(b - 1)\n end\n os = OnlineSum.new(n)\n ans = 0\n for u in 0...n\n graph[u].sort!.reverse!\n for v in graph[u]\n ans += os.sum(v - 1) - os.sum(u)\n os.inc(v)\n end\n end\n puts ans\nend\n\nmain if __FILE__ == $0\n" }, { "id": 136, "name": "017", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nimport sys\ndef main():\n input = sys.stdin.readline\n N, M = map(int, input().split())\n S = [[] for _ in range(N)]\n T = [[] for _ in range(N)]\n E = []\n for i in range(M):\n s, t = map(lambda x: int(x) - 1, input().split())\n S[s].append(i)\n T[t].append(i)\n E.append((s, t))\n st = SegmentTree(N, f=lambda a, b: a + b)\n ans = 0\n for n in range(N):\n for i in T[n]:\n s, t = E[i]\n st.modify_at(s, -1)\n for i in T[n]:\n s, t = E[i]\n ans += st.query(s + 1, t)\n st.modify_at(n, len(S[n]))\n print(ans)\n\nclass SegmentTree:\n __slots__ = ('__n', '__d', '__f', '__e')\n\n def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):\n assert(n or initial_values)\n size = n if n else len(initial_values)\n d = [identity_factory() for _ in range(2 * size + 1)]\n self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory\n if initial_values:\n for i, v in enumerate(initial_values): d[size + i] = v\n for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])\n\n def __repr__(self) -> str:\n n = self.__n\n return str([self.get_at(i) for i in range(n)])\n\n def get_at(self, index):\n return self.__d[index + self.__n]\n\n def set_at(self, index, new_value):\n i, d, f = index + self.__n, self.__d, self.__f\n if d[i] == new_value: return\n d[i], i = new_value, i >> 1\n while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1\n\n def modify_at(self, index, value):\n self.set_at(index, self.__f(self.__d[index + self.__n], value))\n\n def query(self, from_inclusive, to_exclusive):\n ans = self.__e()\n if to_exclusive <= from_inclusive: return ans\n l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f\n while l < r:\n if l & 1: ans, l = f(ans, d[l]), l + 1\n if r & 1: ans, r = f(d[r - 1], ans), r - 1\n l, r = l >> 1, r >> 1\n return ans\n\n def query_all(self):\n return self.__d[1]\n\n def bisect_left(self, func, from_inclusive=None, to_exclusive=None):\n '''func()がTrueになるもっとも左のindexを探す\n '''\n n, f, d, v = self.__n, self.__f, self.__d, self.__e()\n l = (from_inclusive if from_inclusive else 0) + n\n r = (to_exclusive if to_exclusive else n) + n\n h = 0\n while l < r:\n if l & 1:\n nv = f(v, d[l])\n if func(nv): return self.__single_bisect_left(func, l, v)\n v, l = nv, l + 1\n l, r, h = l >> 1, r >> 1, h + 1\n if r == 0: return n\n for i in range(h, 0, -1):\n if ((r + 1) << i <= n + n):\n nv = f(v, d[r])\n if func(nv): return self.__single_bisect_left(func, r, v)\n v, r = nv, r + 1\n r <<= 1\n return n\n\n def __single_bisect_left(self, func, root, left_val):\n n, f, d = self.__n, self.__f, self.__d\n i, v = root, left_val\n while i < n:\n i <<= 1\n nv = f(v, d[i])\n if not func(nv): i, v = i + 1, nv\n return i - n\n\nif __name__ == '__main__':\n main()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar lr: []Lr :: #[m]Lr\n\tfor i(0, m - 1)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tdo lr[i] :: (#Lr).init(l, r)\n\tend for\n\tdo lr.sort()\n\t\n\tvar bitL: @Bit :: (#@Bit).init(n)\n\tvar bitR: @Bit :: (#@Bit).init(n)\n\tvar ans: int :: 0\n\tfor i(0, m - 1)\n\t\tvar l: int :: lr[i].l\n\t\tvar r: int :: lr[i].r\n\t\tif(l <> 0)\n\t\t\tdo ans :+ bitL.sum(l - 1)\n\t\t\tdo ans :- bitR.sum(l)\n\t\tend if\n\t\tdo bitL.add(l, 1)\n\t\tdo bitR.add(r, 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Lr()\n\t\t+var l: int\n\t\t+var r: int\n\t\t+func init(l: int, r: int): Lr\n\t\t\tdo me.l :: l\n\t\t\tdo me.r :: r\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.r < (t $ Lr).r)\n\t\t\t\tret - 1\n\t\t\telif(me.r > (t $ Lr).r)\n\t\t\t\tret 1\n\t\t\telif(me.l > (t $ Lr).l)\n\t\t\t\t; 今回の方法の場合、\n\t\t\t\t; rが等しいときは、lが大きい順にしないと、\n\t\t\t\t; 数え上げ時に重複しやすい。\n\t\t\t\tret - 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n\nclass Bit()\n\tvar n: int\n\tvar data: []int\n\t+func init(n: int): Bit\n\t\tdo me.n :: n\n\t\tdo me.data :: #[n + 1]int\n\t\tret me\n\tend func\n\t+func add(i: int, v: int)\n\t\tvar x: int :: i + 1\n\t\twhile(x <= me.n)\n\t\t\tdo me.data[x] :+ v\n\t\t\tdo x :+ (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\tend func\n\t+func sum(i: int): int\n\t\tvar x: int :: i + 1\n\t\tvar res: int :: 0\n\t\twhile(x > 0)\n\t\t\tdo res :+ me.data[x]\n\t\t\tdo x :- (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 137, "name": "017", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * @n\n end\n\n def inc(i)\n m = 1\n while m <= @n\n @data[i] += 1 if (i & m) == 0\n i |= m; m <<= 1\n end\n end\n\n def sum(i)\n i += 1\n m = 1\n acc = 0\n while i > 0\n acc += @data[i - 1] if (i & m) != 0\n i &= ~m; m <<= 1\n end\n acc\n end\nend\n\ndef main\n n, m = readline.split.map(&:to_i)\n\n graph = Array.new(n) { [] }\n m.times do\n a, b = readline.split.map(&:to_i)\n graph[a - 1].push(b - 1)\n end\n os = OnlineSum.new(n)\n ans = 0\n for u in 0...n\n graph[u].sort!.reverse!\n for v in graph[u]\n ans += os.sum(v - 1) - os.sum(u)\n os.inc(v)\n end\n end\n puts ans\nend\n\nmain if __FILE__ == $0\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar lr: []Lr :: #[m]Lr\n\tfor i(0, m - 1)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tdo lr[i] :: (#Lr).init(l, r)\n\tend for\n\tdo lr.sort()\n\t\n\tvar bitL: @Bit :: (#@Bit).init(n)\n\tvar bitR: @Bit :: (#@Bit).init(n)\n\tvar ans: int :: 0\n\tfor i(0, m - 1)\n\t\tvar l: int :: lr[i].l\n\t\tvar r: int :: lr[i].r\n\t\tif(l <> 0)\n\t\t\tdo ans :+ bitL.sum(l - 1)\n\t\t\tdo ans :- bitR.sum(l)\n\t\tend if\n\t\tdo bitL.add(l, 1)\n\t\tdo bitR.add(r, 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tclass Lr()\n\t\t+var l: int\n\t\t+var r: int\n\t\t+func init(l: int, r: int): Lr\n\t\t\tdo me.l :: l\n\t\t\tdo me.r :: r\n\t\t\tret me\n\t\tend func\n\t\t+*func cmp(t: kuin@Class): int\n\t\t\tif(me.r < (t $ Lr).r)\n\t\t\t\tret - 1\n\t\t\telif(me.r > (t $ Lr).r)\n\t\t\t\tret 1\n\t\t\telif(me.l > (t $ Lr).l)\n\t\t\t\t; 今回の方法の場合、\n\t\t\t\t; rが等しいときは、lが大きい順にしないと、\n\t\t\t\t; 数え上げ時に重複しやすい。\n\t\t\t\tret - 1\n\t\t\tend if\n\t\t\tret 0\n\t\tend func\n\tend class\nend func\n\nclass Bit()\n\tvar n: int\n\tvar data: []int\n\t+func init(n: int): Bit\n\t\tdo me.n :: n\n\t\tdo me.data :: #[n + 1]int\n\t\tret me\n\tend func\n\t+func add(i: int, v: int)\n\t\tvar x: int :: i + 1\n\t\twhile(x <= me.n)\n\t\t\tdo me.data[x] :+ v\n\t\t\tdo x :+ (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\tend func\n\t+func sum(i: int): int\n\t\tvar x: int :: i + 1\n\t\tvar res: int :: 0\n\t\twhile(x > 0)\n\t\t\tdo res :+ me.data[x]\n\t\t\tdo x :- (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 138, "name": "018", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint Q;\n\nlong double T, L, X, Y, E;\n\nlong double PI = 3.14159265358979;\n\n\n\nlong double query(long double I) {\n\n\tlong double cx = 0;\n\n\tlong double cy = -(L / 2.0) * sin(I / T * 2.0 * PI);\n\n\tlong double cz = (L / 2.0) - (L / 2.0) * cos(I / T * 2.0 * PI);\n\n\tlong double d1 = sqrt((cx - X) * (cx - X) + (cy - Y) * (cy - Y));\n\n\tlong double d2 = cz;\n\n\tlong double kaku = atan2(d2, d1);\n\n\treturn kaku * 180.0L / PI;\n\n}\n\n\n\nint main() {\n\n\tcin >> T;\n\n\tcin >> L >> X >> Y;\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tcin >> E;\n\n\t\tprintf(\"%.12Lf\\n\", query(E));\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "TAU = Math::PI * 2\nt = read_line.to_i\nl, tx, ty = read_line.split.map(&.to_i)\nread_line.to_i.times do\n e = read_line.to_i\n angle = TAU / t * e\n y = -Math.sin(angle) * l / 2\n height = l / 2 - Math.cos(angle) * l / 2\n dist = Math.hypot(tx, ty - y)\n puts Math.atan(height / dist) * 360 / TAU\nend\n" }, { "id": 139, "name": "018", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint Q;\n\nlong double T, L, X, Y, E;\n\nlong double PI = 3.14159265358979;\n\n\n\nlong double query(long double I) {\n\n\tlong double cx = 0;\n\n\tlong double cy = -(L / 2.0) * sin(I / T * 2.0 * PI);\n\n\tlong double cz = (L / 2.0) - (L / 2.0) * cos(I / T * 2.0 * PI);\n\n\tlong double d1 = sqrt((cx - X) * (cx - X) + (cy - Y) * (cy - Y));\n\n\tlong double d2 = cz;\n\n\tlong double kaku = atan2(d2, d1);\n\n\treturn kaku * 180.0L / PI;\n\n}\n\n\n\nint main() {\n\n\tcin >> T;\n\n\tcin >> L >> X >> Y;\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tcin >> E;\n\n\t\tprintf(\"%.12Lf\\n\", query(E));\n\n\t}\n\n\treturn 0;\n\n}", "Python": "import numpy as np\n\nt = int(input())\nl, x, y = map(int, input().split())\nq = int(input())\nfor i in range(q):\n e = int(input())\n if(e % t == 0):\n print(0)\n continue\n rad = 3/2*np.pi - e/t*2*np.pi\n pos = np.array([0, l/2*np.cos(rad), l/2+l/2*np.sin(rad)])\n takahashi = np.array([x, y, 0])\n ground = pos.copy()\n ground[2] = 0\n vector1 = pos - takahashi\n vector2 = ground - takahashi\n inner = np.dot(vector1, vector2)\n inner /= np.linalg.norm(vector1)\n inner /= np.linalg.norm(vector2)\n theta = np.arccos(inner)\n print(theta*360/(2*np.pi))\n" }, { "id": 140, "name": "018", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint Q;\n\nlong double T, L, X, Y, E;\n\nlong double PI = 3.14159265358979;\n\n\n\nlong double query(long double I) {\n\n\tlong double cx = 0;\n\n\tlong double cy = -(L / 2.0) * sin(I / T * 2.0 * PI);\n\n\tlong double cz = (L / 2.0) - (L / 2.0) * cos(I / T * 2.0 * PI);\n\n\tlong double d1 = sqrt((cx - X) * (cx - X) + (cy - Y) * (cy - Y));\n\n\tlong double d2 = cz;\n\n\tlong double kaku = atan2(d2, d1);\n\n\treturn kaku * 180.0L / PI;\n\n}\n\n\n\nint main() {\n\n\tcin >> T;\n\n\tcin >> L >> X >> Y;\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tcin >> E;\n\n\t\tprintf(\"%.12Lf\\n\", query(E));\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar t: float :: cui@inputFloat()\n\tvar l: float :: cui@inputFloat()\n\tvar x: float :: cui@inputFloat()\n\tvar y: float :: cui@inputFloat()\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar e: float :: cui@inputFloat()\n\t\tvar posY: float :: -l / 2.0 * lib@sin(2.0 * lib@pi * e / t)\n\t\tvar posZ: float :: l / 2.0 * (1.0 - lib@cos(2.0 * lib@pi * e / t))\n\t\tvar ans: float :: lib@toDegree(lib@atan(posZ / (x ^ 2.0 + (posY - y) ^ 2.0) ^ 0.5))\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 141, "name": "018", "Crystal": "TAU = Math::PI * 2\nt = read_line.to_i\nl, tx, ty = read_line.split.map(&.to_i)\nread_line.to_i.times do\n e = read_line.to_i\n angle = TAU / t * e\n y = -Math.sin(angle) * l / 2\n height = l / 2 - Math.cos(angle) * l / 2\n dist = Math.hypot(tx, ty - y)\n puts Math.atan(height / dist) * 360 / TAU\nend\n", "Python": "import numpy as np\n\nt = int(input())\nl, x, y = map(int, input().split())\nq = int(input())\nfor i in range(q):\n e = int(input())\n if(e % t == 0):\n print(0)\n continue\n rad = 3/2*np.pi - e/t*2*np.pi\n pos = np.array([0, l/2*np.cos(rad), l/2+l/2*np.sin(rad)])\n takahashi = np.array([x, y, 0])\n ground = pos.copy()\n ground[2] = 0\n vector1 = pos - takahashi\n vector2 = ground - takahashi\n inner = np.dot(vector1, vector2)\n inner /= np.linalg.norm(vector1)\n inner /= np.linalg.norm(vector2)\n theta = np.arccos(inner)\n print(theta*360/(2*np.pi))\n" }, { "id": 142, "name": "018", "Crystal": "TAU = Math::PI * 2\nt = read_line.to_i\nl, tx, ty = read_line.split.map(&.to_i)\nread_line.to_i.times do\n e = read_line.to_i\n angle = TAU / t * e\n y = -Math.sin(angle) * l / 2\n height = l / 2 - Math.cos(angle) * l / 2\n dist = Math.hypot(tx, ty - y)\n puts Math.atan(height / dist) * 360 / TAU\nend\n", "Kuin": "func main()\n\tvar t: float :: cui@inputFloat()\n\tvar l: float :: cui@inputFloat()\n\tvar x: float :: cui@inputFloat()\n\tvar y: float :: cui@inputFloat()\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar e: float :: cui@inputFloat()\n\t\tvar posY: float :: -l / 2.0 * lib@sin(2.0 * lib@pi * e / t)\n\t\tvar posZ: float :: l / 2.0 * (1.0 - lib@cos(2.0 * lib@pi * e / t))\n\t\tvar ans: float :: lib@toDegree(lib@atan(posZ / (x ^ 2.0 + (posY - y) ^ 2.0) ^ 0.5))\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 143, "name": "018", "Python": "import numpy as np\n\nt = int(input())\nl, x, y = map(int, input().split())\nq = int(input())\nfor i in range(q):\n e = int(input())\n if(e % t == 0):\n print(0)\n continue\n rad = 3/2*np.pi - e/t*2*np.pi\n pos = np.array([0, l/2*np.cos(rad), l/2+l/2*np.sin(rad)])\n takahashi = np.array([x, y, 0])\n ground = pos.copy()\n ground[2] = 0\n vector1 = pos - takahashi\n vector2 = ground - takahashi\n inner = np.dot(vector1, vector2)\n inner /= np.linalg.norm(vector1)\n inner /= np.linalg.norm(vector2)\n theta = np.arccos(inner)\n print(theta*360/(2*np.pi))\n", "Kuin": "func main()\n\tvar t: float :: cui@inputFloat()\n\tvar l: float :: cui@inputFloat()\n\tvar x: float :: cui@inputFloat()\n\tvar y: float :: cui@inputFloat()\n\t\n\tvar q: int :: cui@inputInt()\n\tfor(1, q)\n\t\tvar e: float :: cui@inputFloat()\n\t\tvar posY: float :: -l / 2.0 * lib@sin(2.0 * lib@pi * e / t)\n\t\tvar posZ: float :: l / 2.0 * (1.0 - lib@cos(2.0 * lib@pi * e / t))\n\t\tvar ans: float :: lib@toDegree(lib@atan(posZ / (x ^ 2.0 + (posY - y) ^ 2.0) ^ 0.5))\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 144, "name": "019", "Crystal": "def rec(a, memo, l, r) : Int32\n memo[l][r] ||= l == r ? 0 : {\n (l + 2).step(to: r - 2, by: 2).min_of? { |mid|\n rec(a, memo, l, mid) + rec(a, memo, mid, r)\n } || 10**9,\n rec(a, memo, l + 1, r - 1) + (a[l] - a[r - 1]).abs,\n }.min\nend\n\nn = read_line.to_i\na = read_line.split.map(&.to_i)\nmemo = Array.new(2 * n) { Array(Int32?).new(2 * n + 1, nil) }\nputs rec(a, memo, 0, 2 * n)\n", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nint A[1 << 18];\n\nint dp[409][409];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= 2 * N; i++) cin >> A[i];\n\n\n\n\t// Step #2. Initialize\n\n\tfor (int i = 1; i <= 2 * N; i++) {\n\n\t\tfor (int j = i; j <= 2 * N; j++) dp[i][j] = (1 << 29);\n\n\t\tif (i < 2 * N) dp[i][i + 1] = abs(A[i] - A[i + 1]);\n\n\t}\n\n\n\n\t// Step #3. DP\n\n\tfor (int i = 3; i <= 2 * N; i += 2) {\n\n\t\tfor (int j = 1; j <= 2 * N - i; j++) {\n\n\t\t\tint cl = j, cr = j + i;\n\n\t\t\tfor (int k = cl; k <= cr - 1; k++) dp[cl][cr] = min(dp[cl][cr], dp[cl][k] + dp[k + 1][cr]);\n\n\t\t\tdp[cl][cr] = min(dp[cl][cr], dp[cl + 1][cr - 1] + abs(A[cl] - A[cr]));\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output\n\n\tcout << dp[1][2 * N] << endl;\n\n\treturn 0;\n\n}" }, { "id": 145, "name": "019", "Crystal": "def rec(a, memo, l, r) : Int32\n memo[l][r] ||= l == r ? 0 : {\n (l + 2).step(to: r - 2, by: 2).min_of? { |mid|\n rec(a, memo, l, mid) + rec(a, memo, mid, r)\n } || 10**9,\n rec(a, memo, l + 1, r - 1) + (a[l] - a[r - 1]).abs,\n }.min\nend\n\nn = read_line.to_i\na = read_line.split.map(&.to_i)\nmemo = Array.new(2 * n) { Array(Int32?).new(2 * n + 1, nil) }\nputs rec(a, memo, 0, 2 * n)\n", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom functools import lru_cache\ndef main(N, A):\n @lru_cache(None)\n def f(l, r):\n if r <= l: return 0\n res = abs(A[l] - A[r]) + f(l + 1, r - 1)\n for i in range(l + 1, r + 1, 2):\n res = min(res, abs(A[l] - A[i]) + f(l + 1, i - 1) + f(i + 1, r))\n return res\n\n print(f(0, 2 * N - 1))\n\nif __name__ == '__main__':\n N = int(input())\n *A, = map(int, input().split())\n main(N, A)\n" }, { "id": 146, "name": "019", "Crystal": "def rec(a, memo, l, r) : Int32\n memo[l][r] ||= l == r ? 0 : {\n (l + 2).step(to: r - 2, by: 2).min_of? { |mid|\n rec(a, memo, l, mid) + rec(a, memo, mid, r)\n } || 10**9,\n rec(a, memo, l + 1, r - 1) + (a[l] - a[r - 1]).abs,\n }.min\nend\n\nn = read_line.to_i\na = read_line.split.map(&.to_i)\nmemo = Array.new(2 * n) { Array(Int32?).new(2 * n + 1, nil) }\nputs rec(a, memo, 0, 2 * n)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[2 * n]int\n\tfor i(0, 2 * n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\t; 区間DP\n\t; dp[l][r] = l以上r以下の区間の取り除きコストの最小値\n\tvar dp: [][]int :: #[2 * n, 2 * n]int\n\tfor l(0, 2 * n - 1)\n\t\tfor r(0, 2 * n - 1)\n\t\t\tdo dp[l][r] :: 10 ^ 9\n\t\tend for\n\tend for\n\t\n\tfor w(2, 2 * n, 2)\n\t\tfor l(0, 2 * n - w)\n\t\t\tvar r: int :: l + w - 1\n\t\t\tif(w = 2)\n\t\t\t\tdo dp[l][r] :: (a[l] - a[r]).abs()\n\t\t\telse\n\t\t\t\tfor k(l + 1, r - 2)\n\t\t\t\t\tdo dp[l][r] :: [dp[l][r], dp[l][k] + dp[k + 1][r]].min()\n\t\t\t\tend for\n\t\t\t\tdo dp[l][r] :: [dp[l][r], dp[l + 1][r - 1] + (a[l] - a[r]).abs()].min()\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[0][2 * n - 1]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 147, "name": "019", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nint A[1 << 18];\n\nint dp[409][409];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= 2 * N; i++) cin >> A[i];\n\n\n\n\t// Step #2. Initialize\n\n\tfor (int i = 1; i <= 2 * N; i++) {\n\n\t\tfor (int j = i; j <= 2 * N; j++) dp[i][j] = (1 << 29);\n\n\t\tif (i < 2 * N) dp[i][i + 1] = abs(A[i] - A[i + 1]);\n\n\t}\n\n\n\n\t// Step #3. DP\n\n\tfor (int i = 3; i <= 2 * N; i += 2) {\n\n\t\tfor (int j = 1; j <= 2 * N - i; j++) {\n\n\t\t\tint cl = j, cr = j + i;\n\n\t\t\tfor (int k = cl; k <= cr - 1; k++) dp[cl][cr] = min(dp[cl][cr], dp[cl][k] + dp[k + 1][cr]);\n\n\t\t\tdp[cl][cr] = min(dp[cl][cr], dp[cl + 1][cr - 1] + abs(A[cl] - A[cr]));\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output\n\n\tcout << dp[1][2 * N] << endl;\n\n\treturn 0;\n\n}", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom functools import lru_cache\ndef main(N, A):\n @lru_cache(None)\n def f(l, r):\n if r <= l: return 0\n res = abs(A[l] - A[r]) + f(l + 1, r - 1)\n for i in range(l + 1, r + 1, 2):\n res = min(res, abs(A[l] - A[i]) + f(l + 1, i - 1) + f(i + 1, r))\n return res\n\n print(f(0, 2 * N - 1))\n\nif __name__ == '__main__':\n N = int(input())\n *A, = map(int, input().split())\n main(N, A)\n" }, { "id": 148, "name": "019", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nint A[1 << 18];\n\nint dp[409][409];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= 2 * N; i++) cin >> A[i];\n\n\n\n\t// Step #2. Initialize\n\n\tfor (int i = 1; i <= 2 * N; i++) {\n\n\t\tfor (int j = i; j <= 2 * N; j++) dp[i][j] = (1 << 29);\n\n\t\tif (i < 2 * N) dp[i][i + 1] = abs(A[i] - A[i + 1]);\n\n\t}\n\n\n\n\t// Step #3. DP\n\n\tfor (int i = 3; i <= 2 * N; i += 2) {\n\n\t\tfor (int j = 1; j <= 2 * N - i; j++) {\n\n\t\t\tint cl = j, cr = j + i;\n\n\t\t\tfor (int k = cl; k <= cr - 1; k++) dp[cl][cr] = min(dp[cl][cr], dp[cl][k] + dp[k + 1][cr]);\n\n\t\t\tdp[cl][cr] = min(dp[cl][cr], dp[cl + 1][cr - 1] + abs(A[cl] - A[cr]));\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output\n\n\tcout << dp[1][2 * N] << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[2 * n]int\n\tfor i(0, 2 * n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\t; 区間DP\n\t; dp[l][r] = l以上r以下の区間の取り除きコストの最小値\n\tvar dp: [][]int :: #[2 * n, 2 * n]int\n\tfor l(0, 2 * n - 1)\n\t\tfor r(0, 2 * n - 1)\n\t\t\tdo dp[l][r] :: 10 ^ 9\n\t\tend for\n\tend for\n\t\n\tfor w(2, 2 * n, 2)\n\t\tfor l(0, 2 * n - w)\n\t\t\tvar r: int :: l + w - 1\n\t\t\tif(w = 2)\n\t\t\t\tdo dp[l][r] :: (a[l] - a[r]).abs()\n\t\t\telse\n\t\t\t\tfor k(l + 1, r - 2)\n\t\t\t\t\tdo dp[l][r] :: [dp[l][r], dp[l][k] + dp[k + 1][r]].min()\n\t\t\t\tend for\n\t\t\t\tdo dp[l][r] :: [dp[l][r], dp[l + 1][r - 1] + (a[l] - a[r]).abs()].min()\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[0][2 * n - 1]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 149, "name": "019", "Python": "# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)\nfrom functools import lru_cache\ndef main(N, A):\n @lru_cache(None)\n def f(l, r):\n if r <= l: return 0\n res = abs(A[l] - A[r]) + f(l + 1, r - 1)\n for i in range(l + 1, r + 1, 2):\n res = min(res, abs(A[l] - A[i]) + f(l + 1, i - 1) + f(i + 1, r))\n return res\n\n print(f(0, 2 * N - 1))\n\nif __name__ == '__main__':\n N = int(input())\n *A, = map(int, input().split())\n main(N, A)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[2 * n]int\n\tfor i(0, 2 * n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\t; 区間DP\n\t; dp[l][r] = l以上r以下の区間の取り除きコストの最小値\n\tvar dp: [][]int :: #[2 * n, 2 * n]int\n\tfor l(0, 2 * n - 1)\n\t\tfor r(0, 2 * n - 1)\n\t\t\tdo dp[l][r] :: 10 ^ 9\n\t\tend for\n\tend for\n\t\n\tfor w(2, 2 * n, 2)\n\t\tfor l(0, 2 * n - w)\n\t\t\tvar r: int :: l + w - 1\n\t\t\tif(w = 2)\n\t\t\t\tdo dp[l][r] :: (a[l] - a[r]).abs()\n\t\t\telse\n\t\t\t\tfor k(l + 1, r - 2)\n\t\t\t\t\tdo dp[l][r] :: [dp[l][r], dp[l][k] + dp[k + 1][r]].min()\n\t\t\t\tend for\n\t\t\t\tdo dp[l][r] :: [dp[l][r], dp[l + 1][r - 1] + (a[l] - a[r]).abs()].min()\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[0][2 * n - 1]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 150, "name": "020", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long A, B, C;\n\nlong long E = 1;\n\n\n\nint main() {\n\n\tcin >> A >> B >> C;\n\n\tfor (int i = 1; i <= B; i++) E *= C;\n\n\tif (A < E) cout << \"Yes\" << endl;\n\n\telse cout << \"No\" << endl;\n\n\treturn 0;\n\n}", "Crystal": "a, b, c = read_line.split.map(&.to_i64)\nputs a < c**b ? \"Yes\" : \"No\"\n" }, { "id": 151, "name": "020", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long A, B, C;\n\nlong long E = 1;\n\n\n\nint main() {\n\n\tcin >> A >> B >> C;\n\n\tfor (int i = 1; i <= B; i++) E *= C;\n\n\tif (A < E) cout << \"Yes\" << endl;\n\n\telse cout << \"No\" << endl;\n\n\treturn 0;\n\n}", "Python": "a, b, c = map(int, input().split())\n\ntmp = 1\n\nfor i in range(b):\n tmp *= c\n\nif a < tmp:\n print('Yes')\nelse:\n print('No')\n" }, { "id": 152, "name": "020", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long A, B, C;\n\nlong long E = 1;\n\n\n\nint main() {\n\n\tcin >> A >> B >> C;\n\n\tfor (int i = 1; i <= B; i++) E *= C;\n\n\tif (A < E) cout << \"Yes\" << endl;\n\n\telse cout << \"No\" << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar c: int :: cui@inputInt()\n\tvar ans: bool :: a < c ^ b\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 153, "name": "020", "Crystal": "a, b, c = read_line.split.map(&.to_i64)\nputs a < c**b ? \"Yes\" : \"No\"\n", "Python": "a, b, c = map(int, input().split())\n\ntmp = 1\n\nfor i in range(b):\n tmp *= c\n\nif a < tmp:\n print('Yes')\nelse:\n print('No')\n" }, { "id": 154, "name": "020", "Crystal": "a, b, c = read_line.split.map(&.to_i64)\nputs a < c**b ? \"Yes\" : \"No\"\n", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar c: int :: cui@inputInt()\n\tvar ans: bool :: a < c ^ b\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 155, "name": "020", "Python": "a, b, c = map(int, input().split())\n\ntmp = 1\n\nfor i in range(b):\n tmp *= c\n\nif a < tmp:\n print('Yes')\nelse:\n print('No')\n", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar c: int :: cui@inputInt()\n\tvar ans: bool :: a < c ^ b\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 156, "name": "021", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N, M;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// Graph\n\nbool used[1 << 18];\n\nvector G[1 << 18];\n\nvector H[1 << 18];\n\nvector I;\n\nlong long cnts = 0;\n\n\n\nvoid dfs(int pos) {\n\n\tused[pos] = true;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (used[i] == false) dfs(i);\n\n\t}\n\n\tI.push_back(pos);\n\n}\n\n\n\nvoid dfs2(int pos) {\n\n\tused[pos] = true;\n\n\tcnts++;\n\n\tfor (int i : H[pos]) {\n\n\t\tif (used[i] == false) dfs2(i);\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tH[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. First DFS\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (used[i] == false) dfs(i);\n\n\t}\n\n\n\n\t// Step #3. Second DFS\n\n\tlong long Answer = 0;\n\n\treverse(I.begin(), I.end());\n\n\tfor (int i = 1; i <= N; i++) used[i] = false;\n\n\tfor (int i : I) {\n\n\t\tif (used[i] == true) continue;\n\n\t\tcnts = 0;\n\n\t\tdfs2(i);\n\n\t\tAnswer += cnts * (cnts - 1LL) / 2LL;\n\n\t}\n\n\n\n\t// Step #4. Output The Answer!\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::scc_graph](https://atcoder.github.io/ac-library/master/document_en/scc.html).\n #\n # ```\n # scc = AtCoder::SCC.new(3_i64)\n # scc.add_edge(0, 1)\n # scc.add_edge(1, 0)\n # scc.add_edge(2, 0)\n # scc.scc # => [Set{2}, Set{0, 1}]\n # ```\n class SCC\n alias Adjacency = NamedTuple(in: Array(Int64), out: Array(Int64))\n\n getter size : Int64\n getter adjacencies : Array(Adjacency)\n\n def initialize(@size)\n @adjacencies = Array(Adjacency).new(@size) { {in: [] of Int64, out: [] of Int64} }\n\n @topological_order = Array(Int64).new(@size)\n @visit_counts = Array(Int64).new(@size, 0_i64)\n @visited = Set(Int64).new\n @stack = Deque(Int64).new\n @groups = Array(Set(Int64)).new\n end\n\n # Implements atcoder::scc_graph.add_edge(from, to).\n def add_edge(from, to)\n @adjacencies[from][:out] << to.to_i64\n @adjacencies[to][:in] << from.to_i64\n end\n\n private def dfs(start)\n @stack << start\n @visited << start\n\n until @stack.empty?\n node = @stack.last\n children = @adjacencies[node][:out]\n\n if @visit_counts[node] < children.size\n child = children[@visit_counts[node]]\n @visit_counts[node] += 1\n\n unless @visited.includes?(child)\n @visited << child\n @stack << child\n end\n else\n @topological_order << node\n @stack.pop\n end\n end\n end\n\n private def reverse_dfs(start)\n @stack << start\n @visited << start\n group = Set{start}\n\n until @stack.empty?\n node = @stack.pop\n children = @adjacencies[node][:in]\n\n children.each do |child|\n unless @visited.includes?(child)\n @stack << child\n @visited << child\n group << child\n end\n end\n end\n\n @groups << group\n end\n\n # Implements atcoder::scc_graph.scc().\n def scc\n @visited = Set(Int64).new\n @stack = Deque(Int64).new\n @visit_counts = Array(Int64).new(@size, 0_i64)\n @topological_order = Array(Int64).new(@size)\n @groups = Array(Set(Int64)).new\n\n @size.times do |node|\n unless @visited.includes?(node)\n dfs(node)\n end\n end\n\n @visited = Set(Int64).new\n\n @topological_order.reverse_each do |node|\n unless @visited.includes?(node)\n reverse_dfs(node)\n end\n end\n\n @groups\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nscc = AtCoder::SCC.new(n.to_i64)\nm.times do\n a, b = read_line.split.map(&.to_i.pred)\n scc.add_edge(a, b)\nend\nputs scc.scc.sum { |group|\n i = group.size.to_i64\n i * i.pred // 2\n}\n" }, { "id": 157, "name": "021", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N, M;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// Graph\n\nbool used[1 << 18];\n\nvector G[1 << 18];\n\nvector H[1 << 18];\n\nvector I;\n\nlong long cnts = 0;\n\n\n\nvoid dfs(int pos) {\n\n\tused[pos] = true;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (used[i] == false) dfs(i);\n\n\t}\n\n\tI.push_back(pos);\n\n}\n\n\n\nvoid dfs2(int pos) {\n\n\tused[pos] = true;\n\n\tcnts++;\n\n\tfor (int i : H[pos]) {\n\n\t\tif (used[i] == false) dfs2(i);\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tH[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. First DFS\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (used[i] == false) dfs(i);\n\n\t}\n\n\n\n\t// Step #3. Second DFS\n\n\tlong long Answer = 0;\n\n\treverse(I.begin(), I.end());\n\n\tfor (int i = 1; i <= N; i++) used[i] = false;\n\n\tfor (int i : I) {\n\n\t\tif (used[i] == true) continue;\n\n\t\tcnts = 0;\n\n\t\tdfs2(i);\n\n\t\tAnswer += cnts * (cnts - 1LL) / 2LL;\n\n\t}\n\n\n\n\t// Step #4. Output The Answer!\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Python": "import sys\ninput = sys.stdin.readline\n\nclass SCC:\n def __init__(self, n):\n self.n = n\n self.graph = [[] for _ in range(n)]\n self.rev_graph = [[] for _ in range(n)]\n self.labels = [-1] * n\n self.lb_cnt = 0\n\n def add_edge(self, v, nxt_v):\n self.graph[v].append(nxt_v)\n self.rev_graph[nxt_v].append(v)\n\n def build(self):\n self.post_order = []\n self.used = [False] * self.n\n for v in range(self.n):\n if not self.used[v]:\n self._dfs(v)\n for v in reversed(self.post_order):\n if self.labels[v] == -1:\n self._rev_dfs(v)\n self.lb_cnt += 1\n\n def _dfs(self, v):\n stack = [v, 0]\n while stack:\n v, idx = stack[-2:]\n if not idx and self.used[v]:\n stack.pop()\n stack.pop()\n else:\n self.used[v] = True\n if idx < len(self.graph[v]):\n stack[-1] += 1\n stack.append(self.graph[v][idx])\n stack.append(0)\n else:\n stack.pop()\n self.post_order.append(stack.pop())\n\n def _rev_dfs(self, v):\n stack = [v]\n self.labels[v] = self.lb_cnt\n while stack:\n v = stack.pop()\n for nxt_v in self.rev_graph[v]:\n if self.labels[nxt_v] != -1:\n continue\n stack.append(nxt_v)\n self.labels[nxt_v] = self.lb_cnt\n\n def construct(self):\n self.dag = [[] for i in range(self.lb_cnt)]\n self.groups = [[] for i in range(self.lb_cnt)]\n for v, lb in enumerate(self.labels):\n for nxt_v in self.graph[v]:\n nxt_lb = self.labels[nxt_v]\n if lb == nxt_lb:\n continue\n self.dag[lb].append(nxt_lb)\n self.groups[lb].append(v)\n return self.dag, self.groups\n\nn, m = map(int, input().split())\ngraph = [list(map(int,input().split())) for _ in range(m)]\nscc = SCC(n)\n\nfor u, v in graph:\n scc.add_edge(u - 1, v - 1)\nscc.build()\n_,elems = scc.construct()\n\nans = 0\nfor i in range(len(elems)):\n ans += len(elems[i]) * (len(elems[i]) - 1) // 2\n\nprint(ans)" }, { "id": 158, "name": "021", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N, M;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// Graph\n\nbool used[1 << 18];\n\nvector G[1 << 18];\n\nvector H[1 << 18];\n\nvector I;\n\nlong long cnts = 0;\n\n\n\nvoid dfs(int pos) {\n\n\tused[pos] = true;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (used[i] == false) dfs(i);\n\n\t}\n\n\tI.push_back(pos);\n\n}\n\n\n\nvoid dfs2(int pos) {\n\n\tused[pos] = true;\n\n\tcnts++;\n\n\tfor (int i : H[pos]) {\n\n\t\tif (used[i] == false) dfs2(i);\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tH[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. First DFS\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (used[i] == false) dfs(i);\n\n\t}\n\n\n\n\t// Step #3. Second DFS\n\n\tlong long Answer = 0;\n\n\treverse(I.begin(), I.end());\n\n\tfor (int i = 1; i <= N; i++) used[i] = false;\n\n\tfor (int i : I) {\n\n\t\tif (used[i] == true) continue;\n\n\t\tcnts = 0;\n\n\t\tdfs2(i);\n\n\t\tAnswer += cnts * (cnts - 1LL) / 2LL;\n\n\t}\n\n\n\n\t// Step #4. Output The Answer!\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar ab: []list :: #[n]list\n\tvar ba: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo ab[i] :: #list\n\t\tdo ba[i] :: #list\n\tend for\n\tfor(1, m)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo ab[a].add(b)\n\t\tdo ba[b].add(a)\n\tend for\n\t\n\tvar used1: []bool :: #[n]bool\n\tvar ordersList: list :: #list\n\tfor i(0, n - 1)\n\t\tif(!used1[i])\n\t\t\tdo dfs1(ab, used1, i, ordersList)\n\t\tend if\n\tend for\n\tvar orders: []int :: ordersList.toArray()\n\tdo orders.reverse()\n\t\n\tvar used2: []bool :: #[n]bool\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tif(!used2[orders[i]])\n\t\t\tvar res: int :: dfs2(ba, used2, orders[i])\n\t\t\tdo ans :+ res * (res - 1) / 2\n\t\tend if\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs1(ab: []list, used: []bool, u: int, ordersList: list)\n\t\tdo used[u] :: true\n\t\tdo ab[u].head()\n\t\tfor i(0, ^ab[u] - 1)\n\t\t\tvar v: int :: ab[u].get()\n\t\t\tif(!used[v])\n\t\t\t\tdo dfs1(ab, used, v, ordersList)\n\t\t\tend if\n\t\t\tdo ab[u].next()\n\t\tend for\n\t\tdo ordersList.add(u)\n\tend func\n\t\n\tfunc dfs2(ba: []list, used: []bool, u: int): int\n\t\tvar res: int :: 1\n\t\tdo used[u] :: true\n\t\tdo ba[u].head()\n\t\tfor i(0, ^ba[u] - 1)\n\t\t\tvar v: int :: ba[u].get()\n\t\t\tif(!used[v])\n\t\t\t\tdo res :+ dfs2(ba, used, v)\n\t\t\tend if\n\t\t\tdo ba[u].next()\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 159, "name": "021", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::scc_graph](https://atcoder.github.io/ac-library/master/document_en/scc.html).\n #\n # ```\n # scc = AtCoder::SCC.new(3_i64)\n # scc.add_edge(0, 1)\n # scc.add_edge(1, 0)\n # scc.add_edge(2, 0)\n # scc.scc # => [Set{2}, Set{0, 1}]\n # ```\n class SCC\n alias Adjacency = NamedTuple(in: Array(Int64), out: Array(Int64))\n\n getter size : Int64\n getter adjacencies : Array(Adjacency)\n\n def initialize(@size)\n @adjacencies = Array(Adjacency).new(@size) { {in: [] of Int64, out: [] of Int64} }\n\n @topological_order = Array(Int64).new(@size)\n @visit_counts = Array(Int64).new(@size, 0_i64)\n @visited = Set(Int64).new\n @stack = Deque(Int64).new\n @groups = Array(Set(Int64)).new\n end\n\n # Implements atcoder::scc_graph.add_edge(from, to).\n def add_edge(from, to)\n @adjacencies[from][:out] << to.to_i64\n @adjacencies[to][:in] << from.to_i64\n end\n\n private def dfs(start)\n @stack << start\n @visited << start\n\n until @stack.empty?\n node = @stack.last\n children = @adjacencies[node][:out]\n\n if @visit_counts[node] < children.size\n child = children[@visit_counts[node]]\n @visit_counts[node] += 1\n\n unless @visited.includes?(child)\n @visited << child\n @stack << child\n end\n else\n @topological_order << node\n @stack.pop\n end\n end\n end\n\n private def reverse_dfs(start)\n @stack << start\n @visited << start\n group = Set{start}\n\n until @stack.empty?\n node = @stack.pop\n children = @adjacencies[node][:in]\n\n children.each do |child|\n unless @visited.includes?(child)\n @stack << child\n @visited << child\n group << child\n end\n end\n end\n\n @groups << group\n end\n\n # Implements atcoder::scc_graph.scc().\n def scc\n @visited = Set(Int64).new\n @stack = Deque(Int64).new\n @visit_counts = Array(Int64).new(@size, 0_i64)\n @topological_order = Array(Int64).new(@size)\n @groups = Array(Set(Int64)).new\n\n @size.times do |node|\n unless @visited.includes?(node)\n dfs(node)\n end\n end\n\n @visited = Set(Int64).new\n\n @topological_order.reverse_each do |node|\n unless @visited.includes?(node)\n reverse_dfs(node)\n end\n end\n\n @groups\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nscc = AtCoder::SCC.new(n.to_i64)\nm.times do\n a, b = read_line.split.map(&.to_i.pred)\n scc.add_edge(a, b)\nend\nputs scc.scc.sum { |group|\n i = group.size.to_i64\n i * i.pred // 2\n}\n", "Python": "import sys\ninput = sys.stdin.readline\n\nclass SCC:\n def __init__(self, n):\n self.n = n\n self.graph = [[] for _ in range(n)]\n self.rev_graph = [[] for _ in range(n)]\n self.labels = [-1] * n\n self.lb_cnt = 0\n\n def add_edge(self, v, nxt_v):\n self.graph[v].append(nxt_v)\n self.rev_graph[nxt_v].append(v)\n\n def build(self):\n self.post_order = []\n self.used = [False] * self.n\n for v in range(self.n):\n if not self.used[v]:\n self._dfs(v)\n for v in reversed(self.post_order):\n if self.labels[v] == -1:\n self._rev_dfs(v)\n self.lb_cnt += 1\n\n def _dfs(self, v):\n stack = [v, 0]\n while stack:\n v, idx = stack[-2:]\n if not idx and self.used[v]:\n stack.pop()\n stack.pop()\n else:\n self.used[v] = True\n if idx < len(self.graph[v]):\n stack[-1] += 1\n stack.append(self.graph[v][idx])\n stack.append(0)\n else:\n stack.pop()\n self.post_order.append(stack.pop())\n\n def _rev_dfs(self, v):\n stack = [v]\n self.labels[v] = self.lb_cnt\n while stack:\n v = stack.pop()\n for nxt_v in self.rev_graph[v]:\n if self.labels[nxt_v] != -1:\n continue\n stack.append(nxt_v)\n self.labels[nxt_v] = self.lb_cnt\n\n def construct(self):\n self.dag = [[] for i in range(self.lb_cnt)]\n self.groups = [[] for i in range(self.lb_cnt)]\n for v, lb in enumerate(self.labels):\n for nxt_v in self.graph[v]:\n nxt_lb = self.labels[nxt_v]\n if lb == nxt_lb:\n continue\n self.dag[lb].append(nxt_lb)\n self.groups[lb].append(v)\n return self.dag, self.groups\n\nn, m = map(int, input().split())\ngraph = [list(map(int,input().split())) for _ in range(m)]\nscc = SCC(n)\n\nfor u, v in graph:\n scc.add_edge(u - 1, v - 1)\nscc.build()\n_,elems = scc.construct()\n\nans = 0\nfor i in range(len(elems)):\n ans += len(elems[i]) * (len(elems[i]) - 1) // 2\n\nprint(ans)" }, { "id": 160, "name": "021", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::scc_graph](https://atcoder.github.io/ac-library/master/document_en/scc.html).\n #\n # ```\n # scc = AtCoder::SCC.new(3_i64)\n # scc.add_edge(0, 1)\n # scc.add_edge(1, 0)\n # scc.add_edge(2, 0)\n # scc.scc # => [Set{2}, Set{0, 1}]\n # ```\n class SCC\n alias Adjacency = NamedTuple(in: Array(Int64), out: Array(Int64))\n\n getter size : Int64\n getter adjacencies : Array(Adjacency)\n\n def initialize(@size)\n @adjacencies = Array(Adjacency).new(@size) { {in: [] of Int64, out: [] of Int64} }\n\n @topological_order = Array(Int64).new(@size)\n @visit_counts = Array(Int64).new(@size, 0_i64)\n @visited = Set(Int64).new\n @stack = Deque(Int64).new\n @groups = Array(Set(Int64)).new\n end\n\n # Implements atcoder::scc_graph.add_edge(from, to).\n def add_edge(from, to)\n @adjacencies[from][:out] << to.to_i64\n @adjacencies[to][:in] << from.to_i64\n end\n\n private def dfs(start)\n @stack << start\n @visited << start\n\n until @stack.empty?\n node = @stack.last\n children = @adjacencies[node][:out]\n\n if @visit_counts[node] < children.size\n child = children[@visit_counts[node]]\n @visit_counts[node] += 1\n\n unless @visited.includes?(child)\n @visited << child\n @stack << child\n end\n else\n @topological_order << node\n @stack.pop\n end\n end\n end\n\n private def reverse_dfs(start)\n @stack << start\n @visited << start\n group = Set{start}\n\n until @stack.empty?\n node = @stack.pop\n children = @adjacencies[node][:in]\n\n children.each do |child|\n unless @visited.includes?(child)\n @stack << child\n @visited << child\n group << child\n end\n end\n end\n\n @groups << group\n end\n\n # Implements atcoder::scc_graph.scc().\n def scc\n @visited = Set(Int64).new\n @stack = Deque(Int64).new\n @visit_counts = Array(Int64).new(@size, 0_i64)\n @topological_order = Array(Int64).new(@size)\n @groups = Array(Set(Int64)).new\n\n @size.times do |node|\n unless @visited.includes?(node)\n dfs(node)\n end\n end\n\n @visited = Set(Int64).new\n\n @topological_order.reverse_each do |node|\n unless @visited.includes?(node)\n reverse_dfs(node)\n end\n end\n\n @groups\n end\n end\nend\n\nn, m = read_line.split.map(&.to_i)\nscc = AtCoder::SCC.new(n.to_i64)\nm.times do\n a, b = read_line.split.map(&.to_i.pred)\n scc.add_edge(a, b)\nend\nputs scc.scc.sum { |group|\n i = group.size.to_i64\n i * i.pred // 2\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar ab: []list :: #[n]list\n\tvar ba: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo ab[i] :: #list\n\t\tdo ba[i] :: #list\n\tend for\n\tfor(1, m)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo ab[a].add(b)\n\t\tdo ba[b].add(a)\n\tend for\n\t\n\tvar used1: []bool :: #[n]bool\n\tvar ordersList: list :: #list\n\tfor i(0, n - 1)\n\t\tif(!used1[i])\n\t\t\tdo dfs1(ab, used1, i, ordersList)\n\t\tend if\n\tend for\n\tvar orders: []int :: ordersList.toArray()\n\tdo orders.reverse()\n\t\n\tvar used2: []bool :: #[n]bool\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tif(!used2[orders[i]])\n\t\t\tvar res: int :: dfs2(ba, used2, orders[i])\n\t\t\tdo ans :+ res * (res - 1) / 2\n\t\tend if\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs1(ab: []list, used: []bool, u: int, ordersList: list)\n\t\tdo used[u] :: true\n\t\tdo ab[u].head()\n\t\tfor i(0, ^ab[u] - 1)\n\t\t\tvar v: int :: ab[u].get()\n\t\t\tif(!used[v])\n\t\t\t\tdo dfs1(ab, used, v, ordersList)\n\t\t\tend if\n\t\t\tdo ab[u].next()\n\t\tend for\n\t\tdo ordersList.add(u)\n\tend func\n\t\n\tfunc dfs2(ba: []list, used: []bool, u: int): int\n\t\tvar res: int :: 1\n\t\tdo used[u] :: true\n\t\tdo ba[u].head()\n\t\tfor i(0, ^ba[u] - 1)\n\t\t\tvar v: int :: ba[u].get()\n\t\t\tif(!used[v])\n\t\t\t\tdo res :+ dfs2(ba, used, v)\n\t\t\tend if\n\t\t\tdo ba[u].next()\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 161, "name": "021", "Python": "import sys\ninput = sys.stdin.readline\n\nclass SCC:\n def __init__(self, n):\n self.n = n\n self.graph = [[] for _ in range(n)]\n self.rev_graph = [[] for _ in range(n)]\n self.labels = [-1] * n\n self.lb_cnt = 0\n\n def add_edge(self, v, nxt_v):\n self.graph[v].append(nxt_v)\n self.rev_graph[nxt_v].append(v)\n\n def build(self):\n self.post_order = []\n self.used = [False] * self.n\n for v in range(self.n):\n if not self.used[v]:\n self._dfs(v)\n for v in reversed(self.post_order):\n if self.labels[v] == -1:\n self._rev_dfs(v)\n self.lb_cnt += 1\n\n def _dfs(self, v):\n stack = [v, 0]\n while stack:\n v, idx = stack[-2:]\n if not idx and self.used[v]:\n stack.pop()\n stack.pop()\n else:\n self.used[v] = True\n if idx < len(self.graph[v]):\n stack[-1] += 1\n stack.append(self.graph[v][idx])\n stack.append(0)\n else:\n stack.pop()\n self.post_order.append(stack.pop())\n\n def _rev_dfs(self, v):\n stack = [v]\n self.labels[v] = self.lb_cnt\n while stack:\n v = stack.pop()\n for nxt_v in self.rev_graph[v]:\n if self.labels[nxt_v] != -1:\n continue\n stack.append(nxt_v)\n self.labels[nxt_v] = self.lb_cnt\n\n def construct(self):\n self.dag = [[] for i in range(self.lb_cnt)]\n self.groups = [[] for i in range(self.lb_cnt)]\n for v, lb in enumerate(self.labels):\n for nxt_v in self.graph[v]:\n nxt_lb = self.labels[nxt_v]\n if lb == nxt_lb:\n continue\n self.dag[lb].append(nxt_lb)\n self.groups[lb].append(v)\n return self.dag, self.groups\n\nn, m = map(int, input().split())\ngraph = [list(map(int,input().split())) for _ in range(m)]\nscc = SCC(n)\n\nfor u, v in graph:\n scc.add_edge(u - 1, v - 1)\nscc.build()\n_,elems = scc.construct()\n\nans = 0\nfor i in range(len(elems)):\n ans += len(elems[i]) * (len(elems[i]) - 1) // 2\n\nprint(ans)", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar ab: []list :: #[n]list\n\tvar ba: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo ab[i] :: #list\n\t\tdo ba[i] :: #list\n\tend for\n\tfor(1, m)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo ab[a].add(b)\n\t\tdo ba[b].add(a)\n\tend for\n\t\n\tvar used1: []bool :: #[n]bool\n\tvar ordersList: list :: #list\n\tfor i(0, n - 1)\n\t\tif(!used1[i])\n\t\t\tdo dfs1(ab, used1, i, ordersList)\n\t\tend if\n\tend for\n\tvar orders: []int :: ordersList.toArray()\n\tdo orders.reverse()\n\t\n\tvar used2: []bool :: #[n]bool\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tif(!used2[orders[i]])\n\t\t\tvar res: int :: dfs2(ba, used2, orders[i])\n\t\t\tdo ans :+ res * (res - 1) / 2\n\t\tend if\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs1(ab: []list, used: []bool, u: int, ordersList: list)\n\t\tdo used[u] :: true\n\t\tdo ab[u].head()\n\t\tfor i(0, ^ab[u] - 1)\n\t\t\tvar v: int :: ab[u].get()\n\t\t\tif(!used[v])\n\t\t\t\tdo dfs1(ab, used, v, ordersList)\n\t\t\tend if\n\t\t\tdo ab[u].next()\n\t\tend for\n\t\tdo ordersList.add(u)\n\tend func\n\t\n\tfunc dfs2(ba: []list, used: []bool, u: int): int\n\t\tvar res: int :: 1\n\t\tdo used[u] :: true\n\t\tdo ba[u].head()\n\t\tfor i(0, ^ba[u] - 1)\n\t\t\tvar v: int :: ba[u].get()\n\t\t\tif(!used[v])\n\t\t\t\tdo res :+ dfs2(ba, used, v)\n\t\t\tend if\n\t\t\tdo ba[u].next()\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 162, "name": "022", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nlong long A, B, C;\n\n\n\nint main() {\n\n\tcin >> A >> B >> C;\n\n\tlong long S = gcd(A, gcd(B, C));\n\n\tcout << (A / S - 1LL) + (B / S - 1LL) + (C / S - 1LL) << endl;\n\n\treturn 0;\n\n}", "Crystal": "a = read_line.split.map(&.to_i64)\ngcd = a.reduce { |x, y| x.gcd y }\nputs a.sum { |x| x // gcd - 1 }\n" }, { "id": 163, "name": "022", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nlong long A, B, C;\n\n\n\nint main() {\n\n\tcin >> A >> B >> C;\n\n\tlong long S = gcd(A, gcd(B, C));\n\n\tcout << (A / S - 1LL) + (B / S - 1LL) + (C / S - 1LL) << endl;\n\n\treturn 0;\n\n}", "Python": "import math\n\na,b,c = map(int,input().split())\ng = math.gcd(math.gcd(a,b),c)\nprint((a+b+c)//g-3)\n" }, { "id": 164, "name": "022", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nlong long A, B, C;\n\n\n\nint main() {\n\n\tcin >> A >> B >> C;\n\n\tlong long S = gcd(A, gcd(B, C));\n\n\tcout << (A / S - 1LL) + (B / S - 1LL) + (C / S - 1LL) << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar a: []int :: #[3]int\n\tfor i(0, 2)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar gcd: int :: a[0]\n\tfor i(1, 2)\n\t\tdo gcd :: math@gcd(gcd, a[i])\n\tend for\n\tvar ans: int :: 0\n\tfor i(0, 2)\n\t\tdo ans :+ (a[i] / math@gcd(gcd, a[i]) - 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 165, "name": "022", "Crystal": "a = read_line.split.map(&.to_i64)\ngcd = a.reduce { |x, y| x.gcd y }\nputs a.sum { |x| x // gcd - 1 }\n", "Python": "import math\n\na,b,c = map(int,input().split())\ng = math.gcd(math.gcd(a,b),c)\nprint((a+b+c)//g-3)\n" }, { "id": 166, "name": "022", "Crystal": "a = read_line.split.map(&.to_i64)\ngcd = a.reduce { |x, y| x.gcd y }\nputs a.sum { |x| x // gcd - 1 }\n", "Kuin": "func main()\n\tvar a: []int :: #[3]int\n\tfor i(0, 2)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar gcd: int :: a[0]\n\tfor i(1, 2)\n\t\tdo gcd :: math@gcd(gcd, a[i])\n\tend for\n\tvar ans: int :: 0\n\tfor i(0, 2)\n\t\tdo ans :+ (a[i] / math@gcd(gcd, a[i]) - 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 167, "name": "022", "Python": "import math\n\na,b,c = map(int,input().split())\ng = math.gcd(math.gcd(a,b),c)\nprint((a+b+c)//g-3)\n", "Kuin": "func main()\n\tvar a: []int :: #[3]int\n\tfor i(0, 2)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar gcd: int :: a[0]\n\tfor i(1, 2)\n\t\tdo gcd :: math@gcd(gcd, a[i])\n\tend for\n\tvar ans: int :: 0\n\tfor i(0, 2)\n\t\tdo ans :+ (a[i] / math@gcd(gcd, a[i]) - 1)\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 168, "name": "023", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// Input\n\nint H, W;\n\nchar c[25][25];\n\n\n\n// Map\n\nint cnt[25];\n\nbool used[25][25];\n\nint nex0[25][1 << 18];\n\nint nex1[25][1 << 18];\n\nint state[25][1 << 18];\n\nmap> Map[25];\n\n\n\n// DP\n\nint mod = 1000000007;\n\nint dp[25][25][1 << 18];\n\n\n\nbool hantei(int sx, int sy) {\n\n\tint dx[8] = { 1, 1, 1, 0, -1, -1, -1, 0 };\n\n\tint dy[8] = { -1, 0, 1, 1, 1, 0, -1, -1 };\n\n\tfor (int i = 0; i < 8; i++) {\n\n\t\tint tx = sx + dx[i], ty = sy + dy[i];\n\n\t\tif (tx < 0 || ty < 0 || ty >= W) continue;\n\n\t\tif (used[tx][ty] == true) return false;\n\n\t}\n\n\treturn true;\n\n}\n\n\n\nvoid dfs(int pos, int dep, int str) {\n\n\tint sx = pos / W, sy = pos % W;\n\n\tif (dep == W + 1) {\n\n\t\tint idx = cnt[sy];\n\n\t\tbool flag = hantei(sx, sy);\n\n\t\tstate[sy][idx] = str;\n\n\t\tMap[sy][str] = make_pair(idx, flag);\n\n\t\tcnt[sy] += 1;\n\n\t\treturn;\n\n\t}\n\n\n\n\tdfs(pos + 1, dep + 1, str);\n\n\tif (hantei(sx, sy) == true) {\n\n\t\tused[sx][sy] = true;\n\n\t\tdfs(pos + 1, dep + 1, str + (1 << dep));\n\n\t\tused[sx][sy] = false;\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> H >> W;\n\n\tfor (int i = 0; i < H; i++) {\n\n\t\tfor (int j = 0; j < W; j++) cin >> c[i][j];\n\n\t}\n\n\n\n\t// Step #2. Initialize\n\n\tfor (int i = 0; i < W; i++) {\n\n\t\tdfs(i, 0, 0);\n\n\t}\n\n\tfor (int i = 0; i < W; i++) {\n\n\t\tfor (int j = 0; j < cnt[i]; j++) {\n\n\t\t\tint t = state[i][j];\n\n\t\t\tint t0 = (t >> 1);\n\n\t\t\tint t1 = (t >> 1) + (1 << W);\n\n\t\t\tnex0[i][j] = Map[(i + 1) % W][t0].first;\n\n\t\t\tif (Map[i][t].second == true) {\n\n\t\t\t\tnex1[i][j] = Map[(i + 1) % W][t1].first;\n\n\t\t\t}\n\n\t\t\telse {\n\n\t\t\t\tnex1[i][j] = -1;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. DP\n\n\tdp[0][0][0] = 1;\n\n\tfor (int i = 0; i < H; i++) {\n\n\t\tfor (int j = 0; j < W; j++) {\n\n\t\t\tint n1 = i, n2 = j + 1;\n\n\t\t\tif (n2 == W) { n1 += 1; n2 = 0; }\n\n\n\n\t\t\tfor (int k = 0; k < cnt[j]; k++) {\n\n\t\t\t\tif (dp[i][j][k] == 0) continue;\n\n\t\t\t\tdp[n1][n2][nex0[j][k]] += dp[i][j][k];\n\n\t\t\t\tdp[n1][n2][nex0[j][k]] %= mod;\n\n\t\t\t\tif (nex1[j][k] != -1 && c[i][j] == '.') {\n\n\t\t\t\t\tdp[n1][n2][nex1[j][k]] += dp[i][j][k];\n\n\t\t\t\t\tdp[n1][n2][nex1[j][k]] %= mod;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output The Answer\n\n\tint Answer = 0;\n\n\tfor (int i = 0; i < cnt[0]; i++) {\n\n\t\tAnswer += dp[H][0][i];\n\n\t\tAnswer %= mod;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "MOD = 10**9 + 7\nh, w = read_line.split.map(&.to_i)\ngrid = (1..h).map { read_line }\n\na = (1..w).reduce([[0], [1], [] of Int32, [] of Int32]) { |(a00, a01, a10, a11), _|\n b00 = (a00 + a01).map { |x| x << 1 }\n b01 = a00.map { |x| x << 1 | 1 }\n b10 = (a10 + a11).map { |x| x << 1 }\n b11 = (a01 + a10).map { |x| x << 1 | 1 }\n [b00, b01, b10, b11]\n}.flatten\nm = a.size\n\nhash = a.zip(0..).to_h\nnext1 = a.map { |bit| hash[bit >> 1] }\nnext2 = a.map { |bit| hash[bit >> 1 | 1 << w]? }\n\ndp = [1] + [0] * m.pred\n(0...h).each do |i|\n (0...w).each do |j|\n dp = (0...m).each_with_object([0] * m) do |k, dp2|\n next if dp[k] == 0\n bit = a[k]\n dp2[n1 = next1[k]] = (dp2[n1] + dp[k]) % MOD\n unless grid[i][j] == '#' ||\n (i != 0 && j != 0 && bit.bit(0) == 1) ||\n (i != 0 && bit.bit(1) == 1) ||\n (i != 0 && j != w - 1 && bit.bit(2) == 1) ||\n (j != 0 && bit.bit(w) == 1)\n dp2[n2 = next2[k].not_nil!] = (dp2[n2] + dp[k]) % MOD\n end\n end\n end\nend\nputs dp.reduce(0) { |sum, x| (sum + x) % MOD }\n" }, { "id": 169, "name": "024", "C++": "#include \n#include \n#define rep(i, n) for(int i = 0; i < n; i++)\nusing namespace std;\n\nint main(){\n int n,k;\n cin >> n >> k;\n vector a(n);\n rep(i, n) cin >> a[i];\n int cnt = 0;\n rep(i, n){\n int b; cin >> b;\n cnt += abs(a[i] - b);\n }\n if(k < cnt || (k-cnt) & 1){\n cout << \"No\\n\";\n }else{\n cout << \"Yes\\n\";\n }\n}", "Crystal": "_, k = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\nb = read_line.split.map(&.to_i)\nx = k - a.zip(b).sum { |i, j| (i - j).abs }\nputs x >= 0 && x.even? ? \"Yes\" : \"No\"\n" }, { "id": 170, "name": "024", "C++": "#include \n#include \n#define rep(i, n) for(int i = 0; i < n; i++)\nusing namespace std;\n\nint main(){\n int n,k;\n cin >> n >> k;\n vector a(n);\n rep(i, n) cin >> a[i];\n int cnt = 0;\n rep(i, n){\n int b; cin >> b;\n cnt += abs(a[i] - b);\n }\n if(k < cnt || (k-cnt) & 1){\n cout << \"No\\n\";\n }else{\n cout << \"Yes\\n\";\n }\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar b: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo b[i] :: cui@inputInt()\n\tend for\n\t\n\tvar diff: int :: 0\n\tfor i(0, n - 1)\n\t\tdo diff :+ (a[i] - b[i]).abs()\n\tend for\n\t\n\tvar ans: bool :: diff <= k & (diff - k) % 2 = 0\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 171, "name": "024", "Crystal": "_, k = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\nb = read_line.split.map(&.to_i)\nx = k - a.zip(b).sum { |i, j| (i - j).abs }\nputs x >= 0 && x.even? ? \"Yes\" : \"No\"\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\tvar b: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo b[i] :: cui@inputInt()\n\tend for\n\t\n\tvar diff: int :: 0\n\tfor i(0, n - 1)\n\t\tdo diff :+ (a[i] - b[i]).abs()\n\tend for\n\t\n\tvar ans: bool :: diff <= k & (diff - k) % 2 = 0\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 172, "name": "025", "C++": "#include \n#include \n#include \nusing ll = long long;\n#define all(a) (a).begin(), (a).end()\nusing namespace std;\n\n//50[ms]\nll n,b, ans = 0;\nvoid dfs(string s, int v){\n ll cnt = 1;\n for(char c : s) cnt *= c - '0';\n cnt += b;\n string str = to_string(cnt);\n sort(all(str));\n if(str == s && cnt <= n) ans++;\n if((int)s.size() == 11) return;\n for(int i = v; i < 10; i++){\n dfs(s + char(i + '0'), i);\n }\n}\nint main(){\n cin >> n >> b;\n dfs(\"\", 1);\n string str = to_string(b);\n for(char &c : str) if(c == '0'){\n if(n >= b) ans++;\n break;\n }\n cout << ans << \"\\n\";\n}", "Crystal": "n, b = read_line.split.map(&.to_i64)\nputs (1..11).sum { |size|\n (0..9).to_a.repeated_combinations(size).count { |m_ary|\n m = m_ary.reduce(1i64) { |acc, i| acc * i } + b\n 1 <= m <= n && m.to_s.chars.map(&.to_i).sort == m_ary\n }\n}\n" }, { "id": 173, "name": "025", "C++": "#include \n#include \n#include \nusing ll = long long;\n#define all(a) (a).begin(), (a).end()\nusing namespace std;\n\n//50[ms]\nll n,b, ans = 0;\nvoid dfs(string s, int v){\n ll cnt = 1;\n for(char c : s) cnt *= c - '0';\n cnt += b;\n string str = to_string(cnt);\n sort(all(str));\n if(str == s && cnt <= n) ans++;\n if((int)s.size() == 11) return;\n for(int i = v; i < 10; i++){\n dfs(s + char(i + '0'), i);\n }\n}\nint main(){\n cin >> n >> b;\n dfs(\"\", 1);\n string str = to_string(b);\n for(char &c : str) if(c == '0'){\n if(n >= b) ans++;\n break;\n }\n cout << ans << \"\\n\";\n}", "Ruby": "require 'set'\n\nf_set = Set.new\nf_set.add(0)\n\nfor a0 in 1..9\nfor a1 in a0..9\nfor a2 in a1..9\nfor a3 in a2..9\nfor a4 in a3..9\nfor a5 in a4..9\nfor a6 in a5..9\nfor a7 in a6..9\nfor a8 in a7..9\nfor a9 in a8..9\n f_set.add(a0 * a1 * a2 * a3 * a4 * a5 * a6 * a7 * a8 * a9)\nend; end; end; end; end; end; end; end; end; end\n\nn, b = readline.split.map(&:to_i)\n\nputs (\n f_set.count do |f_m|\n m = b + f_m\n prod = 1\n k = m\n while k > 0\n prod *= k % 10; k /= 10\n end\n prod == f_m && m <= n\n end\n)\n" }, { "id": 174, "name": "025", "Crystal": "n, b = read_line.split.map(&.to_i64)\nputs (1..11).sum { |size|\n (0..9).to_a.repeated_combinations(size).count { |m_ary|\n m = m_ary.reduce(1i64) { |acc, i| acc * i } + b\n 1 <= m <= n && m.to_s.chars.map(&.to_i).sort == m_ary\n }\n}\n", "Ruby": "require 'set'\n\nf_set = Set.new\nf_set.add(0)\n\nfor a0 in 1..9\nfor a1 in a0..9\nfor a2 in a1..9\nfor a3 in a2..9\nfor a4 in a3..9\nfor a5 in a4..9\nfor a6 in a5..9\nfor a7 in a6..9\nfor a8 in a7..9\nfor a9 in a8..9\n f_set.add(a0 * a1 * a2 * a3 * a4 * a5 * a6 * a7 * a8 * a9)\nend; end; end; end; end; end; end; end; end; end\n\nn, b = readline.split.map(&:to_i)\n\nputs (\n f_set.count do |f_m|\n m = b + f_m\n prod = 1\n k = m\n while k > 0\n prod *= k % 10; k /= 10\n end\n prod == f_m && m <= n\n end\n)\n" }, { "id": 175, "name": "026", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// Graph\n\nvector G[1 << 18];\n\nint col[1 << 18];\n\n\n\nvoid dfs(int pos, int cur) {\n\n\tcol[pos] = cur;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (col[i] >= 1) continue;\n\n\t\tdfs(i, 3 - cur);\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. Graph Coloring\n\n\tdfs(1, 1);\n\n\n\n\t// Step #3. Get Answer\n\n\tvector G1, G2;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (col[i] == 1) G1.push_back(i);\n\n\t\tif (col[i] == 2) G2.push_back(i);\n\n\t}\n\n\tif (G1.size() > G2.size()) {\n\n\t\tfor (int i = 0; i < (N / 2); i++) {\n\n\t\t\tif (i) cout << \" \";\n\n\t\t\tcout << G1[i];\n\n\t\t}\n\n\t\tcout << endl;\n\n\t}\n\n\telse {\n\n\t\tfor (int i = 0; i < (N / 2); i++) {\n\n\t\t\tif (i) cout << \" \";\n\n\t\t\tcout << G2[i];\n\n\t\t}\n\n\t\tcout << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(i : Int, j : Int)\n @graph[i] << j\n @graph[j] << i\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def bipartite_graph : Array(Bool)?\n color = Array(Bool?).new(size, nil)\n queue = Deque.new (0...size).to_a\n while v = queue.shift?\n color[v] = true if color[v].nil?\n flag = color[v].not_nil!\n graph[v].each do |edge|\n if (flag2 = color[edge]).nil?\n color[edge] = !flag\n queue.unshift edge\n else\n return nil if flag == flag2\n end\n end\n end\n color.map(&.not_nil!)\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\ncolor = graph.bipartite_graph.not_nil!\nputs [true, false].map { |b|\n (0...n).select { |i| color[i] == b }.map(&.succ)\n}.max_by(&.size)[0, n // 2].join(' ')\n" }, { "id": 176, "name": "026", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\n// Graph\n\nvector G[1 << 18];\n\nint col[1 << 18];\n\n\n\nvoid dfs(int pos, int cur) {\n\n\tcol[pos] = cur;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (col[i] >= 1) continue;\n\n\t\tdfs(i, 3 - cur);\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. Graph Coloring\n\n\tdfs(1, 1);\n\n\n\n\t// Step #3. Get Answer\n\n\tvector G1, G2;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (col[i] == 1) G1.push_back(i);\n\n\t\tif (col[i] == 2) G2.push_back(i);\n\n\t}\n\n\tif (G1.size() > G2.size()) {\n\n\t\tfor (int i = 0; i < (N / 2); i++) {\n\n\t\t\tif (i) cout << \" \";\n\n\t\t\tcout << G1[i];\n\n\t\t}\n\n\t\tcout << endl;\n\n\t}\n\n\telse {\n\n\t\tfor (int i = 0; i < (N / 2); i++) {\n\n\t\t\tif (i) cout << \" \";\n\n\t\t\tcout << G2[i];\n\n\t\t}\n\n\t\tcout << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "var arrT: list\nvar arrF: list\n\nfunc main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tdo @arrT :: #list\n\tdo @arrF :: #list\n\tdo dfs(graph, 0, 0, true)\n\t\n\tvar majority: list\n\tif(^@arrT >= n / 2)\n\t\tdo majority :: @arrT\n\telse\n\t\tdo majority :: @arrF\n\tend if\n\tdo majority.head()\n\tfor i(1, n / 2)\n\t\tvar ans: int :: majority.get() + 1\n\t\tdo cui@print(\"\\{ans}\" ~ (i = n / 2 ?(\"\\n\", \" \")))\n\t\tdo majority.next()\n\tend for\n\t\n\tfunc dfs(graph: []list, u: int, parent: int, f: bool)\n\t\tif(f)\n\t\t\tdo @arrT.add(u)\n\t\telse\n\t\t\tdo @arrF.add(u)\n\t\tend if\n\t\tdo graph[u].head()\n\t\twhile(!graph[u].term())\n\t\t\tvar x: int :: graph[u].get()\n\t\t\tif(x <> parent)\n\t\t\t\tdo dfs(graph, x, u, !f)\n\t\t\tend if\n\t\t\tdo graph[u].next()\n\t\tend while\n\tend func\nend func\n" }, { "id": 177, "name": "026", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(i : Int, j : Int)\n @graph[i] << j\n @graph[j] << i\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def bipartite_graph : Array(Bool)?\n color = Array(Bool?).new(size, nil)\n queue = Deque.new (0...size).to_a\n while v = queue.shift?\n color[v] = true if color[v].nil?\n flag = color[v].not_nil!\n graph[v].each do |edge|\n if (flag2 = color[edge]).nil?\n color[edge] = !flag\n queue.unshift edge\n else\n return nil if flag == flag2\n end\n end\n end\n color.map(&.not_nil!)\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\n\ncolor = graph.bipartite_graph.not_nil!\nputs [true, false].map { |b|\n (0...n).select { |i| color[i] == b }.map(&.succ)\n}.max_by(&.size)[0, n // 2].join(' ')\n", "Kuin": "var arrT: list\nvar arrF: list\n\nfunc main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tdo @arrT :: #list\n\tdo @arrF :: #list\n\tdo dfs(graph, 0, 0, true)\n\t\n\tvar majority: list\n\tif(^@arrT >= n / 2)\n\t\tdo majority :: @arrT\n\telse\n\t\tdo majority :: @arrF\n\tend if\n\tdo majority.head()\n\tfor i(1, n / 2)\n\t\tvar ans: int :: majority.get() + 1\n\t\tdo cui@print(\"\\{ans}\" ~ (i = n / 2 ?(\"\\n\", \" \")))\n\t\tdo majority.next()\n\tend for\n\t\n\tfunc dfs(graph: []list, u: int, parent: int, f: bool)\n\t\tif(f)\n\t\t\tdo @arrT.add(u)\n\t\telse\n\t\t\tdo @arrF.add(u)\n\t\tend if\n\t\tdo graph[u].head()\n\t\twhile(!graph[u].term())\n\t\t\tvar x: int :: graph[u].get()\n\t\t\tif(x <> parent)\n\t\t\t\tdo dfs(graph, x, u, !f)\n\t\t\tend if\n\t\t\tdo graph[u].next()\n\t\tend while\n\tend func\nend func\n" }, { "id": 178, "name": "027", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nstring S[1 << 18];\n\nmap Map;\n\n\n\nint main() {\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> S[i];\n\n\t\tif (Map[S[i]] == 0) {\n\n\t\t\tMap[S[i]] = 1;\n\n\t\t\tcout << i << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n = read_line.to_i\nset = Set(String).new\nputs (1..n).select {\n s = read_line\n if set.includes?(s)\n false\n else\n set << s\n true\n end\n}.join('\\n')\n" }, { "id": 179, "name": "027", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nstring S[1 << 18];\n\nmap Map;\n\n\n\nint main() {\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> S[i];\n\n\t\tif (Map[S[i]] == 0) {\n\n\t\t\tMap[S[i]] = 1;\n\n\t\t\tcout << i << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Python": "n = int(input())\ncheck = {}\nfor i in range(n):\n s = input()\n if s in check:\n continue\n else:\n print(i+1)\n check[s] = True\n" }, { "id": 180, "name": "027", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nstring S[1 << 18];\n\nmap Map;\n\n\n\nint main() {\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> S[i];\n\n\t\tif (Map[S[i]] == 0) {\n\n\t\t\tMap[S[i]] = 1;\n\n\t\t\tcout << i << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar prev: int :: 0\n\tvar map: dict<[]char, bool> :: #dict<[]char, bool>\n\tfor i(1, n)\n\t\tdo map.add(cui@input(), true)\n\t\tif(^map <> prev)\n\t\t\tdo prev :+ 1\n\t\t\tdo cui@print(\"\\{i}\\n\")\n\t\tend if\n\tend for\nend func\n" }, { "id": 181, "name": "027", "Crystal": "n = read_line.to_i\nset = Set(String).new\nputs (1..n).select {\n s = read_line\n if set.includes?(s)\n false\n else\n set << s\n true\n end\n}.join('\\n')\n", "Python": "n = int(input())\ncheck = {}\nfor i in range(n):\n s = input()\n if s in check:\n continue\n else:\n print(i+1)\n check[s] = True\n" }, { "id": 182, "name": "027", "Crystal": "n = read_line.to_i\nset = Set(String).new\nputs (1..n).select {\n s = read_line\n if set.includes?(s)\n false\n else\n set << s\n true\n end\n}.join('\\n')\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar prev: int :: 0\n\tvar map: dict<[]char, bool> :: #dict<[]char, bool>\n\tfor i(1, n)\n\t\tdo map.add(cui@input(), true)\n\t\tif(^map <> prev)\n\t\t\tdo prev :+ 1\n\t\t\tdo cui@print(\"\\{i}\\n\")\n\t\tend if\n\tend for\nend func\n" }, { "id": 183, "name": "027", "Python": "n = int(input())\ncheck = {}\nfor i in range(n):\n s = input()\n if s in check:\n continue\n else:\n print(i+1)\n check[s] = True\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar prev: int :: 0\n\tvar map: dict<[]char, bool> :: #dict<[]char, bool>\n\tfor i(1, n)\n\t\tdo map.add(cui@input(), true)\n\t\tif(^map <> prev)\n\t\t\tdo prev :+ 1\n\t\t\tdo cui@print(\"\\{i}\\n\")\n\t\tend if\n\tend for\nend func\n" }, { "id": 184, "name": "028", "C++": "#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N;\n\nint lx[1 << 18], ly[1 << 18], rx[1 << 18], ry[1 << 18];\n\n\n\n// Count Number\n\nint cnt[1009][1009];\n\nint Answer[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> lx[i] >> ly[i] >> rx[i] >> ry[i];\n\n\n\n\t// Step #2. Imos Method in 2D\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcnt[lx[i]][ly[i]] += 1;\n\n\t\tcnt[lx[i]][ry[i]] -= 1;\n\n\t\tcnt[rx[i]][ly[i]] -= 1;\n\n\t\tcnt[rx[i]][ry[i]] += 1;\n\n\t}\n\n\tfor (int i = 0; i <= 1000; i++) {\n\n\t\tfor (int j = 1; j <= 1000; j++) cnt[i][j] += cnt[i][j - 1];\n\n\t}\n\n\tfor (int i = 1; i <= 1000; i++) {\n\n\t\tfor (int j = 0; j <= 1000; j++) cnt[i][j] += cnt[i - 1][j];\n\n\t}\n\n\n\n\t// Step #3. Count Number\n\n\tfor (int i = 0; i <= 1000; i++) {\n\n\t\tfor (int j = 0; j <= 1000; j++) {\n\n\t\t\tif (cnt[i][j] >= 1) Answer[cnt[i][j]] += 1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output The Answer\n\n\tfor (int i = 1; i <= N; i++) cout << Answer[i] << endl;\n\n\treturn 0;\n\n}", "Crystal": "MAX_X = 1000\nn = read_line.to_i\nimos = Array.new(MAX_X + 1) { Array.new(MAX_X + 1, 0) }\nn.times do\n lx, ly, rx, ry = read_line.split.map(&.to_i)\n imos[ly][lx] += 1\n imos[ly][rx] -= 1\n imos[ry][lx] -= 1\n imos[ry][rx] += 1\nend\n\n(0..MAX_X).each do |i|\n (1..MAX_X).each do |j|\n imos[i][j] += imos[i][j - 1]\n end\nend\n(1..MAX_X).each do |i|\n (0..MAX_X).each do |j|\n imos[i][j] += imos[i - 1][j]\n end\nend\n\ncnt = [0i64] * n.succ\n(0...MAX_X).each do |i|\n (0...MAX_X).each do |j|\n cnt[imos[i][j]] += 1\n end\nend\nputs cnt.skip(1).join('\\n')\n" }, { "id": 185, "name": "028", "C++": "#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N;\n\nint lx[1 << 18], ly[1 << 18], rx[1 << 18], ry[1 << 18];\n\n\n\n// Count Number\n\nint cnt[1009][1009];\n\nint Answer[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> lx[i] >> ly[i] >> rx[i] >> ry[i];\n\n\n\n\t// Step #2. Imos Method in 2D\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcnt[lx[i]][ly[i]] += 1;\n\n\t\tcnt[lx[i]][ry[i]] -= 1;\n\n\t\tcnt[rx[i]][ly[i]] -= 1;\n\n\t\tcnt[rx[i]][ry[i]] += 1;\n\n\t}\n\n\tfor (int i = 0; i <= 1000; i++) {\n\n\t\tfor (int j = 1; j <= 1000; j++) cnt[i][j] += cnt[i][j - 1];\n\n\t}\n\n\tfor (int i = 1; i <= 1000; i++) {\n\n\t\tfor (int j = 0; j <= 1000; j++) cnt[i][j] += cnt[i - 1][j];\n\n\t}\n\n\n\n\t// Step #3. Count Number\n\n\tfor (int i = 0; i <= 1000; i++) {\n\n\t\tfor (int j = 0; j <= 1000; j++) {\n\n\t\t\tif (cnt[i][j] >= 1) Answer[cnt[i][j]] += 1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output The Answer\n\n\tfor (int i = 1; i <= N; i++) cout << Answer[i] << endl;\n\n\treturn 0;\n\n}", "Python": "import numpy\n\nfrom sys import stdin\n\nmax_x = max_y = 1000\n\nN = int(stdin.readline())\n\nA = numpy.zeros(shape=(max_x + 1, max_y + 1), dtype=int)\n\nfor i in range(N):\n\tlx, ly, rx, ry = map(int, stdin.readline().split(' '))\n\tA[lx, ly] += 1\n\tA[rx, ly] -= 1\n\tA[lx, ry] -= 1\n\tA[rx, ry] += 1\n\nA.cumsum(axis=0, out=A)\nA.cumsum(axis=1, out=A)\n\ncounts = numpy.bincount(A.flatten(), minlength=N+1)\n\nprint(\"\\n\".join(map(str, counts[1:])))\n# for count in counts[1:]:\n# \tprint(count)\n" }, { "id": 186, "name": "028", "C++": "#include \n\nusing namespace std;\n\n\n\n// Input\n\nint N;\n\nint lx[1 << 18], ly[1 << 18], rx[1 << 18], ry[1 << 18];\n\n\n\n// Count Number\n\nint cnt[1009][1009];\n\nint Answer[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> lx[i] >> ly[i] >> rx[i] >> ry[i];\n\n\n\n\t// Step #2. Imos Method in 2D\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcnt[lx[i]][ly[i]] += 1;\n\n\t\tcnt[lx[i]][ry[i]] -= 1;\n\n\t\tcnt[rx[i]][ly[i]] -= 1;\n\n\t\tcnt[rx[i]][ry[i]] += 1;\n\n\t}\n\n\tfor (int i = 0; i <= 1000; i++) {\n\n\t\tfor (int j = 1; j <= 1000; j++) cnt[i][j] += cnt[i][j - 1];\n\n\t}\n\n\tfor (int i = 1; i <= 1000; i++) {\n\n\t\tfor (int j = 0; j <= 1000; j++) cnt[i][j] += cnt[i - 1][j];\n\n\t}\n\n\n\n\t// Step #3. Count Number\n\n\tfor (int i = 0; i <= 1000; i++) {\n\n\t\tfor (int j = 0; j <= 1000; j++) {\n\n\t\t\tif (cnt[i][j] >= 1) Answer[cnt[i][j]] += 1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. Output The Answer\n\n\tfor (int i = 1; i <= N; i++) cout << Answer[i] << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tconst max: int :: 1000\n\tvar cum2d: [][]int :: #[max + 1, max + 1]int\n\tfor(1, n)\n\t\tvar lx: int :: cui@inputInt()\n\t\tvar ly: int :: cui@inputInt()\n\t\tvar rx: int :: cui@inputInt()\n\t\tvar ry: int :: cui@inputInt()\n\t\tdo cum2d[ry][rx] :+ 1\n\t\tdo cum2d[ry][lx] :- 1\n\t\tdo cum2d[ly][rx] :- 1\n\t\tdo cum2d[ly][lx] :+ 1\n\tend for\n\t\n\tfor y(0, max - 1)\n\t\tfor x(1, max - 1)\n\t\t\tdo cum2d[y][x] :+ cum2d[y][x - 1]\n\t\tend for\n\tend for\n\tfor x(0, max - 1)\n\t\tfor y(1, max - 1)\n\t\t\tdo cum2d[y][x] :+ cum2d[y - 1][x]\n\t\tend for\n\tend for\n\t\n\tvar ans: []int :: #[n + 1]int\n\tfor y(0, max - 1)\n\t\tfor x(0, max - 1)\n\t\t\tdo ans[cum2d[y][x]] :+ 1\n\t\tend for\n\tend for\n\t\n\tfor k(1, n)\n\t\tdo cui@print(\"\\{ans[k]}\\n\")\n\tend for\nend func\n" }, { "id": 187, "name": "028", "Crystal": "MAX_X = 1000\nn = read_line.to_i\nimos = Array.new(MAX_X + 1) { Array.new(MAX_X + 1, 0) }\nn.times do\n lx, ly, rx, ry = read_line.split.map(&.to_i)\n imos[ly][lx] += 1\n imos[ly][rx] -= 1\n imos[ry][lx] -= 1\n imos[ry][rx] += 1\nend\n\n(0..MAX_X).each do |i|\n (1..MAX_X).each do |j|\n imos[i][j] += imos[i][j - 1]\n end\nend\n(1..MAX_X).each do |i|\n (0..MAX_X).each do |j|\n imos[i][j] += imos[i - 1][j]\n end\nend\n\ncnt = [0i64] * n.succ\n(0...MAX_X).each do |i|\n (0...MAX_X).each do |j|\n cnt[imos[i][j]] += 1\n end\nend\nputs cnt.skip(1).join('\\n')\n", "Python": "import numpy\n\nfrom sys import stdin\n\nmax_x = max_y = 1000\n\nN = int(stdin.readline())\n\nA = numpy.zeros(shape=(max_x + 1, max_y + 1), dtype=int)\n\nfor i in range(N):\n\tlx, ly, rx, ry = map(int, stdin.readline().split(' '))\n\tA[lx, ly] += 1\n\tA[rx, ly] -= 1\n\tA[lx, ry] -= 1\n\tA[rx, ry] += 1\n\nA.cumsum(axis=0, out=A)\nA.cumsum(axis=1, out=A)\n\ncounts = numpy.bincount(A.flatten(), minlength=N+1)\n\nprint(\"\\n\".join(map(str, counts[1:])))\n# for count in counts[1:]:\n# \tprint(count)\n" }, { "id": 188, "name": "028", "Crystal": "MAX_X = 1000\nn = read_line.to_i\nimos = Array.new(MAX_X + 1) { Array.new(MAX_X + 1, 0) }\nn.times do\n lx, ly, rx, ry = read_line.split.map(&.to_i)\n imos[ly][lx] += 1\n imos[ly][rx] -= 1\n imos[ry][lx] -= 1\n imos[ry][rx] += 1\nend\n\n(0..MAX_X).each do |i|\n (1..MAX_X).each do |j|\n imos[i][j] += imos[i][j - 1]\n end\nend\n(1..MAX_X).each do |i|\n (0..MAX_X).each do |j|\n imos[i][j] += imos[i - 1][j]\n end\nend\n\ncnt = [0i64] * n.succ\n(0...MAX_X).each do |i|\n (0...MAX_X).each do |j|\n cnt[imos[i][j]] += 1\n end\nend\nputs cnt.skip(1).join('\\n')\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tconst max: int :: 1000\n\tvar cum2d: [][]int :: #[max + 1, max + 1]int\n\tfor(1, n)\n\t\tvar lx: int :: cui@inputInt()\n\t\tvar ly: int :: cui@inputInt()\n\t\tvar rx: int :: cui@inputInt()\n\t\tvar ry: int :: cui@inputInt()\n\t\tdo cum2d[ry][rx] :+ 1\n\t\tdo cum2d[ry][lx] :- 1\n\t\tdo cum2d[ly][rx] :- 1\n\t\tdo cum2d[ly][lx] :+ 1\n\tend for\n\t\n\tfor y(0, max - 1)\n\t\tfor x(1, max - 1)\n\t\t\tdo cum2d[y][x] :+ cum2d[y][x - 1]\n\t\tend for\n\tend for\n\tfor x(0, max - 1)\n\t\tfor y(1, max - 1)\n\t\t\tdo cum2d[y][x] :+ cum2d[y - 1][x]\n\t\tend for\n\tend for\n\t\n\tvar ans: []int :: #[n + 1]int\n\tfor y(0, max - 1)\n\t\tfor x(0, max - 1)\n\t\t\tdo ans[cum2d[y][x]] :+ 1\n\t\tend for\n\tend for\n\t\n\tfor k(1, n)\n\t\tdo cui@print(\"\\{ans[k]}\\n\")\n\tend for\nend func\n" }, { "id": 189, "name": "028", "Python": "import numpy\n\nfrom sys import stdin\n\nmax_x = max_y = 1000\n\nN = int(stdin.readline())\n\nA = numpy.zeros(shape=(max_x + 1, max_y + 1), dtype=int)\n\nfor i in range(N):\n\tlx, ly, rx, ry = map(int, stdin.readline().split(' '))\n\tA[lx, ly] += 1\n\tA[rx, ly] -= 1\n\tA[lx, ry] -= 1\n\tA[rx, ry] += 1\n\nA.cumsum(axis=0, out=A)\nA.cumsum(axis=1, out=A)\n\ncounts = numpy.bincount(A.flatten(), minlength=N+1)\n\nprint(\"\\n\".join(map(str, counts[1:])))\n# for count in counts[1:]:\n# \tprint(count)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tconst max: int :: 1000\n\tvar cum2d: [][]int :: #[max + 1, max + 1]int\n\tfor(1, n)\n\t\tvar lx: int :: cui@inputInt()\n\t\tvar ly: int :: cui@inputInt()\n\t\tvar rx: int :: cui@inputInt()\n\t\tvar ry: int :: cui@inputInt()\n\t\tdo cum2d[ry][rx] :+ 1\n\t\tdo cum2d[ry][lx] :- 1\n\t\tdo cum2d[ly][rx] :- 1\n\t\tdo cum2d[ly][lx] :+ 1\n\tend for\n\t\n\tfor y(0, max - 1)\n\t\tfor x(1, max - 1)\n\t\t\tdo cum2d[y][x] :+ cum2d[y][x - 1]\n\t\tend for\n\tend for\n\tfor x(0, max - 1)\n\t\tfor y(1, max - 1)\n\t\t\tdo cum2d[y][x] :+ cum2d[y - 1][x]\n\t\tend for\n\tend for\n\t\n\tvar ans: []int :: #[n + 1]int\n\tfor y(0, max - 1)\n\t\tfor x(0, max - 1)\n\t\t\tdo ans[cum2d[y][x]] :+ 1\n\t\tend for\n\tend for\n\t\n\tfor k(1, n)\n\t\tdo cui@print(\"\\{ans[k]}\\n\")\n\tend for\nend func\n" }, { "id": 190, "name": "029", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nclass segment_tree {\n\nprivate:\n\n\tint sz;\n\n\tstd::vector seg;\n\n\tstd::vector lazy;\n\n\tvoid push(int k) {\n\n\t\tif (k < sz) {\n\n\t\t\tlazy[k * 2] = max(lazy[k * 2], lazy[k]);\n\n\t\t\tlazy[k * 2 + 1] = max(lazy[k * 2 + 1], lazy[k]);\n\n\t\t}\n\n\t\tseg[k] = max(seg[k], lazy[k]);\n\n\t\tlazy[k] = 0;\n\n\t}\n\n\tvoid update(int a, int b, int x, int k, int l, int r) {\n\n\t\tpush(k);\n\n\t\tif (r <= a || b <= l) return;\n\n\t\tif (a <= l && r <= b) {\n\n\t\t\tlazy[k] = x;\n\n\t\t\tpush(k);\n\n\t\t\treturn;\n\n\t\t}\n\n\t\tupdate(a, b, x, k * 2, l, (l + r) >> 1);\n\n\t\tupdate(a, b, x, k * 2 + 1, (l + r) >> 1, r);\n\n\t\tseg[k] = max(seg[k * 2], seg[k * 2 + 1]);\n\n\t}\n\n\tint range_max(int a, int b, int k, int l, int r) {\n\n\t\tpush(k);\n\n\t\tif (r <= a || b <= l) return 0;\n\n\t\tif (a <= l && r <= b) return seg[k];\n\n\t\tint lc = range_max(a, b, k * 2, l, (l + r) >> 1);\n\n\t\tint rc = range_max(a, b, k * 2 + 1, (l + r) >> 1, r);\n\n\t\treturn max(lc, rc);\n\n\t}\n\npublic:\n\n\tsegment_tree() : sz(0), seg(), lazy() {};\n\n\tsegment_tree(int N) {\n\n\t\tsz = 1;\n\n\t\twhile (sz < N) {\n\n\t\t\tsz *= 2;\n\n\t\t}\n\n\t\tseg = std::vector(sz * 2, 0);\n\n\t\tlazy = std::vector(sz * 2, 0);\n\n\t}\n\n\tvoid update(int l, int r, int x) {\n\n\t\tupdate(l, r, x, 1, 0, sz);\n\n\t}\n\n\tint range_max(int l, int r) {\n\n\t\treturn range_max(l, r, 1, 0, sz);\n\n\t}\n\n};\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint W, N;\n\n\tcin >> W >> N;\n\n\tsegment_tree seg(W);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint L, R;\n\n\t\tcin >> L >> R;\n\n\t\tint height = seg.range_max(L - 1, R) + 1;\n\n\t\tseg.update(L - 1, R, height);\n\n\t\tcout << height << '\\n';\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::lazy_segtree](https://atcoder.github.io/ac-library/master/document_en/lazysegtree.html).\n #\n # The identity element will be implicitly defined as nil, so you don't\n # have to manually define it. In the other words, you cannot include\n # nil into an element of the monoid.\n #\n # Similarly, the identity map of F will be implicitly defined as nil,\n # so you don't have to manually define it. In the other words, you\n # cannot include nil into an element of the set F.\n #\n # ```\n # op = ->(a : Int32, b : Int32) { [a, b].min }\n # mapping = ->(f : Int32, x : Int32) { f }\n # composition = ->(a : Int32, b : Int32) { a }\n # tree = AtCoder::LazySegTree(Int32, Int32).new((0...100).to_a, op, mapping, composition)\n # tree[10...50] # => 10\n # tree[20...60] = 0\n # tree[50...80] # => 0\n # ```\n class LazySegTree(S, F)\n getter values : Array(S | Nil)\n\n def initialize(values : Array(S), @operator : S, S -> S, @application : F, S -> S, @composition : F, F -> F)\n @values = values.map { |v| v.as(S | Nil) }\n segment_size = 2 ** ::Math.log2(@values.size).ceil.to_i - 1\n @segments = Array(S | Nil).new(segment_size, nil)\n @applicators = Array(F | Nil).new(segment_size, nil)\n\n # initialize segments\n (@segments.size - 1).downto(0) do |i|\n child1 = nil.as(S | Nil)\n child2 = nil.as(S | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n end\n end\n\n # FIXME: Unimplemented\n def set\n raise NotImplementedError.new\n end\n\n # Implements atcoder::lazy_segtree.apply(index, applicator).\n def []=(index : Int, applicator : F)\n apply_range(index, index + 1, applicator, 0, 0...(@segments.size + 1))\n end\n\n # Implements atcoder::lazy_segtree.apply(left, right, applicator).\n def []=(range : Range(Int, Int), applicator : F)\n l = range.begin\n r = range.exclusive? ? range.end : range.end + 1\n apply_range(l, r, applicator, 0, 0...(@segments.size + 1))\n end\n\n # Implements atcoder::lazy_segtree.get(index).\n def [](index : Int)\n get_range(index, index + 1, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n # Implements atcoder::lazy_segtree.prod(left, right).\n def [](range : Range(Int, Int))\n l = range.begin\n r = range.exclusive? ? range.end : range.end + 1\n get_range(l, r, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n @[AlwaysInline]\n private def operate(a : S | Nil, b : S | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @operator.call(a, b)\n end\n end\n\n @[AlwaysInline]\n private def apply(f : F | Nil, x : S | Nil)\n if f.nil?\n x\n elsif x.nil?\n nil\n else\n @application.call(f, x)\n end\n end\n\n @[AlwaysInline]\n private def compose(a : F | Nil, b : F | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @composition.call(a, b)\n end\n end\n\n # Evaluates segment, whose range is `range`. `range` is exclusive here.\n #\n # Preconditions:\n # * segment_index < @segments.size\n # * range.end - range.begin > 1\n def eval_segment(segment_index : Int, range : Range(Int, Int))\n applicator = @applicators[segment_index]\n return if applicator.nil?\n\n @segments[segment_index] = apply(applicator, @segments[segment_index])\n\n if range.end - range.begin > 2\n @applicators[segment_index * 2 + 1] = compose(applicator, @applicators[segment_index * 2 + 1])\n @applicators[segment_index * 2 + 2] = compose(applicator, @applicators[segment_index * 2 + 2])\n else\n @values[segment_index * 2 + 1 - @segments.size] = apply(applicator, @values[segment_index * 2 + 1 - @segments.size])\n @values[segment_index * 2 + 2 - @segments.size] = apply(applicator, @values[segment_index * 2 + 2 - @segments.size])\n end\n\n @applicators[segment_index] = nil\n end\n\n # Applies applicator `f` onto segment, whose range is `range`. `range` is exclusive here.\n def apply_range(a : Int, b : Int, f : F, segment_index : Int, range : Range(Int, Int))\n if segment_index >= @segments.size + @values.size\n return nil\n end\n\n if segment_index < @segments.size\n eval_segment(segment_index, range)\n end\n\n if range.end <= a || b <= range.begin\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n @applicators[segment_index] = compose(@applicators[segment_index], f)\n eval_segment(segment_index, range)\n return @segments[segment_index]\n else\n @values[segment_index - @segments.size] = apply(f, @values[segment_index - @segments.size])\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = apply_range(a, b, f, segment_index * 2 + 1, range.begin...range_median)\n child2 = apply_range(a, b, f, segment_index * 2 + 2, range_median...range.end)\n\n @segments[segment_index] = operate(child1, child2)\n @segments[segment_index]\n end\n\n # Gets evaluated value of a segment, whose range is `range`. `range` is exclusive here.\n def get_range(a : Int, b : Int, segment_index : Int, range : Range(Int, Int))\n if range.end <= a || b <= range.begin\n return nil\n end\n\n if segment_index < @segments.size\n eval_segment(segment_index, range)\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = get_range(a, b, segment_index * 2 + 1, range.begin...range_median)\n child2 = get_range(a, b, segment_index * 2 + 2, range_median...range.end)\n\n operate(child1, child2)\n end\n\n # Implements atcoder::lazy_segtree.all_prod().\n def all_prod\n self[0...@values.size]\n end\n\n # FIXME: Unimplemented\n def max_right\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def max_left\n raise NotImplementedError.new\n end\n end\nend\n\nop = ->(x : Int32, y : Int32) { {x, y}.max }\nmapping = ->(f : Int32, _s : Int32) { f }\ncomposition = ->(f : Int32, _g : Int32) { f }\n\nw, n = read_line.split.map(&.to_i)\nseg = AtCoder::LazySegTree(Int32, Int32).new([0] * w, op, mapping, composition)\nn.times do\n l, r = read_line.split.map(&.to_i.pred)\n height = seg[l..r] + 1\n puts height\n seg[l..r] = height\nend\n" }, { "id": 191, "name": "029", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nclass segment_tree {\n\nprivate:\n\n\tint sz;\n\n\tstd::vector seg;\n\n\tstd::vector lazy;\n\n\tvoid push(int k) {\n\n\t\tif (k < sz) {\n\n\t\t\tlazy[k * 2] = max(lazy[k * 2], lazy[k]);\n\n\t\t\tlazy[k * 2 + 1] = max(lazy[k * 2 + 1], lazy[k]);\n\n\t\t}\n\n\t\tseg[k] = max(seg[k], lazy[k]);\n\n\t\tlazy[k] = 0;\n\n\t}\n\n\tvoid update(int a, int b, int x, int k, int l, int r) {\n\n\t\tpush(k);\n\n\t\tif (r <= a || b <= l) return;\n\n\t\tif (a <= l && r <= b) {\n\n\t\t\tlazy[k] = x;\n\n\t\t\tpush(k);\n\n\t\t\treturn;\n\n\t\t}\n\n\t\tupdate(a, b, x, k * 2, l, (l + r) >> 1);\n\n\t\tupdate(a, b, x, k * 2 + 1, (l + r) >> 1, r);\n\n\t\tseg[k] = max(seg[k * 2], seg[k * 2 + 1]);\n\n\t}\n\n\tint range_max(int a, int b, int k, int l, int r) {\n\n\t\tpush(k);\n\n\t\tif (r <= a || b <= l) return 0;\n\n\t\tif (a <= l && r <= b) return seg[k];\n\n\t\tint lc = range_max(a, b, k * 2, l, (l + r) >> 1);\n\n\t\tint rc = range_max(a, b, k * 2 + 1, (l + r) >> 1, r);\n\n\t\treturn max(lc, rc);\n\n\t}\n\npublic:\n\n\tsegment_tree() : sz(0), seg(), lazy() {};\n\n\tsegment_tree(int N) {\n\n\t\tsz = 1;\n\n\t\twhile (sz < N) {\n\n\t\t\tsz *= 2;\n\n\t\t}\n\n\t\tseg = std::vector(sz * 2, 0);\n\n\t\tlazy = std::vector(sz * 2, 0);\n\n\t}\n\n\tvoid update(int l, int r, int x) {\n\n\t\tupdate(l, r, x, 1, 0, sz);\n\n\t}\n\n\tint range_max(int l, int r) {\n\n\t\treturn range_max(l, r, 1, 0, sz);\n\n\t}\n\n};\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint W, N;\n\n\tcin >> W >> N;\n\n\tsegment_tree seg(W);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint L, R;\n\n\t\tcin >> L >> R;\n\n\t\tint height = seg.range_max(L - 1, R) + 1;\n\n\t\tseg.update(L - 1, R, height);\n\n\t\tcout << height << '\\n';\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar w: int :: cui@inputInt()\n\tvar n: int :: cui@inputInt()\n\tvar segmentTree: @SegmentTree :: (#@SegmentTree).init(w)\n\tdo segmentTree.updateRange(0, w, 0)\n\tfor(1, n)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt()\n\t\tvar ans: int :: -segmentTree.query(l, r) + 1\n\t\tdo cui@print(\"\\{ans}\\n\")\n\t\tdo segmentTree.updateRange(l, r, -ans)\n\tend for\nend func\n\nclass SegmentTree()\n\tconst inf_: int :: lib@intMax\n\tvar size: int\n\tvar node: []int\n\tvar lasy: []int\n\t+func init(n: int): SegmentTree\n\t\tdo me.size :: 1\n\t\twhile(me.size < n)\n\t\t\tdo me.size :* 2\n\t\tend while\n\t\tdo me.node :: [inf_].repeat(2 * me.size)\n\t\tdo me.lasy :: ##me.node\n\t\tret me\n\tend func\n\tfunc eval(k: int)\n\t\tif(me.lasy[k] = inf_)\n\t\t\tret\n\t\tend if\n\t\tif(k < me.size - 1)\n\t\t\tdo me.lasy[k * 2 + 1] :: me.lasy[k]\n\t\t\tdo me.lasy[k * 2 + 2] :: me.lasy[k]\n\t\tend if\n\t\tdo me.node[k] :: me.lasy[k]\n\t\tdo me.lasy[k] :: inf_\n\tend func\n\t+func update(idx: int, val: int)\n\t\tdo me.updateRange(idx, idx + 1, val)\n\tend func\n\t+func updateRange(a: int, b: int, val: int)\n\t\tdo me.updateRangeSub(a, b, val, 0, 0, me.size)\n\tend func\n\t+func updateRangeSub(a: int, b: int, val: int, k: int, l: int, r: int)\n\t\tdo me.eval(k)\n\t\tif(a <= l & r <= b)\n\t\t\tdo me.lasy[k] :: val\n\t\t\tdo me.eval(k)\n\t\telif(a < r & l < b)\n\t\t\tdo me.updateRangeSub(a, b, val, k * 2 + 1, l, (l + r) / 2)\n\t\t\tdo me.updateRangeSub(a, b, val, k * 2 + 2, (l + r) / 2, r)\n\t\t\tdo me.node[k] :: lib@min(me.node[k * 2 + 1], me.node[k * 2 + 2])\n\t\tend if\n\tend func\n\t+func query(a: int, b: int): int\n\t\tret me.querySub(a, b, 0, 0, me.size)\n\tend func\n\tfunc querySub(a: int, b: int, k: int, l: int, r: int): int\n\t\tdo me.eval(k)\n\t\tif(b <= l | r <= a)\n\t\t\tret inf_\n\t\tend if\n\t\tif(a <= l & r <= b)\n\t\t\tret me.node[k]\n\t\tend if\n\t\tvar vl: int :: me.querySub(a, b, 2 * k + 1, l, (l + r) / 2)\n\t\tvar vr: int :: me.querySub(a, b, 2 * k + 2, (l + r) / 2, r)\n\t\tret lib@min(vl, vr)\n\tend func\n\t+*func toStr(): []char\n\t\tvar padding: int :: 1\n\t\twhile(padding <= me.size)\n\t\t\tdo padding :* 2\n\t\tend while\n\t\tdo padding :- 1\n\t\tvar res: []char :: \"\"\n\t\tvar s: int :: 0\n\t\tvar e: int :: 0\n\t\tvar n: int :: 1\n\t\tconst digit: int :: 6\n\t\tvar fmt: []char :: \" \\{digit}d\"\n\t\tvar strInf: []char :: \" \".repeat(digit - 3) ~ \"inf\"\n\t\twhile(padding > 0)\n\t\t\tdo padding :/ 2\n\t\t\tfor i(s, e)\n\t\t\t\tdo res :~ \" \".repeat((digit + 1) * padding)\n\t\t\t\tdo res :~ \"\\{me.node[i] = inf_ ?(strInf, me.node[i].toStrFmt(fmt))}|\"\n\t\t\tend for\n\t\t\tdo res :~ \"\\n\"\n\t\t\tdo n :* 2\n\t\t\tdo s :: e + 1\n\t\t\tdo e :: s + n - 1\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 192, "name": "029", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::lazy_segtree](https://atcoder.github.io/ac-library/master/document_en/lazysegtree.html).\n #\n # The identity element will be implicitly defined as nil, so you don't\n # have to manually define it. In the other words, you cannot include\n # nil into an element of the monoid.\n #\n # Similarly, the identity map of F will be implicitly defined as nil,\n # so you don't have to manually define it. In the other words, you\n # cannot include nil into an element of the set F.\n #\n # ```\n # op = ->(a : Int32, b : Int32) { [a, b].min }\n # mapping = ->(f : Int32, x : Int32) { f }\n # composition = ->(a : Int32, b : Int32) { a }\n # tree = AtCoder::LazySegTree(Int32, Int32).new((0...100).to_a, op, mapping, composition)\n # tree[10...50] # => 10\n # tree[20...60] = 0\n # tree[50...80] # => 0\n # ```\n class LazySegTree(S, F)\n getter values : Array(S | Nil)\n\n def initialize(values : Array(S), @operator : S, S -> S, @application : F, S -> S, @composition : F, F -> F)\n @values = values.map { |v| v.as(S | Nil) }\n segment_size = 2 ** ::Math.log2(@values.size).ceil.to_i - 1\n @segments = Array(S | Nil).new(segment_size, nil)\n @applicators = Array(F | Nil).new(segment_size, nil)\n\n # initialize segments\n (@segments.size - 1).downto(0) do |i|\n child1 = nil.as(S | Nil)\n child2 = nil.as(S | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n end\n end\n\n # FIXME: Unimplemented\n def set\n raise NotImplementedError.new\n end\n\n # Implements atcoder::lazy_segtree.apply(index, applicator).\n def []=(index : Int, applicator : F)\n apply_range(index, index + 1, applicator, 0, 0...(@segments.size + 1))\n end\n\n # Implements atcoder::lazy_segtree.apply(left, right, applicator).\n def []=(range : Range(Int, Int), applicator : F)\n l = range.begin\n r = range.exclusive? ? range.end : range.end + 1\n apply_range(l, r, applicator, 0, 0...(@segments.size + 1))\n end\n\n # Implements atcoder::lazy_segtree.get(index).\n def [](index : Int)\n get_range(index, index + 1, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n # Implements atcoder::lazy_segtree.prod(left, right).\n def [](range : Range(Int, Int))\n l = range.begin\n r = range.exclusive? ? range.end : range.end + 1\n get_range(l, r, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n @[AlwaysInline]\n private def operate(a : S | Nil, b : S | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @operator.call(a, b)\n end\n end\n\n @[AlwaysInline]\n private def apply(f : F | Nil, x : S | Nil)\n if f.nil?\n x\n elsif x.nil?\n nil\n else\n @application.call(f, x)\n end\n end\n\n @[AlwaysInline]\n private def compose(a : F | Nil, b : F | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @composition.call(a, b)\n end\n end\n\n # Evaluates segment, whose range is `range`. `range` is exclusive here.\n #\n # Preconditions:\n # * segment_index < @segments.size\n # * range.end - range.begin > 1\n def eval_segment(segment_index : Int, range : Range(Int, Int))\n applicator = @applicators[segment_index]\n return if applicator.nil?\n\n @segments[segment_index] = apply(applicator, @segments[segment_index])\n\n if range.end - range.begin > 2\n @applicators[segment_index * 2 + 1] = compose(applicator, @applicators[segment_index * 2 + 1])\n @applicators[segment_index * 2 + 2] = compose(applicator, @applicators[segment_index * 2 + 2])\n else\n @values[segment_index * 2 + 1 - @segments.size] = apply(applicator, @values[segment_index * 2 + 1 - @segments.size])\n @values[segment_index * 2 + 2 - @segments.size] = apply(applicator, @values[segment_index * 2 + 2 - @segments.size])\n end\n\n @applicators[segment_index] = nil\n end\n\n # Applies applicator `f` onto segment, whose range is `range`. `range` is exclusive here.\n def apply_range(a : Int, b : Int, f : F, segment_index : Int, range : Range(Int, Int))\n if segment_index >= @segments.size + @values.size\n return nil\n end\n\n if segment_index < @segments.size\n eval_segment(segment_index, range)\n end\n\n if range.end <= a || b <= range.begin\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n @applicators[segment_index] = compose(@applicators[segment_index], f)\n eval_segment(segment_index, range)\n return @segments[segment_index]\n else\n @values[segment_index - @segments.size] = apply(f, @values[segment_index - @segments.size])\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = apply_range(a, b, f, segment_index * 2 + 1, range.begin...range_median)\n child2 = apply_range(a, b, f, segment_index * 2 + 2, range_median...range.end)\n\n @segments[segment_index] = operate(child1, child2)\n @segments[segment_index]\n end\n\n # Gets evaluated value of a segment, whose range is `range`. `range` is exclusive here.\n def get_range(a : Int, b : Int, segment_index : Int, range : Range(Int, Int))\n if range.end <= a || b <= range.begin\n return nil\n end\n\n if segment_index < @segments.size\n eval_segment(segment_index, range)\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = get_range(a, b, segment_index * 2 + 1, range.begin...range_median)\n child2 = get_range(a, b, segment_index * 2 + 2, range_median...range.end)\n\n operate(child1, child2)\n end\n\n # Implements atcoder::lazy_segtree.all_prod().\n def all_prod\n self[0...@values.size]\n end\n\n # FIXME: Unimplemented\n def max_right\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def max_left\n raise NotImplementedError.new\n end\n end\nend\n\nop = ->(x : Int32, y : Int32) { {x, y}.max }\nmapping = ->(f : Int32, _s : Int32) { f }\ncomposition = ->(f : Int32, _g : Int32) { f }\n\nw, n = read_line.split.map(&.to_i)\nseg = AtCoder::LazySegTree(Int32, Int32).new([0] * w, op, mapping, composition)\nn.times do\n l, r = read_line.split.map(&.to_i.pred)\n height = seg[l..r] + 1\n puts height\n seg[l..r] = height\nend\n", "Kuin": "func main()\n\tvar w: int :: cui@inputInt()\n\tvar n: int :: cui@inputInt()\n\tvar segmentTree: @SegmentTree :: (#@SegmentTree).init(w)\n\tdo segmentTree.updateRange(0, w, 0)\n\tfor(1, n)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt()\n\t\tvar ans: int :: -segmentTree.query(l, r) + 1\n\t\tdo cui@print(\"\\{ans}\\n\")\n\t\tdo segmentTree.updateRange(l, r, -ans)\n\tend for\nend func\n\nclass SegmentTree()\n\tconst inf_: int :: lib@intMax\n\tvar size: int\n\tvar node: []int\n\tvar lasy: []int\n\t+func init(n: int): SegmentTree\n\t\tdo me.size :: 1\n\t\twhile(me.size < n)\n\t\t\tdo me.size :* 2\n\t\tend while\n\t\tdo me.node :: [inf_].repeat(2 * me.size)\n\t\tdo me.lasy :: ##me.node\n\t\tret me\n\tend func\n\tfunc eval(k: int)\n\t\tif(me.lasy[k] = inf_)\n\t\t\tret\n\t\tend if\n\t\tif(k < me.size - 1)\n\t\t\tdo me.lasy[k * 2 + 1] :: me.lasy[k]\n\t\t\tdo me.lasy[k * 2 + 2] :: me.lasy[k]\n\t\tend if\n\t\tdo me.node[k] :: me.lasy[k]\n\t\tdo me.lasy[k] :: inf_\n\tend func\n\t+func update(idx: int, val: int)\n\t\tdo me.updateRange(idx, idx + 1, val)\n\tend func\n\t+func updateRange(a: int, b: int, val: int)\n\t\tdo me.updateRangeSub(a, b, val, 0, 0, me.size)\n\tend func\n\t+func updateRangeSub(a: int, b: int, val: int, k: int, l: int, r: int)\n\t\tdo me.eval(k)\n\t\tif(a <= l & r <= b)\n\t\t\tdo me.lasy[k] :: val\n\t\t\tdo me.eval(k)\n\t\telif(a < r & l < b)\n\t\t\tdo me.updateRangeSub(a, b, val, k * 2 + 1, l, (l + r) / 2)\n\t\t\tdo me.updateRangeSub(a, b, val, k * 2 + 2, (l + r) / 2, r)\n\t\t\tdo me.node[k] :: lib@min(me.node[k * 2 + 1], me.node[k * 2 + 2])\n\t\tend if\n\tend func\n\t+func query(a: int, b: int): int\n\t\tret me.querySub(a, b, 0, 0, me.size)\n\tend func\n\tfunc querySub(a: int, b: int, k: int, l: int, r: int): int\n\t\tdo me.eval(k)\n\t\tif(b <= l | r <= a)\n\t\t\tret inf_\n\t\tend if\n\t\tif(a <= l & r <= b)\n\t\t\tret me.node[k]\n\t\tend if\n\t\tvar vl: int :: me.querySub(a, b, 2 * k + 1, l, (l + r) / 2)\n\t\tvar vr: int :: me.querySub(a, b, 2 * k + 2, (l + r) / 2, r)\n\t\tret lib@min(vl, vr)\n\tend func\n\t+*func toStr(): []char\n\t\tvar padding: int :: 1\n\t\twhile(padding <= me.size)\n\t\t\tdo padding :* 2\n\t\tend while\n\t\tdo padding :- 1\n\t\tvar res: []char :: \"\"\n\t\tvar s: int :: 0\n\t\tvar e: int :: 0\n\t\tvar n: int :: 1\n\t\tconst digit: int :: 6\n\t\tvar fmt: []char :: \" \\{digit}d\"\n\t\tvar strInf: []char :: \" \".repeat(digit - 3) ~ \"inf\"\n\t\twhile(padding > 0)\n\t\t\tdo padding :/ 2\n\t\t\tfor i(s, e)\n\t\t\t\tdo res :~ \" \".repeat((digit + 1) * padding)\n\t\t\t\tdo res :~ \"\\{me.node[i] = inf_ ?(strInf, me.node[i].toStrFmt(fmt))}|\"\n\t\t\tend for\n\t\t\tdo res :~ \"\\n\"\n\t\t\tdo n :* 2\n\t\t\tdo s :: e + 1\n\t\t\tdo e :: s + n - 1\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 193, "name": "030", "C++": "#include \n\nusing namespace std;\n\n\n\nint N, K;\n\nint cnt[1 << 24];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> K;\n\n\n\n\t// Step #2. Count Number\n\n\tfor (int i = 2; i <= N; i++) {\n\n\t\tif (cnt[i] >= 1) continue;\n\n\t\tfor (int j = i; j <= N; j += i) cnt[j] += 1;\n\n\t}\n\n\n\n\t// Step #3. Get Answer\n\n\tint Answer = 0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (cnt[i] >= K) Answer += 1;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "n, k = read_line.split.map(&.to_i)\ncnt = [0] * n.succ\n(2..n).each do |x|\n next if cnt[x] != 0\n x.step(to: n, by: x) { |y|\n cnt[y] += 1\n }\nend\nputs cnt.count { |x| x >= k }\n" }, { "id": 194, "name": "030", "C++": "#include \n\nusing namespace std;\n\n\n\nint N, K;\n\nint cnt[1 << 24];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> K;\n\n\n\n\t// Step #2. Count Number\n\n\tfor (int i = 2; i <= N; i++) {\n\n\t\tif (cnt[i] >= 1) continue;\n\n\t\tfor (int j = i; j <= N; j += i) cnt[j] += 1;\n\n\t}\n\n\n\n\t// Step #3. Get Answer\n\n\tint Answer = 0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (cnt[i] >= K) Answer += 1;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar isPrime: []bool :: sieve(n)\n\tvar a: []int :: #[n + 1]int\n\tfor i(2, n)\n\t\tif(isPrime[i])\n\t\t\tvar j: int :: i\n\t\t\twhile(j <= n)\n\t\t\t\tdo a[j] :+ 1\n\t\t\t\tdo j :+ i\n\t\t\tend while\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(2, n)\n\t\tif(a[i] >= k)\n\t\t\tdo ans :+ 1\n\t\tend if\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc sieve(n: int): []bool\n\t\tif(n < 2)\n\t\t\tret[false].repeat(n + 1)\n\t\tend if\n\t\tvar isPrime: []bool :: [true].repeat(n + 1)\n\t\tdo isPrime[0] :: false\n\t\tdo isPrime[1] :: false\n\t\tfor i(2, n)\n\t\t\tif(isPrime[i])\n\t\t\t\tvar j: int :: i * i\n\t\t\t\twhile(j <= n)\n\t\t\t\t\tdo isPrime[j] :: false\n\t\t\t\t\tdo j :+ i\n\t\t\t\tend while\n\t\t\tend if\n\t\tend for\n\t\tret isPrime\n\tend func\nend func\n" }, { "id": 195, "name": "030", "Crystal": "n, k = read_line.split.map(&.to_i)\ncnt = [0] * n.succ\n(2..n).each do |x|\n next if cnt[x] != 0\n x.step(to: n, by: x) { |y|\n cnt[y] += 1\n }\nend\nputs cnt.count { |x| x >= k }\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar isPrime: []bool :: sieve(n)\n\tvar a: []int :: #[n + 1]int\n\tfor i(2, n)\n\t\tif(isPrime[i])\n\t\t\tvar j: int :: i\n\t\t\twhile(j <= n)\n\t\t\t\tdo a[j] :+ 1\n\t\t\t\tdo j :+ i\n\t\t\tend while\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(2, n)\n\t\tif(a[i] >= k)\n\t\t\tdo ans :+ 1\n\t\tend if\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc sieve(n: int): []bool\n\t\tif(n < 2)\n\t\t\tret[false].repeat(n + 1)\n\t\tend if\n\t\tvar isPrime: []bool :: [true].repeat(n + 1)\n\t\tdo isPrime[0] :: false\n\t\tdo isPrime[1] :: false\n\t\tfor i(2, n)\n\t\t\tif(isPrime[i])\n\t\t\t\tvar j: int :: i * i\n\t\t\t\twhile(j <= n)\n\t\t\t\t\tdo isPrime[j] :: false\n\t\t\t\t\tdo j :+ i\n\t\t\t\tend while\n\t\t\tend if\n\t\tend for\n\t\tret isPrime\n\tend func\nend func\n" }, { "id": 196, "name": "031", "C++": "#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\n\n\nint grundy[55][1555];\n\n\n\nvoid init() {\n\n\tfor (int i = 0; i <= 50; i++) {\n\n\t\tfor (int j = 0; j <= 1500; j++) {\n\n\t\t\tint mex[1555];\n\n\t\t\tfor (int k = 0; k < 1555; k++) mex[k] = 0;\n\n\t\t\tif (i >= 1) {\n\n\t\t\t\tmex[grundy[i - 1][j + i]] = 1;\n\n\t\t\t}\n\n\t\t\tif (j >= 2) {\n\n\t\t\t\tfor (int k = 1; k <= (j / 2); k++) mex[grundy[i][j - k]] = 1;\n\n\t\t\t}\n\n\t\t\tfor (int k = 0; k < 1555; k++) {\n\n\t\t\t\tif (mex[k] == 0) { grundy[i][j] = k; break; }\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tfor (int i = 1; i <= N; i++) cin >> B[i];\n\n\n\n\t// Step #2. Initialize\n\n\tinit();\n\n\n\n\t// Step #3. Get Answer\n\n\tint sum_xor = 0;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i == N) {\n\n\t\t\ti += 0;\n\n\t\t}\n\n\t\tsum_xor ^= grundy[A[i]][B[i]];\n\n\t}\n\n\n\n\t// Step #4. Output\n\n\tif (sum_xor != 0) cout << \"First\" << endl;\n\n\tif (sum_xor == 0) cout << \"Second\" << endl;\n\n\treturn 0;\n\n}", "Crystal": "class Array(T)\n def mex\n result = 0\n sort.each do |i|\n return result if result < i\n result = i.succ\n end\n result\n end\nend\n\ngrundy = Hash({Int32, Int32}, Int32).new { |hash, (w, b)|\n if w == 0 && b <= 1\n 0\n else\n a = [] of Int32\n a << hash[{w - 1, b + w}] if w >= 1\n a.concat (1..b // 2).map { |k| hash[{w, b - k}] }\n hash[{w, b}] = a.mex\n end\n}\n\nread_line\nw = read_line.split.map(&.to_i)\nb = read_line.split.map(&.to_i)\nputs w.zip(b).reduce(0) { |acc, (w, b)|\n acc ^ grundy[{w, b}]\n} > 0 ? \"First\" : \"Second\"\n" }, { "id": 197, "name": "032", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nconst int inf = 1e6;\n\nvoid chmin(int &a, int b) { a = min(a, b); }\n\nvoid print_vector_vector(vector> vv) {\n for (vector v : vv) {\n for (int i : v) {\n cout << i << \",\";\n }\n cout << endl;\n }\n}\n\nvoid tobit(int n, int d) {\n rep(i, d) {\n bool bit = (n >> i) & 1;\n cout << bit;\n }\n}\n\nint main() {\n int n;\n cin >> n;\n vector> a(n, vector(n, 0));\n rep(i, n) {\n rep(j, n) { cin >> a[i][j]; }\n }\n int m;\n cin >> m;\n // vector> isHate(n, vector(n, false));\n vector isHate(1 << n, false);\n rep(i, m) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n isHate[(1 << x) | (1 << y)] = true;\n }\n vector> dp(1 << n, vector(n, inf));\n rep(i, n) {\n int next_pos = i;\n int next_state = 1 << next_pos;\n dp[next_state][next_pos] = a[next_pos][0];\n }\n rep(i, (1 << n) - 1) {\n int now_state = i;\n rep(j, n) {\n int now_pos = j;\n bool check = (now_state >> j) & 1;\n if (!check) {\n continue;\n }\n rep(k, n) {\n int next_pos = k;\n if (next_pos == now_pos) {\n continue;\n }\n bool check = (now_state >> next_pos) & 1;\n if (check) {\n continue;\n }\n if (isHate[(1 << next_pos) | (1 << now_pos)]) {\n continue;\n }\n int next_state = (1 << next_pos) | now_state;\n int step = __builtin_popcount(now_state);\n chmin(dp[next_state][next_pos],\n dp[now_state][now_pos] + a[next_pos][step]);\n }\n }\n }\n int ans = *min_element(all(dp[(1 << n) - 1]));\n if (ans == inf) {\n cout << -1 << endl;\n } else {\n cout << ans << endl;\n }\n}", "Crystal": "n = read_line.to_i\na = (1..n).map { read_line.split.map(&.to_i) }\nm = read_line.to_i\nflag = (1..n).map { [true] * n }\nm.times do\n x, y = read_line.split.map(&.to_i.pred)\n flag[x][y] = flag[y][x] = false\nend\n\nputs (0...n).to_a.each_permutation.select { |perm|\n perm.each_cons(2).all? { |(i, j)| flag[i][j] }\n}.min_of? { |perm|\n (0...n).sum { |i| a[perm[i]][i] }\n} || -1\n" }, { "id": 198, "name": "032", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nconst int inf = 1e6;\n\nvoid chmin(int &a, int b) { a = min(a, b); }\n\nvoid print_vector_vector(vector> vv) {\n for (vector v : vv) {\n for (int i : v) {\n cout << i << \",\";\n }\n cout << endl;\n }\n}\n\nvoid tobit(int n, int d) {\n rep(i, d) {\n bool bit = (n >> i) & 1;\n cout << bit;\n }\n}\n\nint main() {\n int n;\n cin >> n;\n vector> a(n, vector(n, 0));\n rep(i, n) {\n rep(j, n) { cin >> a[i][j]; }\n }\n int m;\n cin >> m;\n // vector> isHate(n, vector(n, false));\n vector isHate(1 << n, false);\n rep(i, m) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n isHate[(1 << x) | (1 << y)] = true;\n }\n vector> dp(1 << n, vector(n, inf));\n rep(i, n) {\n int next_pos = i;\n int next_state = 1 << next_pos;\n dp[next_state][next_pos] = a[next_pos][0];\n }\n rep(i, (1 << n) - 1) {\n int now_state = i;\n rep(j, n) {\n int now_pos = j;\n bool check = (now_state >> j) & 1;\n if (!check) {\n continue;\n }\n rep(k, n) {\n int next_pos = k;\n if (next_pos == now_pos) {\n continue;\n }\n bool check = (now_state >> next_pos) & 1;\n if (check) {\n continue;\n }\n if (isHate[(1 << next_pos) | (1 << now_pos)]) {\n continue;\n }\n int next_state = (1 << next_pos) | now_state;\n int step = __builtin_popcount(now_state);\n chmin(dp[next_state][next_pos],\n dp[now_state][now_pos] + a[next_pos][step]);\n }\n }\n }\n int ans = *min_element(all(dp[(1 << n) - 1]));\n if (ans == inf) {\n cout << -1 << endl;\n } else {\n cout << ans << endl;\n }\n}", "Python": "#!/usr/bin/env python3\n\nimport itertools\n\nn = int(input())\na = [[] for _ in range(n)]\nfor i in range(n):\n a[i] = list(map(int, input().split()))\nm = int(input())\nng = [[False] * n for _ in range(n)]\nfor _ in range(m):\n x, y = map(int, input().split())\n ng[x - 1][y - 1] = ng[y - 1][x - 1] = True\n\ninf = 1_000_000_000\nans = inf\nfor p in itertools.permutations(range(n)):\n cost = 0\n for i in range(n):\n cost += a[p[i]][i]\n if cost >= ans:\n continue\n ok = True\n for i in range(n - 1):\n x = p[i]\n y = p[i + 1]\n if ng[x][y]:\n ok = False\n break\n if ok:\n ans = cost\nif ans == inf:\n print(-1)\nelse:\n print(ans)\n" }, { "id": 199, "name": "032", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nconst int inf = 1e6;\n\nvoid chmin(int &a, int b) { a = min(a, b); }\n\nvoid print_vector_vector(vector> vv) {\n for (vector v : vv) {\n for (int i : v) {\n cout << i << \",\";\n }\n cout << endl;\n }\n}\n\nvoid tobit(int n, int d) {\n rep(i, d) {\n bool bit = (n >> i) & 1;\n cout << bit;\n }\n}\n\nint main() {\n int n;\n cin >> n;\n vector> a(n, vector(n, 0));\n rep(i, n) {\n rep(j, n) { cin >> a[i][j]; }\n }\n int m;\n cin >> m;\n // vector> isHate(n, vector(n, false));\n vector isHate(1 << n, false);\n rep(i, m) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n isHate[(1 << x) | (1 << y)] = true;\n }\n vector> dp(1 << n, vector(n, inf));\n rep(i, n) {\n int next_pos = i;\n int next_state = 1 << next_pos;\n dp[next_state][next_pos] = a[next_pos][0];\n }\n rep(i, (1 << n) - 1) {\n int now_state = i;\n rep(j, n) {\n int now_pos = j;\n bool check = (now_state >> j) & 1;\n if (!check) {\n continue;\n }\n rep(k, n) {\n int next_pos = k;\n if (next_pos == now_pos) {\n continue;\n }\n bool check = (now_state >> next_pos) & 1;\n if (check) {\n continue;\n }\n if (isHate[(1 << next_pos) | (1 << now_pos)]) {\n continue;\n }\n int next_state = (1 << next_pos) | now_state;\n int step = __builtin_popcount(now_state);\n chmin(dp[next_state][next_pos],\n dp[now_state][now_pos] + a[next_pos][step]);\n }\n }\n }\n int ans = *min_element(all(dp[(1 << n) - 1]));\n if (ans == inf) {\n cout << -1 << endl;\n } else {\n cout << ans << endl;\n }\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: [][]int :: #[n, n]int\n\tfor i(0, n - 1)\n\t\tfor j(0, n - 1)\n\t\t\tdo a[i][j] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar m: int :: cui@inputInt()\n\tvar xy: [][]bool :: #[n, n]bool\n\tfor(1, m)\n\t\tvar x: int :: cui@inputInt() - 1\n\t\tvar y: int :: cui@inputInt() - 1\n\t\tdo xy[x][y] :: true\n\t\tdo xy[y][x] :: true\n\tend for\n\t\n\tvar idxs: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo idxs[i] :: i\n\tend for\n\t\n\tvar ans: int :: lib@intMax\n\t\n\twhile loop(@nextPermutation(idxs), skip)\n\t\tvar t: int :: a[idxs[0]][0]\n\t\tfor i(1, n - 1)\n\t\t\tif(xy[idxs[i]][idxs[i - 1]])\n\t\t\t\tskip loop\n\t\t\tend if\n\t\t\tdo t :+ a[idxs[i]][i]\n\t\tend for\n\t\tdo ans :: [ans, t].min()\n\tend while\n\t\n\tif(ans = lib@intMax)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n\nfunc nextPermutation(arr: []int): bool\n\tvar len: int :: ^arr\n\tvar left: int :: len - 2\n\twhile(left >= 0 & arr[left] >= arr[left + 1])\n\t\tdo left :- 1\n\tend while\n\tif(left < 0)\n\t\tret false\n\tend if\n\tvar right: int :: len - 1\n\twhile(arr[left] >= arr[right])\n\t\tdo right :- 1\n\tend while\n\tvar tmp: int :: arr[left]\n\tdo arr[left] :: arr[right]\n\tdo arr[right] :: tmp\n\tdo left :+ 1\n\tdo right :: len - 1\n\twhile(left < right)\n\t\tdo tmp :: arr[left]\n\t\tdo arr[left] :: arr[right]\n\t\tdo arr[right] :: tmp\n\t\tdo left :+ 1\n\t\tdo right :- 1\n\tend while\n\tret true\nend func\n" }, { "id": 200, "name": "032", "Crystal": "n = read_line.to_i\na = (1..n).map { read_line.split.map(&.to_i) }\nm = read_line.to_i\nflag = (1..n).map { [true] * n }\nm.times do\n x, y = read_line.split.map(&.to_i.pred)\n flag[x][y] = flag[y][x] = false\nend\n\nputs (0...n).to_a.each_permutation.select { |perm|\n perm.each_cons(2).all? { |(i, j)| flag[i][j] }\n}.min_of? { |perm|\n (0...n).sum { |i| a[perm[i]][i] }\n} || -1\n", "Python": "#!/usr/bin/env python3\n\nimport itertools\n\nn = int(input())\na = [[] for _ in range(n)]\nfor i in range(n):\n a[i] = list(map(int, input().split()))\nm = int(input())\nng = [[False] * n for _ in range(n)]\nfor _ in range(m):\n x, y = map(int, input().split())\n ng[x - 1][y - 1] = ng[y - 1][x - 1] = True\n\ninf = 1_000_000_000\nans = inf\nfor p in itertools.permutations(range(n)):\n cost = 0\n for i in range(n):\n cost += a[p[i]][i]\n if cost >= ans:\n continue\n ok = True\n for i in range(n - 1):\n x = p[i]\n y = p[i + 1]\n if ng[x][y]:\n ok = False\n break\n if ok:\n ans = cost\nif ans == inf:\n print(-1)\nelse:\n print(ans)\n" }, { "id": 201, "name": "032", "Crystal": "n = read_line.to_i\na = (1..n).map { read_line.split.map(&.to_i) }\nm = read_line.to_i\nflag = (1..n).map { [true] * n }\nm.times do\n x, y = read_line.split.map(&.to_i.pred)\n flag[x][y] = flag[y][x] = false\nend\n\nputs (0...n).to_a.each_permutation.select { |perm|\n perm.each_cons(2).all? { |(i, j)| flag[i][j] }\n}.min_of? { |perm|\n (0...n).sum { |i| a[perm[i]][i] }\n} || -1\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: [][]int :: #[n, n]int\n\tfor i(0, n - 1)\n\t\tfor j(0, n - 1)\n\t\t\tdo a[i][j] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar m: int :: cui@inputInt()\n\tvar xy: [][]bool :: #[n, n]bool\n\tfor(1, m)\n\t\tvar x: int :: cui@inputInt() - 1\n\t\tvar y: int :: cui@inputInt() - 1\n\t\tdo xy[x][y] :: true\n\t\tdo xy[y][x] :: true\n\tend for\n\t\n\tvar idxs: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo idxs[i] :: i\n\tend for\n\t\n\tvar ans: int :: lib@intMax\n\t\n\twhile loop(@nextPermutation(idxs), skip)\n\t\tvar t: int :: a[idxs[0]][0]\n\t\tfor i(1, n - 1)\n\t\t\tif(xy[idxs[i]][idxs[i - 1]])\n\t\t\t\tskip loop\n\t\t\tend if\n\t\t\tdo t :+ a[idxs[i]][i]\n\t\tend for\n\t\tdo ans :: [ans, t].min()\n\tend while\n\t\n\tif(ans = lib@intMax)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n\nfunc nextPermutation(arr: []int): bool\n\tvar len: int :: ^arr\n\tvar left: int :: len - 2\n\twhile(left >= 0 & arr[left] >= arr[left + 1])\n\t\tdo left :- 1\n\tend while\n\tif(left < 0)\n\t\tret false\n\tend if\n\tvar right: int :: len - 1\n\twhile(arr[left] >= arr[right])\n\t\tdo right :- 1\n\tend while\n\tvar tmp: int :: arr[left]\n\tdo arr[left] :: arr[right]\n\tdo arr[right] :: tmp\n\tdo left :+ 1\n\tdo right :: len - 1\n\twhile(left < right)\n\t\tdo tmp :: arr[left]\n\t\tdo arr[left] :: arr[right]\n\t\tdo arr[right] :: tmp\n\t\tdo left :+ 1\n\t\tdo right :- 1\n\tend while\n\tret true\nend func\n" }, { "id": 202, "name": "032", "Python": "#!/usr/bin/env python3\n\nimport itertools\n\nn = int(input())\na = [[] for _ in range(n)]\nfor i in range(n):\n a[i] = list(map(int, input().split()))\nm = int(input())\nng = [[False] * n for _ in range(n)]\nfor _ in range(m):\n x, y = map(int, input().split())\n ng[x - 1][y - 1] = ng[y - 1][x - 1] = True\n\ninf = 1_000_000_000\nans = inf\nfor p in itertools.permutations(range(n)):\n cost = 0\n for i in range(n):\n cost += a[p[i]][i]\n if cost >= ans:\n continue\n ok = True\n for i in range(n - 1):\n x = p[i]\n y = p[i + 1]\n if ng[x][y]:\n ok = False\n break\n if ok:\n ans = cost\nif ans == inf:\n print(-1)\nelse:\n print(ans)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: [][]int :: #[n, n]int\n\tfor i(0, n - 1)\n\t\tfor j(0, n - 1)\n\t\t\tdo a[i][j] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar m: int :: cui@inputInt()\n\tvar xy: [][]bool :: #[n, n]bool\n\tfor(1, m)\n\t\tvar x: int :: cui@inputInt() - 1\n\t\tvar y: int :: cui@inputInt() - 1\n\t\tdo xy[x][y] :: true\n\t\tdo xy[y][x] :: true\n\tend for\n\t\n\tvar idxs: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo idxs[i] :: i\n\tend for\n\t\n\tvar ans: int :: lib@intMax\n\t\n\twhile loop(@nextPermutation(idxs), skip)\n\t\tvar t: int :: a[idxs[0]][0]\n\t\tfor i(1, n - 1)\n\t\t\tif(xy[idxs[i]][idxs[i - 1]])\n\t\t\t\tskip loop\n\t\t\tend if\n\t\t\tdo t :+ a[idxs[i]][i]\n\t\tend for\n\t\tdo ans :: [ans, t].min()\n\tend while\n\t\n\tif(ans = lib@intMax)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n\nfunc nextPermutation(arr: []int): bool\n\tvar len: int :: ^arr\n\tvar left: int :: len - 2\n\twhile(left >= 0 & arr[left] >= arr[left + 1])\n\t\tdo left :- 1\n\tend while\n\tif(left < 0)\n\t\tret false\n\tend if\n\tvar right: int :: len - 1\n\twhile(arr[left] >= arr[right])\n\t\tdo right :- 1\n\tend while\n\tvar tmp: int :: arr[left]\n\tdo arr[left] :: arr[right]\n\tdo arr[right] :: tmp\n\tdo left :+ 1\n\tdo right :: len - 1\n\twhile(left < right)\n\t\tdo tmp :: arr[left]\n\t\tdo arr[left] :: arr[right]\n\t\tdo arr[right] :: tmp\n\t\tdo left :+ 1\n\t\tdo right :- 1\n\tend while\n\tret true\nend func\n" }, { "id": 203, "name": "033", "C++": "#include \n\nusing namespace std;\n\n\n\nint H, W;\n\n\n\nint main() {\n\n\tcin >> H >> W;\n\n\tif (H == 1 || W == 1) cout << H * W << endl;\n\n\telse cout << ((H + 1) / 2) * ((W + 1) / 2) << endl;\n\n\treturn 0;\n\n}", "Crystal": "a, b = read_line.split.map(&.to_i)\nif a == 1 || b == 1\n puts a * b\nelse\n puts (a.succ // 2) * (b.succ // 2)\nend\n" }, { "id": 204, "name": "033", "C++": "#include \n\nusing namespace std;\n\n\n\nint H, W;\n\n\n\nint main() {\n\n\tcin >> H >> W;\n\n\tif (H == 1 || W == 1) cout << H * W << endl;\n\n\telse cout << ((H + 1) / 2) * ((W + 1) / 2) << endl;\n\n\treturn 0;\n\n}", "Python": "import math\n\nh, w = map(int, input().split())\n\nif h == 1 or w == 1:\n print(h*w)\nelse:\n print(math.ceil(h/2) * math.ceil(w/2))\n" }, { "id": 205, "name": "033", "C++": "#include \n\nusing namespace std;\n\n\n\nint H, W;\n\n\n\nint main() {\n\n\tcin >> H >> W;\n\n\tif (H == 1 || W == 1) cout << H * W << endl;\n\n\telse cout << ((H + 1) / 2) * ((W + 1) / 2) << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar ans: int\n\tif(h = 1 | w = 1)\n\t\tdo ans :: h * w\n\telse\n\t\tdo ans :: ((h + 1) / 2) * ((w + 1) / 2)\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 206, "name": "033", "Crystal": "a, b = read_line.split.map(&.to_i)\nif a == 1 || b == 1\n puts a * b\nelse\n puts (a.succ // 2) * (b.succ // 2)\nend\n", "Python": "import math\n\nh, w = map(int, input().split())\n\nif h == 1 or w == 1:\n print(h*w)\nelse:\n print(math.ceil(h/2) * math.ceil(w/2))\n" }, { "id": 207, "name": "033", "Crystal": "a, b = read_line.split.map(&.to_i)\nif a == 1 || b == 1\n puts a * b\nelse\n puts (a.succ // 2) * (b.succ // 2)\nend\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar ans: int\n\tif(h = 1 | w = 1)\n\t\tdo ans :: h * w\n\telse\n\t\tdo ans :: ((h + 1) / 2) * ((w + 1) / 2)\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 208, "name": "033", "Python": "import math\n\nh, w = map(int, input().split())\n\nif h == 1 or w == 1:\n print(h*w)\nelse:\n print(math.ceil(h/2) * math.ceil(w/2))\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar ans: int\n\tif(h = 1 | w = 1)\n\t\tdo ans :: h * w\n\telse\n\t\tdo ans :: ((h + 1) / 2) * ((w + 1) / 2)\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 209, "name": "034", "C++": "#include \nusing namespace std;\n\nbool is_ok(int N, int K, vector &a, int len)\n{\n int num = 0;\n map cnt_map;\n for (int i = 0; i < len; ++i) {\n auto ai = a.at(i);\n ++cnt_map[ai];\n if (cnt_map.at(ai) == 1)\n ++num;\n }\n if (num <= K)\n return true;\n for (int i = 0, j = len; j < N; ++i, ++j) {\n auto ai = a.at(i);\n auto aj = a.at(j);\n --cnt_map[ai];\n if (cnt_map.at(ai) == 0)\n --num;\n ++cnt_map[aj];\n if (cnt_map.at(aj) == 1)\n ++num;\n if (num <= K)\n return true;\n }\n return false;\n}\n\nint main()\n{\n int N, K;\n cin >> N >> K;\n vector a(N);\n for (auto &ai : a)\n cin >> ai;\n int ok = 0;\n int ng = N + 1;\n while (abs(ok - ng) > 1) {\n auto mid = (ok + ng) / 2;\n if (is_ok(N, K, a, mid))\n ok = mid;\n else\n ng = mid;\n }\n cout << ok << endl;\n}\n", "Crystal": "n, k = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\n\ntable = Hash(Int32, Int32).new(0)\ncnt, r, ans = 0, 0, 0\n(0...n).each do |l|\n while r < n && (cnt < k || table[a[r]] > 0)\n cnt += 1 if table[a[r]] == 0\n table[a[r]] += 1\n r += 1\n end\n\n ans = {ans, r - l}.max\n\n cnt -= 1 if table[a[l]] == 1\n table[a[l]] -= 1\nend\nputs ans\n" }, { "id": 210, "name": "034", "C++": "#include \nusing namespace std;\n\nbool is_ok(int N, int K, vector &a, int len)\n{\n int num = 0;\n map cnt_map;\n for (int i = 0; i < len; ++i) {\n auto ai = a.at(i);\n ++cnt_map[ai];\n if (cnt_map.at(ai) == 1)\n ++num;\n }\n if (num <= K)\n return true;\n for (int i = 0, j = len; j < N; ++i, ++j) {\n auto ai = a.at(i);\n auto aj = a.at(j);\n --cnt_map[ai];\n if (cnt_map.at(ai) == 0)\n --num;\n ++cnt_map[aj];\n if (cnt_map.at(aj) == 1)\n ++num;\n if (num <= K)\n return true;\n }\n return false;\n}\n\nint main()\n{\n int N, K;\n cin >> N >> K;\n vector a(N);\n for (auto &ai : a)\n cin >> ai;\n int ok = 0;\n int ng = N + 1;\n while (abs(ok - ng) > 1) {\n auto mid = (ok + ng) / 2;\n if (is_ok(N, K, a, mid))\n ok = mid;\n else\n ng = mid;\n }\n cout << ok << endl;\n}\n", "Python": "from collections import deque\n\nn, k = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nq = deque()\nans = 0\n\nkinds = 0\nnum_dict = {}\n\nfor i in range(n):\n now_app = a[i]\n q.append(now_app)\n if now_app not in num_dict:\n num_dict[now_app] = 1\n kinds += 1\n else:\n num_dict[now_app] += 1\n while kinds > k:\n now_rem = q.popleft()\n if now_rem in num_dict:\n if num_dict[now_rem] == 1:\n num_dict.pop(now_rem)\n kinds -= 1\n else:\n num_dict[now_rem] -= 1\n # print(q)\n # print(num_dict, kinds)\n ans = max(ans, len(q))\n\nprint(ans)\n" }, { "id": 211, "name": "034", "C++": "#include \nusing namespace std;\n\nbool is_ok(int N, int K, vector &a, int len)\n{\n int num = 0;\n map cnt_map;\n for (int i = 0; i < len; ++i) {\n auto ai = a.at(i);\n ++cnt_map[ai];\n if (cnt_map.at(ai) == 1)\n ++num;\n }\n if (num <= K)\n return true;\n for (int i = 0, j = len; j < N; ++i, ++j) {\n auto ai = a.at(i);\n auto aj = a.at(j);\n --cnt_map[ai];\n if (cnt_map.at(ai) == 0)\n --num;\n ++cnt_map[aj];\n if (cnt_map.at(aj) == 1)\n ++num;\n if (num <= K)\n return true;\n }\n return false;\n}\n\nint main()\n{\n int N, K;\n cin >> N >> K;\n vector a(N);\n for (auto &ai : a)\n cin >> ai;\n int ok = 0;\n int ng = N + 1;\n while (abs(ok - ng) > 1) {\n auto mid = (ok + ng) / 2;\n if (is_ok(N, K, a, mid))\n ok = mid;\n else\n ng = mid;\n }\n cout << ok << endl;\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar map: dict :: #dict\n\tvar l: int :: 0\n\tvar r: int :: 0\n\tvar ans: int :: 0\n\twhile(l <> n)\n\t\tif(r = n | ^map > k)\n\t\t\tvar key: int :: a[l]\n\t\t\tvar val: int :: map.get(key, &) - 1\n\t\t\tif(val = 0)\n\t\t\t\tdo map.del(key)\n\t\t\telse\n\t\t\t\tdo map.add(key, val)\n\t\t\tend if\n\t\t\tdo l :+ 1\n\t\telse\n\t\t\tvar key: int :: a[r]\n\t\t\tvar val: int :: map.get(key, &) + 1\n\t\t\tdo map.add(key, val)\n\t\t\tdo r :+ 1\n\t\tend if\n\t\tif(^map <= k)\n\t\t\tdo ans :: [ans, r - l].max()\n\t\tend if\n\tend while\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 212, "name": "034", "Crystal": "n, k = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\n\ntable = Hash(Int32, Int32).new(0)\ncnt, r, ans = 0, 0, 0\n(0...n).each do |l|\n while r < n && (cnt < k || table[a[r]] > 0)\n cnt += 1 if table[a[r]] == 0\n table[a[r]] += 1\n r += 1\n end\n\n ans = {ans, r - l}.max\n\n cnt -= 1 if table[a[l]] == 1\n table[a[l]] -= 1\nend\nputs ans\n", "Python": "from collections import deque\n\nn, k = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nq = deque()\nans = 0\n\nkinds = 0\nnum_dict = {}\n\nfor i in range(n):\n now_app = a[i]\n q.append(now_app)\n if now_app not in num_dict:\n num_dict[now_app] = 1\n kinds += 1\n else:\n num_dict[now_app] += 1\n while kinds > k:\n now_rem = q.popleft()\n if now_rem in num_dict:\n if num_dict[now_rem] == 1:\n num_dict.pop(now_rem)\n kinds -= 1\n else:\n num_dict[now_rem] -= 1\n # print(q)\n # print(num_dict, kinds)\n ans = max(ans, len(q))\n\nprint(ans)\n" }, { "id": 213, "name": "034", "Crystal": "n, k = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\n\ntable = Hash(Int32, Int32).new(0)\ncnt, r, ans = 0, 0, 0\n(0...n).each do |l|\n while r < n && (cnt < k || table[a[r]] > 0)\n cnt += 1 if table[a[r]] == 0\n table[a[r]] += 1\n r += 1\n end\n\n ans = {ans, r - l}.max\n\n cnt -= 1 if table[a[l]] == 1\n table[a[l]] -= 1\nend\nputs ans\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar map: dict :: #dict\n\tvar l: int :: 0\n\tvar r: int :: 0\n\tvar ans: int :: 0\n\twhile(l <> n)\n\t\tif(r = n | ^map > k)\n\t\t\tvar key: int :: a[l]\n\t\t\tvar val: int :: map.get(key, &) - 1\n\t\t\tif(val = 0)\n\t\t\t\tdo map.del(key)\n\t\t\telse\n\t\t\t\tdo map.add(key, val)\n\t\t\tend if\n\t\t\tdo l :+ 1\n\t\telse\n\t\t\tvar key: int :: a[r]\n\t\t\tvar val: int :: map.get(key, &) + 1\n\t\t\tdo map.add(key, val)\n\t\t\tdo r :+ 1\n\t\tend if\n\t\tif(^map <= k)\n\t\t\tdo ans :: [ans, r - l].max()\n\t\tend if\n\tend while\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 214, "name": "034", "Python": "from collections import deque\n\nn, k = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nq = deque()\nans = 0\n\nkinds = 0\nnum_dict = {}\n\nfor i in range(n):\n now_app = a[i]\n q.append(now_app)\n if now_app not in num_dict:\n num_dict[now_app] = 1\n kinds += 1\n else:\n num_dict[now_app] += 1\n while kinds > k:\n now_rem = q.popleft()\n if now_rem in num_dict:\n if num_dict[now_rem] == 1:\n num_dict.pop(now_rem)\n kinds -= 1\n else:\n num_dict[now_rem] -= 1\n # print(q)\n # print(num_dict, kinds)\n ans = max(ans, len(q))\n\nprint(ans)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar map: dict :: #dict\n\tvar l: int :: 0\n\tvar r: int :: 0\n\tvar ans: int :: 0\n\twhile(l <> n)\n\t\tif(r = n | ^map > k)\n\t\t\tvar key: int :: a[l]\n\t\t\tvar val: int :: map.get(key, &) - 1\n\t\t\tif(val = 0)\n\t\t\t\tdo map.del(key)\n\t\t\telse\n\t\t\t\tdo map.add(key, val)\n\t\t\tend if\n\t\t\tdo l :+ 1\n\t\telse\n\t\t\tvar key: int :: a[r]\n\t\t\tvar val: int :: map.get(key, &) + 1\n\t\t\tdo map.add(key, val)\n\t\t\tdo r :+ 1\n\t\tend if\n\t\tif(^map <= k)\n\t\t\tdo ans :: [ans, r - l].max()\n\t\tend if\n\tend while\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 215, "name": "035", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N;\n\n\tcin >> N;\n\n\tvector > G(N);\n\n\tfor (int i = 0; i < N - 1; ++i) {\n\n\t\tint A, B;\n\n\t\tcin >> A >> B; --A, --B;\n\n\t\tG[A].push_back(B);\n\n\t\tG[B].push_back(A);\n\n\t}\n\n\tint bits = 0;\n\n\twhile ((1 << bits) < N) ++bits;\n\n\tvector > par(bits, vector(N));\n\n\tvector depth(N), id(N);\n\n\tint vert_id = 0;\n\n\tfunction build_tree = [&](int pos, int pre) {\n\n\t\tpar[0][pos] = pre;\n\n\t\tid[pos] = vert_id++;\n\n\t\tfor (int i : G[pos]) {\n\n\t\t\tif (i == pre) continue;\n\n\t\t\tdepth[i] = depth[pos] + 1;\n\n\t\t\tbuild_tree(i, pos);\n\n\t\t}\n\n\t};\n\n\tbuild_tree(0, 0);\n\n\tfor (int i = 1; i < bits; ++i) {\n\n\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\tpar[i][j] = par[i - 1][par[i - 1][j]];\n\n\t\t}\n\n\t}\n\n\tfunction lca = [&](int va, int vb) {\n\n\t\tif (depth[va] < depth[vb]) swap(va, vb);\n\n\t\tfor (int i = bits - 1; i >= 0; --i) {\n\n\t\t\tif (depth[va] - depth[vb] >= (1 << i)) {\n\n\t\t\t\tva = par[i][va];\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (va == vb) return va;\n\n\t\tfor (int i = bits - 1; i >= 0; --i) {\n\n\t\t\tif (par[i][va] != par[i][vb]) {\n\n\t\t\t\tva = par[i][va];\n\n\t\t\t\tvb = par[i][vb];\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn par[0][va];\n\n\t};\n\n\tint Q;\n\n\tcin >> Q;\n\n\tfor (int i = 0; i < Q; ++i) {\n\n\t\tint verts;\n\n\t\tcin >> verts;\n\n\t\tvector sel(verts);\n\n\t\tfor (int j = 0; j < verts; ++j) {\n\n\t\t\tcin >> sel[j];\n\n\t\t\t--sel[j];\n\n\t\t}\n\n\t\tsort(sel.begin(), sel.end(), [&](int va, int vb) {\n\n\t\t\treturn id[va] < id[vb];\n\n\t\t\t});\n\n\t\tint answer = 0;\n\n\t\tfor (int j = 0; j < verts; ++j) {\n\n\t\t\tanswer += depth[sel[j]];\n\n\t\t\tanswer -= depth[lca(sel[j], sel[(j + 1) % verts])];\n\n\t\t}\n\n\t\tcout << answer << '\\n';\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def pre_order(root : Int32)\n result = Array(Int32).new(size)\n stack = Deque{ {root, -1} }\n while vp = stack.pop?\n vertex, parent = vp\n result << vertex\n self[vertex].reverse_each do |to|\n stack << {to, vertex} if to != parent\n end\n end\n result\n end\nend\n\nclass LCA\n getter graph : UnweightedGraph\n getter depth : Array(Int32)\n\n private def dfs(vertex : Int32, par : Int32, dep : Int32) : Nil\n @parent[0][vertex] = par\n @depth[vertex] = dep\n @graph[vertex].each do |edge|\n dfs(edge, vertex, dep + 1) if edge != par\n end\n end\n\n def initialize(@graph, root : Int32)\n @log2 = Math.log2(size).to_i.succ.as(Int32)\n @depth = Array(Int32).new(size, -1)\n @parent = Array(Array(Int32)).new(@log2) { Array.new(size, 0) }\n dfs(root, -1, 0)\n (0...@log2 - 1).each do |k|\n (0...size).each do |v|\n if @parent[k][v] < 0\n @parent[k + 1][v] = -1\n else\n @parent[k + 1][v] = @parent[k][@parent[k][v]]\n end\n end\n end\n end\n\n delegate size, to: @graph\n\n def lca(u : Int32, v : Int32) : Int32\n u, v = v, u if @depth[u] > @depth[v]\n (0...@log2).each do |k|\n v = @parent[k][v] if (@depth[v] - @depth[u]).bit(k) == 1\n end\n\n return u if u == v\n\n (0...@log2).reverse_each do |k|\n u, v = @parent[k][u], @parent[k][v] if @parent[k][u] != @parent[k][v]\n end\n @parent[0][u]\n end\n\n def dist(u : Int32, v : Int32) : Int32\n @depth[u] + @depth[v] - @depth[lca(u, v)] * 2\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\nlca = LCA.new(graph, 0)\n\norder = graph.pre_order(0)\nindex = [0] * n\n(0...n).each { |i| index[order[i]] = i }\n\nread_line.to_i.times do\n v = read_line.split.map(&.to_i.pred).skip(1).sort_by! { |i| index[i] }\n puts (0...v.size).sum { |i| lca.dist v[i], v[i.succ % v.size] } // 2\nend\n" }, { "id": 216, "name": "036", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, X[1 << 18], Y[1 << 18];\n\nlong long Q, T[1 << 18];\n\nlong long min_X = (1LL << 60), max_X = -(1LL << 60);\n\nlong long min_Y = (1LL << 60), max_Y = -(1LL << 60);\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N >> Q;\n\n\tfor (int i = 1; i <= N; i++) cin >> X[i] >> Y[i];\n\n\tfor (int i = 1; i <= Q; i++) cin >> T[i];\n\n\n\n\t// Step #2. 45 “x‰ñ“]\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tlong long p1 = X[i] + Y[i];\n\n\t\tlong long p2 = Y[i] - X[i];\n\n\t\tX[i] = p1;\n\n\t\tY[i] = p2;\n\n\t\tmin_X = min(min_X, X[i]);\n\n\t\tmax_X = max(max_X, X[i]);\n\n\t\tmin_Y = min(min_Y, Y[i]);\n\n\t\tmax_Y = max(max_Y, Y[i]);\n\n\t}\n\n\n\n\t// Step #3. ƒNƒGƒŠ‚É“š‚¦‚é\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tlong long ret1 = abs(X[T[i]] - min_X);\n\n\t\tlong long ret2 = abs(X[T[i]] - max_X);\n\n\t\tlong long ret3 = abs(Y[T[i]] - min_Y);\n\n\t\tlong long ret4 = abs(Y[T[i]] - max_Y);\n\n\t\tcout << max({ ret1, ret2, ret3, ret4 }) << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n, q = read_line.split.map(&.to_i)\nx, y = (1..n).map {\n a, b = read_line.split.map(&.to_i64)\n {a - b, a + b}\n}.transpose\nxy = x.minmax + y.minmax\n\nq.times do\n i = read_line.to_i - 1\n puts [x[i], x[i], y[i], y[i]].zip(xy).max_of { |a, b| (a - b).abs }\nend\n" }, { "id": 217, "name": "036", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, X[1 << 18], Y[1 << 18];\n\nlong long Q, T[1 << 18];\n\nlong long min_X = (1LL << 60), max_X = -(1LL << 60);\n\nlong long min_Y = (1LL << 60), max_Y = -(1LL << 60);\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N >> Q;\n\n\tfor (int i = 1; i <= N; i++) cin >> X[i] >> Y[i];\n\n\tfor (int i = 1; i <= Q; i++) cin >> T[i];\n\n\n\n\t// Step #2. 45 “x‰ñ“]\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tlong long p1 = X[i] + Y[i];\n\n\t\tlong long p2 = Y[i] - X[i];\n\n\t\tX[i] = p1;\n\n\t\tY[i] = p2;\n\n\t\tmin_X = min(min_X, X[i]);\n\n\t\tmax_X = max(max_X, X[i]);\n\n\t\tmin_Y = min(min_Y, Y[i]);\n\n\t\tmax_Y = max(max_Y, Y[i]);\n\n\t}\n\n\n\n\t// Step #3. ƒNƒGƒŠ‚É“š‚¦‚é\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tlong long ret1 = abs(X[T[i]] - min_X);\n\n\t\tlong long ret2 = abs(X[T[i]] - max_X);\n\n\t\tlong long ret3 = abs(Y[T[i]] - min_Y);\n\n\t\tlong long ret4 = abs(Y[T[i]] - max_Y);\n\n\t\tcout << max({ ret1, ret2, ret3, ret4 }) << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar x: []int :: #[n]int\n\tvar y: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputInt()\n\t\tdo y[i] :: cui@inputInt()\n\t\tvar nx: int :: x[i] - y[i]\n\t\tvar ny: int :: x[i] + y[i]\n\t\tdo x[i] :: nx\n\t\tdo y[i] :: ny\n\tend for\n\t\n\tvar minX: int :: x[0]\n\tvar maxX: int :: x[0]\n\tvar minY: int :: y[0]\n\tvar maxY: int :: y[0]\n\tfor i(1, n - 1)\n\t\tdo minX :: [minX, x[i]].min()\n\t\tdo maxX :: [maxX, x[i]].max()\n\t\tdo minY :: [minY, y[i]].min()\n\t\tdo maxY :: [maxY, y[i]].max()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar idx: int :: cui@inputInt() - 1\n\t\tvar ans: int :: 0\n\t\tdo ans :: [ans, (x[idx] - minX).abs()].max()\n\t\tdo ans :: [ans, (x[idx] - maxX).abs()].max()\n\t\tdo ans :: [ans, (y[idx] - minY).abs()].max()\n\t\tdo ans :: [ans, (y[idx] - maxY).abs()].max()\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 218, "name": "036", "Crystal": "n, q = read_line.split.map(&.to_i)\nx, y = (1..n).map {\n a, b = read_line.split.map(&.to_i64)\n {a - b, a + b}\n}.transpose\nxy = x.minmax + y.minmax\n\nq.times do\n i = read_line.to_i - 1\n puts [x[i], x[i], y[i], y[i]].zip(xy).max_of { |a, b| (a - b).abs }\nend\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar x: []int :: #[n]int\n\tvar y: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputInt()\n\t\tdo y[i] :: cui@inputInt()\n\t\tvar nx: int :: x[i] - y[i]\n\t\tvar ny: int :: x[i] + y[i]\n\t\tdo x[i] :: nx\n\t\tdo y[i] :: ny\n\tend for\n\t\n\tvar minX: int :: x[0]\n\tvar maxX: int :: x[0]\n\tvar minY: int :: y[0]\n\tvar maxY: int :: y[0]\n\tfor i(1, n - 1)\n\t\tdo minX :: [minX, x[i]].min()\n\t\tdo maxX :: [maxX, x[i]].max()\n\t\tdo minY :: [minY, y[i]].min()\n\t\tdo maxY :: [maxY, y[i]].max()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar idx: int :: cui@inputInt() - 1\n\t\tvar ans: int :: 0\n\t\tdo ans :: [ans, (x[idx] - minX).abs()].max()\n\t\tdo ans :: [ans, (x[idx] - maxX).abs()].max()\n\t\tdo ans :: [ans, (y[idx] - minY).abs()].max()\n\t\tdo ans :: [ans, (y[idx] - maxY).abs()].max()\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 219, "name": "037", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass RangeMax {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector dat;\n\n\n\n\tvoid init(int sz) {\n\n\t\twhile (size_ <= sz) size_ *= 2;\n\n\t\tdat.resize(size_ * 2, -(1LL << 60));\n\n\t}\n\n\tvoid update(int pos, long long x) {\n\n\t\tpos += size_;\n\n\t\tdat[pos] = x;\n\n\t\twhile (pos >= 2) {\n\n\t\t\tpos >>= 1;\n\n\t\t\tdat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);\n\n\t\t}\n\n\t}\n\n\tlong long query_(int l, int r, int a, int b, int u) {\n\n\t\tif (l <= a && b <= r) return dat[u];\n\n\t\tif (r <= a || b <= l) return -(1LL << 60);\n\n\t\tlong long v1 = query_(l, r, a, (a + b) >> 1, u * 2);\n\n\t\tlong long v2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);\n\n\t\treturn max(v1, v2);\n\n\t}\n\n\tlong long query(int l, int r) {\n\n\t\treturn query_(l, r, 0, size_, 1);\n\n\t}\n\n};\n\n\n\nlong long W, N;\n\nlong long L[1 << 18], R[1 << 18], V[1 << 18];\n\nlong long dp[509][10009];\n\nRangeMax Z[509];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> W >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> L[i] >> R[i] >> V[i];\n\n\n\n\t// Step #2. 初期化\n\n\tfor (int i = 0; i <= N; i++) {\n\n\t\tfor (int j = 0; j <= W; j++) dp[i][j] = -(1LL << 60);\n\n\t\tZ[i].init(W + 2);\n\n\t}\n\n\tdp[0][0] = 0;\n\n\tZ[0].update(0, 0);\n\n\n\n\t// Step #3. 動的計画法\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 0; j <= W; j++) dp[i][j] = dp[i - 1][j];\n\n\t\tfor (int j = 0; j <= W; j++) {\n\n\t\t\tint cl = max(0, j - (int)R[i]), cr = max(0, j - (int)L[i] + 1);\n\n\t\t\tif (cl == cr) continue;\n\n\t\t\tlong long val = Z[i - 1].query(cl, cr);\n\n\t\t\tif (val != -(1LL << 60)) {\n\n\t\t\t\tdp[i][j] = max(dp[i][j], val + V[i]);\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor (int j = 0; j <= W; j++) Z[i].update(j, dp[i][j]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tif (dp[N][W] == -(1LL << 60)) cout << \"-1\" << endl;\n\n\telse cout << dp[N][W] << endl;\n\n\treturn 0;\n\n}", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::segtree](https://atcoder.github.io/ac-library/master/document_en/segtree.html).\n #\n # The identity element will be implicitly defined as nil, so you don't\n # have to manually define it. In the other words, you cannot include\n # nil into an element of the monoid.\n #\n # ```\n # tree = AtCoder::SegTree.new((0...100).to_a) { |a, b| [a, b].min }\n # tree[10...50] # => 10\n # ```\n class SegTree(T)\n property values : Array(T)\n\n def initialize(values : Array(T))\n initialize(values) { |a, b| a > b ? a : b }\n end\n\n def initialize(values : Array(T), &@operator : T, T -> T)\n @values = values\n @segments = Array(T | Nil).new(2 ** ::Math.log2(values.size).ceil.to_i - 1, nil)\n\n # initialize segments\n (@segments.size - 1).downto(0) do |i|\n child1 = nil.as(T | Nil)\n child2 = nil.as(T | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n end\n end\n\n @[AlwaysInline]\n private def operate(a : T | Nil, b : T | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @operator.call(a, b)\n end\n end\n\n # Implements atcoder::segtree.set(index, value)\n def []=(index : Int, value : T)\n @values[index] = value\n\n parent_index = (index + @segments.size - 1) // 2\n while parent_index >= 0\n i = parent_index\n child1 = nil.as(T | Nil)\n child2 = nil.as(T | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n parent_index = (parent_index - 1) // 2\n end\n end\n\n # Implements atcoder::segtree.get(index)\n def [](index : Int)\n @values[index]\n end\n\n # Implements atcoder::segtree.prod(l, r)\n def [](range : Range(Int, Int))\n a = range.begin\n b = range.exclusive? ? range.end : range.end + 1\n get_value(a, b, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n def get_value(a : Int, b : Int, segment_index : Int, range : Range(Int, Int))\n if range.end <= a || b <= range.begin\n return nil\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = get_value(a, b, 2 * segment_index + 1, range.begin...range_median)\n child2 = get_value(a, b, 2 * segment_index + 2, range_median...range.end)\n\n operate(child1, child2)\n end\n\n # compatibility with ac-library\n\n # Implements atcoder::segtree.set(index, value)\n # alias of `.[]=`\n def set(index : Int, value : T)\n self.[]=(index, value)\n end\n\n # Implements atcoder::segtree.get(index)\n # alias of `.[]`\n def get(index : Int)\n self.[](index)\n end\n\n # Implements atcoder::segtree.prod(left, right)\n def prod(left : Int, right : Int)\n self.[](left...right)\n end\n\n # Implements atcoder::segtree.all_prod(l, r)\n def all_prod\n self.[](0...@values.size)\n end\n\n # FIXME: Unimplemented\n def max_right\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def max_left\n raise NotImplementedError.new\n end\n end\nend\n\nw, n = read_line.split.map(&.to_i)\nseg = AtCoder::SegTree.new([0i64] + [-1i64] * w) { |a, b| {a, b}.max }\nn.times do\n l, r, v = read_line.split.map(&.to_i)\n (0..w).reverse_each do |i|\n ll, rr = i - r, i - l\n if 0 <= rr\n val = seg[{0, ll}.max..rr]\n seg[i] = {seg[i], val + v}.max if val != -1\n end\n end\nend\nputs seg[w]\n" }, { "id": 220, "name": "037", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass RangeMax {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector dat;\n\n\n\n\tvoid init(int sz) {\n\n\t\twhile (size_ <= sz) size_ *= 2;\n\n\t\tdat.resize(size_ * 2, -(1LL << 60));\n\n\t}\n\n\tvoid update(int pos, long long x) {\n\n\t\tpos += size_;\n\n\t\tdat[pos] = x;\n\n\t\twhile (pos >= 2) {\n\n\t\t\tpos >>= 1;\n\n\t\t\tdat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);\n\n\t\t}\n\n\t}\n\n\tlong long query_(int l, int r, int a, int b, int u) {\n\n\t\tif (l <= a && b <= r) return dat[u];\n\n\t\tif (r <= a || b <= l) return -(1LL << 60);\n\n\t\tlong long v1 = query_(l, r, a, (a + b) >> 1, u * 2);\n\n\t\tlong long v2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);\n\n\t\treturn max(v1, v2);\n\n\t}\n\n\tlong long query(int l, int r) {\n\n\t\treturn query_(l, r, 0, size_, 1);\n\n\t}\n\n};\n\n\n\nlong long W, N;\n\nlong long L[1 << 18], R[1 << 18], V[1 << 18];\n\nlong long dp[509][10009];\n\nRangeMax Z[509];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> W >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> L[i] >> R[i] >> V[i];\n\n\n\n\t// Step #2. 初期化\n\n\tfor (int i = 0; i <= N; i++) {\n\n\t\tfor (int j = 0; j <= W; j++) dp[i][j] = -(1LL << 60);\n\n\t\tZ[i].init(W + 2);\n\n\t}\n\n\tdp[0][0] = 0;\n\n\tZ[0].update(0, 0);\n\n\n\n\t// Step #3. 動的計画法\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 0; j <= W; j++) dp[i][j] = dp[i - 1][j];\n\n\t\tfor (int j = 0; j <= W; j++) {\n\n\t\t\tint cl = max(0, j - (int)R[i]), cr = max(0, j - (int)L[i] + 1);\n\n\t\t\tif (cl == cr) continue;\n\n\t\t\tlong long val = Z[i - 1].query(cl, cr);\n\n\t\t\tif (val != -(1LL << 60)) {\n\n\t\t\t\tdp[i][j] = max(dp[i][j], val + V[i]);\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor (int j = 0; j <= W; j++) Z[i].update(j, dp[i][j]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tif (dp[N][W] == -(1LL << 60)) cout << \"-1\" << endl;\n\n\telse cout << dp[N][W] << endl;\n\n\treturn 0;\n\n}", "Python": "import sys\nfrom collections import defaultdict, Counter, deque\nfrom itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate\nimport operator\nfrom math import sqrt, gcd, factorial\n# from math import isqrt, prod,comb # python3.8用(notpypy)\n#from bisect import bisect_left,bisect_right\n#from functools import lru_cache,reduce\n#from heapq import heappush,heappop,heapify,heappushpop,heapreplace\n#import numpy as np\n#import networkx as nx\n#from networkx.utils import UnionFind\n#from numba import njit, b1, i1, i4, i8, f8\n#from scipy.sparse import csr_matrix\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError\n# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1\ndef input(): return sys.stdin.readline().rstrip()\ndef divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\n\nclass SparceTable:\n def __init__(self, A, op=min, e=10**10):\n self.n = len(A)\n self.op = op\n self.e = e\n self.table = [None]*(len(A).bit_length()) # [i, i+2^k)のop\n self.table[0] = A\n pre_table = A\n k = 0\n for k in range(len(A).bit_length()-1):\n pre_table = self.table[k]\n self.table[k+1] = [op(pre_table[i], pre_table[i+(1 << k)])\n for i in range(len(pre_table)-(1 << k))]\n k += 1\n\n # [l, r)のop\n def query(self, l, r):\n l = min(max(0, l),self.n)\n r = min(max(0, r),self.n)\n if l == r:\n return self.e\n\n k = (r-l).bit_length()-1\n return self.op(self.table[k][l], self.table[k][r-(1 << k)])\n\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n w, n = map(int, input().split())\n c=[-10**15]*(w+1)\n c[0]=0\n dp = SparceTable(c, op=max, e=-10**15)\n for _ in range(n):\n l, r, v = map(int, input().split())\n newdp=[0]*(w+1)\n for i in range(w+1):\n newdp[i]=max(dp.query(i-r,i-l+1)+v,dp.query(i,i+1))\n dp=SparceTable(newdp,op=max,e=-10**15)\n #print(newdp)\n print(max(-1,dp.query(w,w+1)))\n\n\nif __name__ == '__main__':\n main()" }, { "id": 221, "name": "037", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass RangeMax {\n\npublic:\n\n\tint size_ = 1;\n\n\tvector dat;\n\n\n\n\tvoid init(int sz) {\n\n\t\twhile (size_ <= sz) size_ *= 2;\n\n\t\tdat.resize(size_ * 2, -(1LL << 60));\n\n\t}\n\n\tvoid update(int pos, long long x) {\n\n\t\tpos += size_;\n\n\t\tdat[pos] = x;\n\n\t\twhile (pos >= 2) {\n\n\t\t\tpos >>= 1;\n\n\t\t\tdat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);\n\n\t\t}\n\n\t}\n\n\tlong long query_(int l, int r, int a, int b, int u) {\n\n\t\tif (l <= a && b <= r) return dat[u];\n\n\t\tif (r <= a || b <= l) return -(1LL << 60);\n\n\t\tlong long v1 = query_(l, r, a, (a + b) >> 1, u * 2);\n\n\t\tlong long v2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);\n\n\t\treturn max(v1, v2);\n\n\t}\n\n\tlong long query(int l, int r) {\n\n\t\treturn query_(l, r, 0, size_, 1);\n\n\t}\n\n};\n\n\n\nlong long W, N;\n\nlong long L[1 << 18], R[1 << 18], V[1 << 18];\n\nlong long dp[509][10009];\n\nRangeMax Z[509];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> W >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> L[i] >> R[i] >> V[i];\n\n\n\n\t// Step #2. 初期化\n\n\tfor (int i = 0; i <= N; i++) {\n\n\t\tfor (int j = 0; j <= W; j++) dp[i][j] = -(1LL << 60);\n\n\t\tZ[i].init(W + 2);\n\n\t}\n\n\tdp[0][0] = 0;\n\n\tZ[0].update(0, 0);\n\n\n\n\t// Step #3. 動的計画法\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 0; j <= W; j++) dp[i][j] = dp[i - 1][j];\n\n\t\tfor (int j = 0; j <= W; j++) {\n\n\t\t\tint cl = max(0, j - (int)R[i]), cr = max(0, j - (int)L[i] + 1);\n\n\t\t\tif (cl == cr) continue;\n\n\t\t\tlong long val = Z[i - 1].query(cl, cr);\n\n\t\t\tif (val != -(1LL << 60)) {\n\n\t\t\t\tdp[i][j] = max(dp[i][j], val + V[i]);\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor (int j = 0; j <= W; j++) Z[i].update(j, dp[i][j]);\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tif (dp[N][W] == -(1LL << 60)) cout << \"-1\" << endl;\n\n\telse cout << dp[N][W] << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar w: int :: cui@inputInt()\n\tvar n: int :: cui@inputInt()\n\tvar l: []int :: #[n]int\n\tvar r: []int :: #[n]int\n\tvar v: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo l[i] :: cui@inputInt()\n\t\tdo r[i] :: cui@inputInt()\n\t\tdo v[i] :: cui@inputInt()\n\tend for\n\t\n\tvar dp: [][]int :: #[n + 1, w + 1]int\n\tfor j(0, w)\n\t\tdo dp[0][j] :: lib@intMin\n\tend for\n\tdo dp[0][0] :: 0\n\tfor i(0, n - 1)\n\t\tvar seg: @SegmentTree :: (#@SegmentTree).init(w + 1)\n\t\tfor j(0, w)\n\t\t\tdo seg.update(j, dp[i][j])\n\t\tend for\n\t\tfor j(0, w)\n\t\t\tvar val: int :: seg.query([j - r[i], 0].max(), j - l[i] + 1)\n\t\t\tdo dp[i + 1][j] :: lib@max(dp[i][j], val + v[i])\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: [dp[n][w], -1].max()\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n\nclass SegmentTree()\n\tconst invalid: int :: lib@intMin\n\tvar size: int\n\tvar node: []int\n\t+func init(n: int): SegmentTree\n\t\tdo me.size :: 1\n\t\twhile(me.size < n)\n\t\t\tdo me.size :* 2\n\t\tend while\n\t\tdo me.node :: #[2 * me.size]int\n\t\tfor i(0, 2 * me.size - 1)\n\t\t\tdo me.node[i] :: invalid\n\t\tend for\n\t\tret me\n\tend func\n\t+func update(idx: int, val: int)\n\t\tdo idx :+ me.size - 1\n\t\tdo me.node[idx] :: val\n\t\twhile(idx > 0)\n\t\t\tdo idx :: (idx - 1) / 2\n\t\t\tdo me.node[idx] :: lib@max(me.node[2 * idx + 1], me.node[2 * idx + 2])\n\t\tend while\n\tend func\n\t+func query(a: int, b: int): int\n\t\tret me.querySub(a, b, 0, 0, me.size)\n\tend func\n\tfunc querySub(a: int, b: int, k: int, l: int, r: int): int\n\t\tif(b <= l | r <= a)\n\t\t\tret invalid\n\t\tend if\n\t\tif(a <= l & r <= b)\n\t\t\tret me.node[k]\n\t\tend if\n\t\tvar vl: int :: me.querySub(a, b, 2 * k + 1, l, (l + r) / 2)\n\t\tvar vr: int :: me.querySub(a, b, 2 * k + 2, (l + r) / 2, r)\n\t\tret lib@max(vl, vr)\n\tend func\n\t+*func toStr(): []char\n\t\tvar padding: int :: 1\n\t\twhile(padding <= me.size)\n\t\t\tdo padding :* 2\n\t\tend while\n\t\tdo padding :- 1\n\t\tvar res: []char :: \"\"\n\t\tvar s: int :: 0\n\t\tvar e: int :: 0\n\t\tvar n: int :: 1\n\t\tconst digit: int :: 6\n\t\tvar fmt: []char :: \" \\{digit}d\"\n\t\tvar strInf: []char :: \" \".repeat(digit - 3) ~ \"inf\"\n\t\twhile(padding > 0)\n\t\t\tdo padding :/ 2\n\t\t\tfor i(s, e)\n\t\t\t\tdo res :~ \" \".repeat((digit + 1) * padding)\n\t\t\t\tdo res :~ \"\\{me.node[i] = invalid ?(strInf, me.node[i].toStrFmt(fmt))}|\"\n\t\t\tend for\n\t\t\tdo res :~ \"\\n\"\n\t\t\tdo n :* 2\n\t\t\tdo s :: e + 1\n\t\t\tdo e :: s + n - 1\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 222, "name": "037", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::segtree](https://atcoder.github.io/ac-library/master/document_en/segtree.html).\n #\n # The identity element will be implicitly defined as nil, so you don't\n # have to manually define it. In the other words, you cannot include\n # nil into an element of the monoid.\n #\n # ```\n # tree = AtCoder::SegTree.new((0...100).to_a) { |a, b| [a, b].min }\n # tree[10...50] # => 10\n # ```\n class SegTree(T)\n property values : Array(T)\n\n def initialize(values : Array(T))\n initialize(values) { |a, b| a > b ? a : b }\n end\n\n def initialize(values : Array(T), &@operator : T, T -> T)\n @values = values\n @segments = Array(T | Nil).new(2 ** ::Math.log2(values.size).ceil.to_i - 1, nil)\n\n # initialize segments\n (@segments.size - 1).downto(0) do |i|\n child1 = nil.as(T | Nil)\n child2 = nil.as(T | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n end\n end\n\n @[AlwaysInline]\n private def operate(a : T | Nil, b : T | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @operator.call(a, b)\n end\n end\n\n # Implements atcoder::segtree.set(index, value)\n def []=(index : Int, value : T)\n @values[index] = value\n\n parent_index = (index + @segments.size - 1) // 2\n while parent_index >= 0\n i = parent_index\n child1 = nil.as(T | Nil)\n child2 = nil.as(T | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n parent_index = (parent_index - 1) // 2\n end\n end\n\n # Implements atcoder::segtree.get(index)\n def [](index : Int)\n @values[index]\n end\n\n # Implements atcoder::segtree.prod(l, r)\n def [](range : Range(Int, Int))\n a = range.begin\n b = range.exclusive? ? range.end : range.end + 1\n get_value(a, b, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n def get_value(a : Int, b : Int, segment_index : Int, range : Range(Int, Int))\n if range.end <= a || b <= range.begin\n return nil\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = get_value(a, b, 2 * segment_index + 1, range.begin...range_median)\n child2 = get_value(a, b, 2 * segment_index + 2, range_median...range.end)\n\n operate(child1, child2)\n end\n\n # compatibility with ac-library\n\n # Implements atcoder::segtree.set(index, value)\n # alias of `.[]=`\n def set(index : Int, value : T)\n self.[]=(index, value)\n end\n\n # Implements atcoder::segtree.get(index)\n # alias of `.[]`\n def get(index : Int)\n self.[](index)\n end\n\n # Implements atcoder::segtree.prod(left, right)\n def prod(left : Int, right : Int)\n self.[](left...right)\n end\n\n # Implements atcoder::segtree.all_prod(l, r)\n def all_prod\n self.[](0...@values.size)\n end\n\n # FIXME: Unimplemented\n def max_right\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def max_left\n raise NotImplementedError.new\n end\n end\nend\n\nw, n = read_line.split.map(&.to_i)\nseg = AtCoder::SegTree.new([0i64] + [-1i64] * w) { |a, b| {a, b}.max }\nn.times do\n l, r, v = read_line.split.map(&.to_i)\n (0..w).reverse_each do |i|\n ll, rr = i - r, i - l\n if 0 <= rr\n val = seg[{0, ll}.max..rr]\n seg[i] = {seg[i], val + v}.max if val != -1\n end\n end\nend\nputs seg[w]\n", "Python": "import sys\nfrom collections import defaultdict, Counter, deque\nfrom itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate\nimport operator\nfrom math import sqrt, gcd, factorial\n# from math import isqrt, prod,comb # python3.8用(notpypy)\n#from bisect import bisect_left,bisect_right\n#from functools import lru_cache,reduce\n#from heapq import heappush,heappop,heapify,heappushpop,heapreplace\n#import numpy as np\n#import networkx as nx\n#from networkx.utils import UnionFind\n#from numba import njit, b1, i1, i4, i8, f8\n#from scipy.sparse import csr_matrix\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError\n# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1\ndef input(): return sys.stdin.readline().rstrip()\ndef divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\n\nclass SparceTable:\n def __init__(self, A, op=min, e=10**10):\n self.n = len(A)\n self.op = op\n self.e = e\n self.table = [None]*(len(A).bit_length()) # [i, i+2^k)のop\n self.table[0] = A\n pre_table = A\n k = 0\n for k in range(len(A).bit_length()-1):\n pre_table = self.table[k]\n self.table[k+1] = [op(pre_table[i], pre_table[i+(1 << k)])\n for i in range(len(pre_table)-(1 << k))]\n k += 1\n\n # [l, r)のop\n def query(self, l, r):\n l = min(max(0, l),self.n)\n r = min(max(0, r),self.n)\n if l == r:\n return self.e\n\n k = (r-l).bit_length()-1\n return self.op(self.table[k][l], self.table[k][r-(1 << k)])\n\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n w, n = map(int, input().split())\n c=[-10**15]*(w+1)\n c[0]=0\n dp = SparceTable(c, op=max, e=-10**15)\n for _ in range(n):\n l, r, v = map(int, input().split())\n newdp=[0]*(w+1)\n for i in range(w+1):\n newdp[i]=max(dp.query(i-r,i-l+1)+v,dp.query(i,i+1))\n dp=SparceTable(newdp,op=max,e=-10**15)\n #print(newdp)\n print(max(-1,dp.query(w,w+1)))\n\n\nif __name__ == '__main__':\n main()" }, { "id": 223, "name": "037", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::segtree](https://atcoder.github.io/ac-library/master/document_en/segtree.html).\n #\n # The identity element will be implicitly defined as nil, so you don't\n # have to manually define it. In the other words, you cannot include\n # nil into an element of the monoid.\n #\n # ```\n # tree = AtCoder::SegTree.new((0...100).to_a) { |a, b| [a, b].min }\n # tree[10...50] # => 10\n # ```\n class SegTree(T)\n property values : Array(T)\n\n def initialize(values : Array(T))\n initialize(values) { |a, b| a > b ? a : b }\n end\n\n def initialize(values : Array(T), &@operator : T, T -> T)\n @values = values\n @segments = Array(T | Nil).new(2 ** ::Math.log2(values.size).ceil.to_i - 1, nil)\n\n # initialize segments\n (@segments.size - 1).downto(0) do |i|\n child1 = nil.as(T | Nil)\n child2 = nil.as(T | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n end\n end\n\n @[AlwaysInline]\n private def operate(a : T | Nil, b : T | Nil)\n if a.nil?\n b\n elsif b.nil?\n a\n else\n @operator.call(a, b)\n end\n end\n\n # Implements atcoder::segtree.set(index, value)\n def []=(index : Int, value : T)\n @values[index] = value\n\n parent_index = (index + @segments.size - 1) // 2\n while parent_index >= 0\n i = parent_index\n child1 = nil.as(T | Nil)\n child2 = nil.as(T | Nil)\n if i * 2 + 1 < @segments.size\n child1 = @segments[i * 2 + 1]\n child2 = @segments[i * 2 + 2]\n else\n if i * 2 + 1 - @segments.size < @values.size\n child1 = @values[i * 2 + 1 - @segments.size]\n end\n if i * 2 + 2 - @segments.size < @values.size\n child2 = @values[i * 2 + 2 - @segments.size]\n end\n end\n @segments[i] = operate(child1, child2)\n parent_index = (parent_index - 1) // 2\n end\n end\n\n # Implements atcoder::segtree.get(index)\n def [](index : Int)\n @values[index]\n end\n\n # Implements atcoder::segtree.prod(l, r)\n def [](range : Range(Int, Int))\n a = range.begin\n b = range.exclusive? ? range.end : range.end + 1\n get_value(a, b, 0, 0...(@segments.size + 1)).not_nil!\n end\n\n def get_value(a : Int, b : Int, segment_index : Int, range : Range(Int, Int))\n if range.end <= a || b <= range.begin\n return nil\n end\n\n if a <= range.begin && range.end <= b\n if segment_index < @segments.size\n return @segments[segment_index]\n else\n return @values[segment_index - @segments.size]\n end\n end\n\n range_median = (range.begin + range.end) // 2\n child1 = get_value(a, b, 2 * segment_index + 1, range.begin...range_median)\n child2 = get_value(a, b, 2 * segment_index + 2, range_median...range.end)\n\n operate(child1, child2)\n end\n\n # compatibility with ac-library\n\n # Implements atcoder::segtree.set(index, value)\n # alias of `.[]=`\n def set(index : Int, value : T)\n self.[]=(index, value)\n end\n\n # Implements atcoder::segtree.get(index)\n # alias of `.[]`\n def get(index : Int)\n self.[](index)\n end\n\n # Implements atcoder::segtree.prod(left, right)\n def prod(left : Int, right : Int)\n self.[](left...right)\n end\n\n # Implements atcoder::segtree.all_prod(l, r)\n def all_prod\n self.[](0...@values.size)\n end\n\n # FIXME: Unimplemented\n def max_right\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def max_left\n raise NotImplementedError.new\n end\n end\nend\n\nw, n = read_line.split.map(&.to_i)\nseg = AtCoder::SegTree.new([0i64] + [-1i64] * w) { |a, b| {a, b}.max }\nn.times do\n l, r, v = read_line.split.map(&.to_i)\n (0..w).reverse_each do |i|\n ll, rr = i - r, i - l\n if 0 <= rr\n val = seg[{0, ll}.max..rr]\n seg[i] = {seg[i], val + v}.max if val != -1\n end\n end\nend\nputs seg[w]\n", "Kuin": "func main()\n\tvar w: int :: cui@inputInt()\n\tvar n: int :: cui@inputInt()\n\tvar l: []int :: #[n]int\n\tvar r: []int :: #[n]int\n\tvar v: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo l[i] :: cui@inputInt()\n\t\tdo r[i] :: cui@inputInt()\n\t\tdo v[i] :: cui@inputInt()\n\tend for\n\t\n\tvar dp: [][]int :: #[n + 1, w + 1]int\n\tfor j(0, w)\n\t\tdo dp[0][j] :: lib@intMin\n\tend for\n\tdo dp[0][0] :: 0\n\tfor i(0, n - 1)\n\t\tvar seg: @SegmentTree :: (#@SegmentTree).init(w + 1)\n\t\tfor j(0, w)\n\t\t\tdo seg.update(j, dp[i][j])\n\t\tend for\n\t\tfor j(0, w)\n\t\t\tvar val: int :: seg.query([j - r[i], 0].max(), j - l[i] + 1)\n\t\t\tdo dp[i + 1][j] :: lib@max(dp[i][j], val + v[i])\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: [dp[n][w], -1].max()\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n\nclass SegmentTree()\n\tconst invalid: int :: lib@intMin\n\tvar size: int\n\tvar node: []int\n\t+func init(n: int): SegmentTree\n\t\tdo me.size :: 1\n\t\twhile(me.size < n)\n\t\t\tdo me.size :* 2\n\t\tend while\n\t\tdo me.node :: #[2 * me.size]int\n\t\tfor i(0, 2 * me.size - 1)\n\t\t\tdo me.node[i] :: invalid\n\t\tend for\n\t\tret me\n\tend func\n\t+func update(idx: int, val: int)\n\t\tdo idx :+ me.size - 1\n\t\tdo me.node[idx] :: val\n\t\twhile(idx > 0)\n\t\t\tdo idx :: (idx - 1) / 2\n\t\t\tdo me.node[idx] :: lib@max(me.node[2 * idx + 1], me.node[2 * idx + 2])\n\t\tend while\n\tend func\n\t+func query(a: int, b: int): int\n\t\tret me.querySub(a, b, 0, 0, me.size)\n\tend func\n\tfunc querySub(a: int, b: int, k: int, l: int, r: int): int\n\t\tif(b <= l | r <= a)\n\t\t\tret invalid\n\t\tend if\n\t\tif(a <= l & r <= b)\n\t\t\tret me.node[k]\n\t\tend if\n\t\tvar vl: int :: me.querySub(a, b, 2 * k + 1, l, (l + r) / 2)\n\t\tvar vr: int :: me.querySub(a, b, 2 * k + 2, (l + r) / 2, r)\n\t\tret lib@max(vl, vr)\n\tend func\n\t+*func toStr(): []char\n\t\tvar padding: int :: 1\n\t\twhile(padding <= me.size)\n\t\t\tdo padding :* 2\n\t\tend while\n\t\tdo padding :- 1\n\t\tvar res: []char :: \"\"\n\t\tvar s: int :: 0\n\t\tvar e: int :: 0\n\t\tvar n: int :: 1\n\t\tconst digit: int :: 6\n\t\tvar fmt: []char :: \" \\{digit}d\"\n\t\tvar strInf: []char :: \" \".repeat(digit - 3) ~ \"inf\"\n\t\twhile(padding > 0)\n\t\t\tdo padding :/ 2\n\t\t\tfor i(s, e)\n\t\t\t\tdo res :~ \" \".repeat((digit + 1) * padding)\n\t\t\t\tdo res :~ \"\\{me.node[i] = invalid ?(strInf, me.node[i].toStrFmt(fmt))}|\"\n\t\t\tend for\n\t\t\tdo res :~ \"\\n\"\n\t\t\tdo n :* 2\n\t\t\tdo s :: e + 1\n\t\t\tdo e :: s + n - 1\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 224, "name": "037", "Python": "import sys\nfrom collections import defaultdict, Counter, deque\nfrom itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate\nimport operator\nfrom math import sqrt, gcd, factorial\n# from math import isqrt, prod,comb # python3.8用(notpypy)\n#from bisect import bisect_left,bisect_right\n#from functools import lru_cache,reduce\n#from heapq import heappush,heappop,heapify,heappushpop,heapreplace\n#import numpy as np\n#import networkx as nx\n#from networkx.utils import UnionFind\n#from numba import njit, b1, i1, i4, i8, f8\n#from scipy.sparse import csr_matrix\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError\n# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1\ndef input(): return sys.stdin.readline().rstrip()\ndef divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\n\nclass SparceTable:\n def __init__(self, A, op=min, e=10**10):\n self.n = len(A)\n self.op = op\n self.e = e\n self.table = [None]*(len(A).bit_length()) # [i, i+2^k)のop\n self.table[0] = A\n pre_table = A\n k = 0\n for k in range(len(A).bit_length()-1):\n pre_table = self.table[k]\n self.table[k+1] = [op(pre_table[i], pre_table[i+(1 << k)])\n for i in range(len(pre_table)-(1 << k))]\n k += 1\n\n # [l, r)のop\n def query(self, l, r):\n l = min(max(0, l),self.n)\n r = min(max(0, r),self.n)\n if l == r:\n return self.e\n\n k = (r-l).bit_length()-1\n return self.op(self.table[k][l], self.table[k][r-(1 << k)])\n\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n w, n = map(int, input().split())\n c=[-10**15]*(w+1)\n c[0]=0\n dp = SparceTable(c, op=max, e=-10**15)\n for _ in range(n):\n l, r, v = map(int, input().split())\n newdp=[0]*(w+1)\n for i in range(w+1):\n newdp[i]=max(dp.query(i-r,i-l+1)+v,dp.query(i,i+1))\n dp=SparceTable(newdp,op=max,e=-10**15)\n #print(newdp)\n print(max(-1,dp.query(w,w+1)))\n\n\nif __name__ == '__main__':\n main()", "Kuin": "func main()\n\tvar w: int :: cui@inputInt()\n\tvar n: int :: cui@inputInt()\n\tvar l: []int :: #[n]int\n\tvar r: []int :: #[n]int\n\tvar v: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo l[i] :: cui@inputInt()\n\t\tdo r[i] :: cui@inputInt()\n\t\tdo v[i] :: cui@inputInt()\n\tend for\n\t\n\tvar dp: [][]int :: #[n + 1, w + 1]int\n\tfor j(0, w)\n\t\tdo dp[0][j] :: lib@intMin\n\tend for\n\tdo dp[0][0] :: 0\n\tfor i(0, n - 1)\n\t\tvar seg: @SegmentTree :: (#@SegmentTree).init(w + 1)\n\t\tfor j(0, w)\n\t\t\tdo seg.update(j, dp[i][j])\n\t\tend for\n\t\tfor j(0, w)\n\t\t\tvar val: int :: seg.query([j - r[i], 0].max(), j - l[i] + 1)\n\t\t\tdo dp[i + 1][j] :: lib@max(dp[i][j], val + v[i])\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: [dp[n][w], -1].max()\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n\nclass SegmentTree()\n\tconst invalid: int :: lib@intMin\n\tvar size: int\n\tvar node: []int\n\t+func init(n: int): SegmentTree\n\t\tdo me.size :: 1\n\t\twhile(me.size < n)\n\t\t\tdo me.size :* 2\n\t\tend while\n\t\tdo me.node :: #[2 * me.size]int\n\t\tfor i(0, 2 * me.size - 1)\n\t\t\tdo me.node[i] :: invalid\n\t\tend for\n\t\tret me\n\tend func\n\t+func update(idx: int, val: int)\n\t\tdo idx :+ me.size - 1\n\t\tdo me.node[idx] :: val\n\t\twhile(idx > 0)\n\t\t\tdo idx :: (idx - 1) / 2\n\t\t\tdo me.node[idx] :: lib@max(me.node[2 * idx + 1], me.node[2 * idx + 2])\n\t\tend while\n\tend func\n\t+func query(a: int, b: int): int\n\t\tret me.querySub(a, b, 0, 0, me.size)\n\tend func\n\tfunc querySub(a: int, b: int, k: int, l: int, r: int): int\n\t\tif(b <= l | r <= a)\n\t\t\tret invalid\n\t\tend if\n\t\tif(a <= l & r <= b)\n\t\t\tret me.node[k]\n\t\tend if\n\t\tvar vl: int :: me.querySub(a, b, 2 * k + 1, l, (l + r) / 2)\n\t\tvar vr: int :: me.querySub(a, b, 2 * k + 2, (l + r) / 2, r)\n\t\tret lib@max(vl, vr)\n\tend func\n\t+*func toStr(): []char\n\t\tvar padding: int :: 1\n\t\twhile(padding <= me.size)\n\t\t\tdo padding :* 2\n\t\tend while\n\t\tdo padding :- 1\n\t\tvar res: []char :: \"\"\n\t\tvar s: int :: 0\n\t\tvar e: int :: 0\n\t\tvar n: int :: 1\n\t\tconst digit: int :: 6\n\t\tvar fmt: []char :: \" \\{digit}d\"\n\t\tvar strInf: []char :: \" \".repeat(digit - 3) ~ \"inf\"\n\t\twhile(padding > 0)\n\t\t\tdo padding :/ 2\n\t\t\tfor i(s, e)\n\t\t\t\tdo res :~ \" \".repeat((digit + 1) * padding)\n\t\t\t\tdo res :~ \"\\{me.node[i] = invalid ?(strInf, me.node[i].toStrFmt(fmt))}|\"\n\t\t\tend for\n\t\t\tdo res :~ \"\\n\"\n\t\t\tdo n :* 2\n\t\t\tdo s :: e + 1\n\t\t\tdo e :: s + n - 1\n\t\tend while\n\t\tret res\n\tend func\nend class\n" }, { "id": 225, "name": "038", "Crystal": "require \"big\"\na, b = read_line.split.map(&.to_big_i)\nlcm = a.lcm(b)\nputs lcm <= 10i64**18 ? lcm : \"Large\"\n", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nint main() {\n\n\tlong long A, B, THRESHOLD = 1000000000000000000LL;\n\n\tcin >> A >> B;\n\n\n\n\tlong long C = A / gcd(A, B);\n\n\tif (B <= THRESHOLD / C) cout << C * B << endl;\n\n\telse cout << \"Large\" << endl;\n\n\treturn 0;\n\n}" }, { "id": 226, "name": "038", "Crystal": "require \"big\"\na, b = read_line.split.map(&.to_big_i)\nlcm = a.lcm(b)\nputs lcm <= 10i64**18 ? lcm : \"Large\"\n", "Python": "from math import gcd\n\na, b = map(int, input().split())\n\nans = a//gcd(a, b)*b\n\nif ans > int(pow(10, 18)):\n print('Large')\nelse:\n print(ans)\n" }, { "id": 227, "name": "038", "Crystal": "require \"big\"\na, b = read_line.split.map(&.to_big_i)\nlcm = a.lcm(b)\nputs lcm <= 10i64**18 ? lcm : \"Large\"\n", "Ruby": "MAX = 10 ** 18\n\na, b = readline.split.map(&:to_i)\nlcm = a.lcm(b)\nputs (lcm <= MAX) ? lcm : 'Large'\n" }, { "id": 228, "name": "038", "Crystal": "require \"big\"\na, b = read_line.split.map(&.to_big_i)\nlcm = a.lcm(b)\nputs lcm <= 10i64**18 ? lcm : \"Large\"\n", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar v: int :: b / math@gcd(a, b)\n\tvar ans: int :: a\n\tif(ans > 10 ^ 18 / v)\n\t\tdo cui@print(\"Large\\n\")\n\t\tret\n\tend if\n\tdo ans :* v\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 229, "name": "038", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nint main() {\n\n\tlong long A, B, THRESHOLD = 1000000000000000000LL;\n\n\tcin >> A >> B;\n\n\n\n\tlong long C = A / gcd(A, B);\n\n\tif (B <= THRESHOLD / C) cout << C * B << endl;\n\n\telse cout << \"Large\" << endl;\n\n\treturn 0;\n\n}", "Python": "from math import gcd\n\na, b = map(int, input().split())\n\nans = a//gcd(a, b)*b\n\nif ans > int(pow(10, 18)):\n print('Large')\nelse:\n print(ans)\n" }, { "id": 230, "name": "038", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nint main() {\n\n\tlong long A, B, THRESHOLD = 1000000000000000000LL;\n\n\tcin >> A >> B;\n\n\n\n\tlong long C = A / gcd(A, B);\n\n\tif (B <= THRESHOLD / C) cout << C * B << endl;\n\n\telse cout << \"Large\" << endl;\n\n\treturn 0;\n\n}", "Ruby": "MAX = 10 ** 18\n\na, b = readline.split.map(&:to_i)\nlcm = a.lcm(b)\nputs (lcm <= MAX) ? lcm : 'Large'\n" }, { "id": 231, "name": "038", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nint main() {\n\n\tlong long A, B, THRESHOLD = 1000000000000000000LL;\n\n\tcin >> A >> B;\n\n\n\n\tlong long C = A / gcd(A, B);\n\n\tif (B <= THRESHOLD / C) cout << C * B << endl;\n\n\telse cout << \"Large\" << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar v: int :: b / math@gcd(a, b)\n\tvar ans: int :: a\n\tif(ans > 10 ^ 18 / v)\n\t\tdo cui@print(\"Large\\n\")\n\t\tret\n\tend if\n\tdo ans :* v\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 232, "name": "038", "Python": "from math import gcd\n\na, b = map(int, input().split())\n\nans = a//gcd(a, b)*b\n\nif ans > int(pow(10, 18)):\n print('Large')\nelse:\n print(ans)\n", "Ruby": "MAX = 10 ** 18\n\na, b = readline.split.map(&:to_i)\nlcm = a.lcm(b)\nputs (lcm <= MAX) ? lcm : 'Large'\n" }, { "id": 233, "name": "038", "Python": "from math import gcd\n\na, b = map(int, input().split())\n\nans = a//gcd(a, b)*b\n\nif ans > int(pow(10, 18)):\n print('Large')\nelse:\n print(ans)\n", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar v: int :: b / math@gcd(a, b)\n\tvar ans: int :: a\n\tif(ans > 10 ^ 18 / v)\n\t\tdo cui@print(\"Large\\n\")\n\t\tret\n\tend if\n\tdo ans :* v\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 234, "name": "038", "Ruby": "MAX = 10 ** 18\n\na, b = readline.split.map(&:to_i)\nlcm = a.lcm(b)\nputs (lcm <= MAX) ? lcm : 'Large'\n", "Kuin": "func main()\n\tvar a: int :: cui@inputInt()\n\tvar b: int :: cui@inputInt()\n\tvar v: int :: b / math@gcd(a, b)\n\tvar ans: int :: a\n\tif(ans > 10 ^ 18 / v)\n\t\tdo cui@print(\"Large\\n\")\n\t\tret\n\tend if\n\tdo ans :* v\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 235, "name": "039", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def subtree_size_dfs(v : Int32, p : Int32, result : Array(Int32)) : Int32\n result[v] = 1 + self[v].sum do |u|\n u != p ? subtree_size_dfs(u, v, result) : 0\n end\n end\n\n def subtree_size(root : Int32)\n result = Array.new(size, 0)\n subtree_size_dfs(root, -1, result)\n result\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\nputs graph.subtree_size(0).skip(1).sum { |size|\n size.to_i64 * (n - size)\n}\n", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N;\n\nlong long A[1 << 18], B[1 << 18];\n\nlong long dp[1 << 18];\n\nvector G[1 << 18];\n\n\n\nvoid dfs(int pos, int pre) {\n\n\tdp[pos] = 1;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (i == pre) continue;\n\n\t\tdfs(i, pos);\n\n\t\tdp[pos] += dp[i];\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. �[‚³—D�æ’T�õ�iDFS�j\n\n\tdfs(1, -1);\n\n\n\n\t// Step #3. “š‚¦‚ğ‹�‚ß‚é\n\n\tlong long Answer = 0;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tlong long r = min(dp[A[i]], dp[B[i]]);\n\n\t\tAnswer += r * (N - r);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}" }, { "id": 236, "name": "039", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n private def subtree_size_dfs(v : Int32, p : Int32, result : Array(Int32)) : Int32\n result[v] = 1 + self[v].sum do |u|\n u != p ? subtree_size_dfs(u, v, result) : 0\n end\n end\n\n def subtree_size(root : Int32)\n result = Array.new(size, 0)\n subtree_size_dfs(root, -1, result)\n result\n end\nend\n\nn = read_line.to_i\ngraph = UnweightedGraph.new(n)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph.add_edge(a, b)\nend\nputs graph.subtree_size(0).skip(1).sum { |size|\n size.to_i64 * (n - size)\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar a: []int :: #[n]int\n\tdo dfs(graph, 0, -1, a)\n\tvar ans: int :: 0\n\tfor u(0, n - 1)\n\t\tdo graph[u].head()\n\t\twhile(!graph[u].term())\n\t\t\tvar v: int :: graph[u].get()\n\t\t\tvar min: int :: [a[u], a[v]].min()\n\t\t\tdo ans :+ min * (n - min)\n\t\t\tdo graph[u].next()\n\t\tend while\n\tend for\n\tdo ans :/ 2\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs(graph: []list, u: int, p: int, a: []int)\n\t\tdo a[u] :: 1\n\t\tdo graph[u].head()\n\t\twhile(!graph[u].term())\n\t\t\tvar v: int :: graph[u].get()\n\t\t\tif(v <> p)\n\t\t\t\tdo dfs(graph, v, u, a)\n\t\t\t\tdo a[u] :+ a[v]\n\t\t\tend if\n\t\t\tdo graph[u].next()\n\t\tend while\n\tend func\nend func\n" }, { "id": 237, "name": "039", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N;\n\nlong long A[1 << 18], B[1 << 18];\n\nlong long dp[1 << 18];\n\nvector G[1 << 18];\n\n\n\nvoid dfs(int pos, int pre) {\n\n\tdp[pos] = 1;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (i == pre) continue;\n\n\t\tdfs(i, pos);\n\n\t\tdp[pos] += dp[i];\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. �[‚³—D�æ’T�õ�iDFS�j\n\n\tdfs(1, -1);\n\n\n\n\t// Step #3. “š‚¦‚ğ‹�‚ß‚é\n\n\tlong long Answer = 0;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tlong long r = min(dp[A[i]], dp[B[i]]);\n\n\t\tAnswer += r * (N - r);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar graph: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo graph[i] :: #list\n\tend for\n\tfor i(0, n - 2)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo graph[a].add(b)\n\t\tdo graph[b].add(a)\n\tend for\n\t\n\tvar a: []int :: #[n]int\n\tdo dfs(graph, 0, -1, a)\n\tvar ans: int :: 0\n\tfor u(0, n - 1)\n\t\tdo graph[u].head()\n\t\twhile(!graph[u].term())\n\t\t\tvar v: int :: graph[u].get()\n\t\t\tvar min: int :: [a[u], a[v]].min()\n\t\t\tdo ans :+ min * (n - min)\n\t\t\tdo graph[u].next()\n\t\tend while\n\tend for\n\tdo ans :/ 2\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs(graph: []list, u: int, p: int, a: []int)\n\t\tdo a[u] :: 1\n\t\tdo graph[u].head()\n\t\twhile(!graph[u].term())\n\t\t\tvar v: int :: graph[u].get()\n\t\t\tif(v <> p)\n\t\t\t\tdo dfs(graph, v, u, a)\n\t\t\t\tdo a[u] :+ a[v]\n\t\t\tend if\n\t\t\tdo graph[u].next()\n\t\tend while\n\tend func\nend func\n" }, { "id": 238, "name": "040", "C++": "// Time Complexity: O(N^4 log W)\n\n\n\n#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\nconst int inf = 1012345678;\n\nclass edge {\n\npublic:\n\n\tint to, cap, rev;\n\n\tedge() : to(-1), cap(0), rev(-1) {};\n\n\tedge(int to_, int cap_, int rev_) : to(to_), cap(cap_), rev(rev_) {};\n\n};\n\nbool find_augment(int pos, int tar, int step, vector >& G, vector& vis) {\n\n\tif (pos == tar) return true;\n\n\tvis[pos] = true;\n\n\tfor (edge& e : G[pos]) {\n\n\t\tif (!vis[e.to] && e.cap >= step) {\n\n\t\t\tbool res = find_augment(e.to, tar, step, G, vis);\n\n\t\t\tif (res) {\n\n\t\t\t\te.cap -= step;\n\n\t\t\t\tG[e.to][e.rev].cap += step;\n\n\t\t\t\treturn true;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nint max_flow(int src, int tar, int maxstep, vector >& G) {\n\n\tint flow = 0;\n\n\tint step = 1;\n\n\twhile (step * 2 <= maxstep) {\n\n\t\tstep *= 2;\n\n\t}\n\n\twhile (true) {\n\n\t\tvector vis(G.size(), false);\n\n\t\tbool res = find_augment(src, tar, step, G, vis);\n\n\t\tif (!res) {\n\n\t\t\tif (step == 1) break;\n\n\t\t\tstep >>= 1;\n\n\t\t}\n\n\t\telse {\n\n\t\t\tflow += step;\n\n\t\t}\n\n\t}\n\n\treturn flow;\n\n}\n\nint main() {\n\n\tint N, W;\n\n\tcin >> N >> W;\n\n\tvector A(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tcin >> A[i];\n\n\t}\n\n\tvector > G(N + 2);\n\n\tfunction add_edge = [&](int va, int vb, int cap) {\n\n\t\tG[va].push_back(edge(vb, cap, G[vb].size()));\n\n\t\tG[vb].push_back(edge(va, 0, G[va].size() - 1));\n\n\t};\n\n\tfor (int i = 1; i <= N; ++i) {\n\n\t\tint K, c;\n\n\t\tcin >> K;\n\n\t\tfor (int j = 0; j < K; ++j) {\n\n\t\t\tcin >> c;\n\n\t\t\tadd_edge(c, i, inf);\n\n\t\t}\n\n\t}\n\n\tfor (int i = 1; i <= N; ++i) {\n\n\t\tadd_edge(0, i, A[i - 1]);\n\n\t\tadd_edge(i, N + 1, W);\n\n\t}\n\n\tint res = max_flow(0, N + 1, W, G);\n\n\tint answer = -res;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tanswer += A[i];\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::mf_graph](https://atcoder.github.io/ac-library/master/document_en/maxflow.html).\n # `Cap` is always `Int64`.\n #\n # ```\n # mf = AtCoder::MaxFlow.new(3)\n # mf.add_edge(0, 1, 3)\n # mf.add_edge(1, 2, 1)\n # mf.add_edge(0, 2, 2)\n # mf.flow(0, 2) # => 3\n # ```\n class MaxFlow\n class Edge\n getter to : Int64\n getter reverse_index : Int64\n property capacity : Int64\n\n def initialize(@to, @capacity, @reverse_index)\n end\n end\n\n # Number of nodes\n getter size : Int64\n\n # Adjacency list\n getter adjacencies : Array(Array(Edge))\n\n getter depths : Array(Int64)\n\n # Number of visited adjacencies for each nodes\n getter visit_counts : Array(Int64)\n\n def initialize(@size)\n @adjacencies = Array(Array(Edge)).new(@size) { [] of Edge }\n @depths = Array(Int64).new(@size, -1_i64)\n @visit_counts = Array(Int64).new(@size, 0_i64)\n end\n\n # Implements atcoder::mf_graph.add_edge(from, to, capacity).\n def add_edge(from, to, capacity)\n from_index = @adjacencies[from].size.to_i64\n to_index = @adjacencies[to].size.to_i64\n\n @adjacencies[from] << Edge.new(to.to_i64, capacity.to_i64, to_index)\n @adjacencies[to] << Edge.new(from.to_i64, 0_i64, from_index)\n end\n\n # Implements atcoder::mf_graph.flow(start, target).\n def flow(start, target)\n flow = 0_i64\n\n loop do\n bfs(start)\n if @depths[target] < 0\n return flow\n end\n\n @visit_counts.fill(0_i64)\n while (flowed = dfs(start, target, Int64::MAX)) > 0\n flow += flowed\n end\n end\n end\n\n # FIXME: Unimplemented\n def min_cut\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def get_edge\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def edges\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def change_edge\n raise NotImplementedError.new\n end\n\n private def bfs(start)\n @depths.fill(-1_i64)\n queue = Deque(Int64).new\n\n @depths[start] = 0_i64\n queue << start.to_i64\n until queue.empty?\n node = queue.shift\n\n @adjacencies[node].each do |edge|\n if edge.capacity > 0 && @depths[edge.to] < 0\n @depths[edge.to] = @depths[node] + 1\n queue << edge.to\n end\n end\n end\n end\n\n private def dfs(node, target, flow)\n return flow if node == target\n\n edges = @adjacencies[node]\n while @visit_counts[node] < edges.size\n edge = edges[@visit_counts[node]]\n if edge.capacity > 0 && @depths[node] < @depths[edge.to]\n flowed = dfs(edge.to, target, min(flow, edge.capacity))\n\n if flowed > 0\n edge.capacity -= flowed\n @adjacencies[edge.to][edge.reverse_index].capacity += flowed\n return flowed\n end\n end\n\n @visit_counts[node] += 1\n end\n\n 0_i64\n end\n\n @[AlwaysInline]\n private def min(a, b)\n a > b ? b : a\n end\n end\nend\n\nn, w = read_line.split.map(&.to_i64)\na = read_line.split.map(&.to_i64)\n\nmf = AtCoder::MaxFlow.new(n + 2)\ns, t = n, n + 1\n(0...n).each do |i|\n mf.add_edge(s, i, w)\n mf.add_edge(i, t, a[i])\n read_line.split.map(&.to_i.pred).skip(1).each do |j|\n mf.add_edge(i, j, 10i64**18)\n end\nend\nputs a.sum - mf.flow(s, t)\n" }, { "id": 239, "name": "040", "C++": "// Time Complexity: O(N^4 log W)\n\n\n\n#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\nconst int inf = 1012345678;\n\nclass edge {\n\npublic:\n\n\tint to, cap, rev;\n\n\tedge() : to(-1), cap(0), rev(-1) {};\n\n\tedge(int to_, int cap_, int rev_) : to(to_), cap(cap_), rev(rev_) {};\n\n};\n\nbool find_augment(int pos, int tar, int step, vector >& G, vector& vis) {\n\n\tif (pos == tar) return true;\n\n\tvis[pos] = true;\n\n\tfor (edge& e : G[pos]) {\n\n\t\tif (!vis[e.to] && e.cap >= step) {\n\n\t\t\tbool res = find_augment(e.to, tar, step, G, vis);\n\n\t\t\tif (res) {\n\n\t\t\t\te.cap -= step;\n\n\t\t\t\tG[e.to][e.rev].cap += step;\n\n\t\t\t\treturn true;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nint max_flow(int src, int tar, int maxstep, vector >& G) {\n\n\tint flow = 0;\n\n\tint step = 1;\n\n\twhile (step * 2 <= maxstep) {\n\n\t\tstep *= 2;\n\n\t}\n\n\twhile (true) {\n\n\t\tvector vis(G.size(), false);\n\n\t\tbool res = find_augment(src, tar, step, G, vis);\n\n\t\tif (!res) {\n\n\t\t\tif (step == 1) break;\n\n\t\t\tstep >>= 1;\n\n\t\t}\n\n\t\telse {\n\n\t\t\tflow += step;\n\n\t\t}\n\n\t}\n\n\treturn flow;\n\n}\n\nint main() {\n\n\tint N, W;\n\n\tcin >> N >> W;\n\n\tvector A(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tcin >> A[i];\n\n\t}\n\n\tvector > G(N + 2);\n\n\tfunction add_edge = [&](int va, int vb, int cap) {\n\n\t\tG[va].push_back(edge(vb, cap, G[vb].size()));\n\n\t\tG[vb].push_back(edge(va, 0, G[va].size() - 1));\n\n\t};\n\n\tfor (int i = 1; i <= N; ++i) {\n\n\t\tint K, c;\n\n\t\tcin >> K;\n\n\t\tfor (int j = 0; j < K; ++j) {\n\n\t\t\tcin >> c;\n\n\t\t\tadd_edge(c, i, inf);\n\n\t\t}\n\n\t}\n\n\tfor (int i = 1; i <= N; ++i) {\n\n\t\tadd_edge(0, i, A[i - 1]);\n\n\t\tadd_edge(i, N + 1, W);\n\n\t}\n\n\tint res = max_flow(0, N + 1, W, G);\n\n\tint answer = -res;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tanswer += A[i];\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Python": "from networkx import*\n(n,w),A,*z=[[*map(int,t.split())]for t in open(0)]\ng=DiGraph()\nd=g.add_edge\nwhile n:\n n-=1;d(1,~n,c=w);d(~n,2,c=A[n])\n for p in z[n][1:]:d(~n,-p,c=9e9)\nprint(sum(A)-minimum_cut(g,1,2,capacity='c')[0])" }, { "id": 240, "name": "040", "Crystal": "# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::mf_graph](https://atcoder.github.io/ac-library/master/document_en/maxflow.html).\n # `Cap` is always `Int64`.\n #\n # ```\n # mf = AtCoder::MaxFlow.new(3)\n # mf.add_edge(0, 1, 3)\n # mf.add_edge(1, 2, 1)\n # mf.add_edge(0, 2, 2)\n # mf.flow(0, 2) # => 3\n # ```\n class MaxFlow\n class Edge\n getter to : Int64\n getter reverse_index : Int64\n property capacity : Int64\n\n def initialize(@to, @capacity, @reverse_index)\n end\n end\n\n # Number of nodes\n getter size : Int64\n\n # Adjacency list\n getter adjacencies : Array(Array(Edge))\n\n getter depths : Array(Int64)\n\n # Number of visited adjacencies for each nodes\n getter visit_counts : Array(Int64)\n\n def initialize(@size)\n @adjacencies = Array(Array(Edge)).new(@size) { [] of Edge }\n @depths = Array(Int64).new(@size, -1_i64)\n @visit_counts = Array(Int64).new(@size, 0_i64)\n end\n\n # Implements atcoder::mf_graph.add_edge(from, to, capacity).\n def add_edge(from, to, capacity)\n from_index = @adjacencies[from].size.to_i64\n to_index = @adjacencies[to].size.to_i64\n\n @adjacencies[from] << Edge.new(to.to_i64, capacity.to_i64, to_index)\n @adjacencies[to] << Edge.new(from.to_i64, 0_i64, from_index)\n end\n\n # Implements atcoder::mf_graph.flow(start, target).\n def flow(start, target)\n flow = 0_i64\n\n loop do\n bfs(start)\n if @depths[target] < 0\n return flow\n end\n\n @visit_counts.fill(0_i64)\n while (flowed = dfs(start, target, Int64::MAX)) > 0\n flow += flowed\n end\n end\n end\n\n # FIXME: Unimplemented\n def min_cut\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def get_edge\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def edges\n raise NotImplementedError.new\n end\n\n # FIXME: Unimplemented\n def change_edge\n raise NotImplementedError.new\n end\n\n private def bfs(start)\n @depths.fill(-1_i64)\n queue = Deque(Int64).new\n\n @depths[start] = 0_i64\n queue << start.to_i64\n until queue.empty?\n node = queue.shift\n\n @adjacencies[node].each do |edge|\n if edge.capacity > 0 && @depths[edge.to] < 0\n @depths[edge.to] = @depths[node] + 1\n queue << edge.to\n end\n end\n end\n end\n\n private def dfs(node, target, flow)\n return flow if node == target\n\n edges = @adjacencies[node]\n while @visit_counts[node] < edges.size\n edge = edges[@visit_counts[node]]\n if edge.capacity > 0 && @depths[node] < @depths[edge.to]\n flowed = dfs(edge.to, target, min(flow, edge.capacity))\n\n if flowed > 0\n edge.capacity -= flowed\n @adjacencies[edge.to][edge.reverse_index].capacity += flowed\n return flowed\n end\n end\n\n @visit_counts[node] += 1\n end\n\n 0_i64\n end\n\n @[AlwaysInline]\n private def min(a, b)\n a > b ? b : a\n end\n end\nend\n\nn, w = read_line.split.map(&.to_i64)\na = read_line.split.map(&.to_i64)\n\nmf = AtCoder::MaxFlow.new(n + 2)\ns, t = n, n + 1\n(0...n).each do |i|\n mf.add_edge(s, i, w)\n mf.add_edge(i, t, a[i])\n read_line.split.map(&.to_i.pred).skip(1).each do |j|\n mf.add_edge(i, j, 10i64**18)\n end\nend\nputs a.sum - mf.flow(s, t)\n", "Python": "from networkx import*\n(n,w),A,*z=[[*map(int,t.split())]for t in open(0)]\ng=DiGraph()\nd=g.add_edge\nwhile n:\n n-=1;d(1,~n,c=w);d(~n,2,c=A[n])\n for p in z[n][1:]:d(~n,-p,c=9e9)\nprint(sum(A)-minimum_cut(g,1,2,capacity='c')[0])" }, { "id": 241, "name": "041", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nstruct Point {\n\n\tlong long px, py;\n\n};\n\n\n\nPoint operator+(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px + a2.px, a1.py + a2.py };\n\n}\n\n\n\nPoint operator-(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n\n}\n\n\n\nbool operator<(const Point& a1, const Point& a2) {\n\n\tif (a1.px < a2.px) return true;\n\n\tif (a1.px > a2.px) return false;\n\n\tif (a1.py < a2.py) return true;\n\n\treturn false;\n\n}\n\n\n\n// 点 p1 と p2 の外積を求める\n\nlong long crs(Point p1, Point p2) {\n\n\treturn p1.px * p2.py - p1.py * p2.px;\n\n}\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nlong long N;\n\nPoint G[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> G[i].px >> G[i].py;\n\n\tsort(G + 1, G + N + 1);\n\n\n\n\t// Step #2. 凸包を求める\n\n\tvector G1, G2, Totsuhou;\n\n\tG1.push_back(G[1]); G2.push_back(G[1]);\n\n\tG1.push_back(G[2]); G2.push_back(G[2]);\n\n\tfor (int i = 3; i <= N; i++) {\n\n\t\twhile (G1.size() >= 2 && crs(G1[G1.size() - 1] - G1[G1.size() - 2], G[i] - G1[G1.size() - 1]) <= 0) G1.pop_back();\n\n\t\twhile (G2.size() >= 2 && crs(G2[G2.size() - 1] - G2[G2.size() - 2], G[i] - G2[G2.size() - 1]) >= 0) G2.pop_back();\n\n\t\tG1.push_back(G[i]);\n\n\t\tG2.push_back(G[i]);\n\n\t}\n\n\tfor (int i = 0; i < G1.size(); i++) Totsuhou.push_back(G1[i]);\n\n\tfor (int i = (int)G2.size() - 2; i >= 1; i--) Totsuhou.push_back(G2[i]);\n\n\n\n\t// Step #3. 辺上の格子点の数を求める\n\n\tlong long EdgePoint = Totsuhou.size();\n\n\tfor (int i = 0; i < Totsuhou.size(); i++) {\n\n\t\tlong long ax = Totsuhou[(i + 0) % Totsuhou.size()].px, ay = Totsuhou[(i + 0) % Totsuhou.size()].py;\n\n\t\tlong long bx = Totsuhou[(i + 1) % Totsuhou.size()].px, by = Totsuhou[(i + 1) % Totsuhou.size()].py;\n\n\t\tlong long vx = abs(bx - ax);\n\n\t\tlong long vy = abs(by - ay);\n\n\t\tlong long r = gcd(vx, vy);\n\n\t\tEdgePoint += (r - 1LL);\n\n\t}\n\n\n\n\t// Step #4. 多角形の面積（を 2 倍した値）を求める\n\n\tlong long Area = 0;\n\n\tfor (int i = 0; i < Totsuhou.size(); i++) {\n\n\t\tlong long ax = Totsuhou[(i + 0) % Totsuhou.size()].px, ay = Totsuhou[(i + 0) % Totsuhou.size()].py;\n\n\t\tlong long bx = Totsuhou[(i + 1) % Totsuhou.size()].px, by = Totsuhou[(i + 1) % Totsuhou.size()].py;\n\n\t\tArea += (bx - ax) * (by + ay);\n\n\t}\n\n\tArea = abs(Area);\n\n\n\n\t// Step #5. 答えを求める\n\n\tlong long Answer = Area + EdgePoint + 2LL;\n\n\tcout << (Answer / 2LL) - N << endl;\n\n\treturn 0;\n\n}", "Crystal": "require \"big\"\n\nmodule Geometric\n alias Real = BigFloat\n EPS = Real.new(1e-15)\n\n extend self\n\n struct Real\n def sgn : Int32\n self < -Geometric::EPS ? -1 : self > Geometric::EPS ? 1 : 0\n end\n end\n\n struct Vec2\n include Comparable(Vec2)\n\n property x : Real, y : Real\n\n def self.zero\n Vec2.new(Real.zero, Real.zero)\n end\n\n def initialize(x, y)\n @x, @y = Real.new(x), Real.new(y)\n end\n\n def +\n self\n end\n\n def -\n Vec2.new(-x, -y)\n end\n\n {% for op in %w[+ - * /] %}\n def {{op.id}}(other : Vec2)\n Vec2.new(x {{op.id}} other.x, y {{op.id}} other.y)\n end\n\n def {{op.id}}(other : Real)\n Vec2.new(x {{op.id}} other, y {{op.id}} other)\n end\n {% end %}\n\n def <=>(other : Vec2)\n {x, y} <=> {other.x, other.y}\n end\n\n def dot(other : Vec2)\n x * other.y - y * other.x\n end\n\n def cross(other : Vec2)\n x * other.y - y * other.x\n end\n end\n\n class Polygon < Array(Vec2)\n def initialize(points : Array(Vec2))\n initialize(points.size)\n concat points\n end\n\n def initialize\n super\n end\n\n def initialize(initial_capacity : Int)\n super\n end\n\n def initialize(size : Int, &block : Int32 -> T)\n super\n end\n\n def after(i : Int32) : Vec2\n self[i != size - 1 ? i + 1 : 0]\n end\n\n def area : Real\n (0...size).sum { |i|\n self[i].cross after(i)\n }.abs / 2\n end\n\n def convex_hull : Polygon\n result = Polygon.new\n points = sort\n points.each do |point|\n while result.size >= 2 && Geometric.ccw(result[-2], result[-1], point) != -1\n result.pop\n end\n result << point\n end\n t = result.size + 1\n points.reverse_each.skip(1).each do |point|\n while result.size >= t && Geometric.ccw(result[-2], result[-1], point) != -1\n result.pop\n end\n result << point\n end\n result.pop\n result\n end\n end\n\n # AB から見て BC が左に曲がる : +1\n # AB から見て BC が右に曲がる : -1\n # ABC, CBA の順に一直線上に並ぶ : +2\n # ACB, BCA の順に一直線上に並ぶ : 0\n # BAC, CAB の順に一直線上に並ぶ : -2\n def ccw(a : Vec2, b : Vec2, c : Vec2) : Int32\n x = (b - a).cross(c - a).sgn\n if x != 0\n x\n elsif (b - a).dot(c - b).sgn > 0\n 2\n elsif (a - b).dot(c - a).sgn > 0\n -2\n else\n 0\n end\n end\nend\n\nn = read_line.to_i\npolygon = Geometric::Polygon.new((1..n).map {\n x, y = read_line.split.map(&.to_f)\n Geometric::Vec2.new(x, y)\n}).convex_hull\n\non_line = (0...polygon.size).sum { |i|\n x = (polygon[i].x - polygon.after(i).x).abs.to_i64\n y = (polygon[i].y - polygon.after(i).y).abs.to_i64\n x.gcd(y)\n}\n\nputs (polygon.area + on_line / 2 - n + 1).to_i64\n" }, { "id": 242, "name": "041", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nstruct Point {\n\n\tlong long px, py;\n\n};\n\n\n\nPoint operator+(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px + a2.px, a1.py + a2.py };\n\n}\n\n\n\nPoint operator-(const Point& a1, const Point& a2) {\n\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n\n}\n\n\n\nbool operator<(const Point& a1, const Point& a2) {\n\n\tif (a1.px < a2.px) return true;\n\n\tif (a1.px > a2.px) return false;\n\n\tif (a1.py < a2.py) return true;\n\n\treturn false;\n\n}\n\n\n\n// 点 p1 と p2 の外積を求める\n\nlong long crs(Point p1, Point p2) {\n\n\treturn p1.px * p2.py - p1.py * p2.px;\n\n}\n\n\n\nlong long gcd(long long a, long long b) {\n\n\tif (b == 0) return a;\n\n\treturn gcd(b, a % b);\n\n}\n\n\n\nlong long N;\n\nPoint G[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> G[i].px >> G[i].py;\n\n\tsort(G + 1, G + N + 1);\n\n\n\n\t// Step #2. 凸包を求める\n\n\tvector G1, G2, Totsuhou;\n\n\tG1.push_back(G[1]); G2.push_back(G[1]);\n\n\tG1.push_back(G[2]); G2.push_back(G[2]);\n\n\tfor (int i = 3; i <= N; i++) {\n\n\t\twhile (G1.size() >= 2 && crs(G1[G1.size() - 1] - G1[G1.size() - 2], G[i] - G1[G1.size() - 1]) <= 0) G1.pop_back();\n\n\t\twhile (G2.size() >= 2 && crs(G2[G2.size() - 1] - G2[G2.size() - 2], G[i] - G2[G2.size() - 1]) >= 0) G2.pop_back();\n\n\t\tG1.push_back(G[i]);\n\n\t\tG2.push_back(G[i]);\n\n\t}\n\n\tfor (int i = 0; i < G1.size(); i++) Totsuhou.push_back(G1[i]);\n\n\tfor (int i = (int)G2.size() - 2; i >= 1; i--) Totsuhou.push_back(G2[i]);\n\n\n\n\t// Step #3. 辺上の格子点の数を求める\n\n\tlong long EdgePoint = Totsuhou.size();\n\n\tfor (int i = 0; i < Totsuhou.size(); i++) {\n\n\t\tlong long ax = Totsuhou[(i + 0) % Totsuhou.size()].px, ay = Totsuhou[(i + 0) % Totsuhou.size()].py;\n\n\t\tlong long bx = Totsuhou[(i + 1) % Totsuhou.size()].px, by = Totsuhou[(i + 1) % Totsuhou.size()].py;\n\n\t\tlong long vx = abs(bx - ax);\n\n\t\tlong long vy = abs(by - ay);\n\n\t\tlong long r = gcd(vx, vy);\n\n\t\tEdgePoint += (r - 1LL);\n\n\t}\n\n\n\n\t// Step #4. 多角形の面積（を 2 倍した値）を求める\n\n\tlong long Area = 0;\n\n\tfor (int i = 0; i < Totsuhou.size(); i++) {\n\n\t\tlong long ax = Totsuhou[(i + 0) % Totsuhou.size()].px, ay = Totsuhou[(i + 0) % Totsuhou.size()].py;\n\n\t\tlong long bx = Totsuhou[(i + 1) % Totsuhou.size()].px, by = Totsuhou[(i + 1) % Totsuhou.size()].py;\n\n\t\tArea += (bx - ax) * (by + ay);\n\n\t}\n\n\tArea = abs(Area);\n\n\n\n\t// Step #5. 答えを求める\n\n\tlong long Answer = Area + EdgePoint + 2LL;\n\n\tcout << (Answer / 2LL) - N << endl;\n\n\treturn 0;\n\n}", "Ruby": "n = readline.to_i\nz = Array.new(n) do\n Complex(*readline.split.map(&:to_i))\nend\n\nmin_x = z.map(&:real).min\nmin_y = z.map(&:imag).min\nmax_x = z.map(&:real).max\nmax_y = z.map(&:imag).max\n\nz0 = z[0]\nfor zi in z\n if zi.imag < z0.imag or (zi.imag == z0.imag && zi.real < z0.real) then\n z0 = zi\n end\nend\n\nz.sort! do |zi, zj|\n zi -= z0\n zj -= z0\n if zi.angle != zj.angle then\n zi.angle <=> zj.angle\n else\n zi.abs2 <=> zj.abs2\n end\nend\n\nwall = []\nfor zi in z\n while wall.size >= 2\n zj = wall[-1]\n zk = wall[-2]\n if ((zi - zj) / (zk - zj)).angle < 0 then\n break\n end\n wall.pop\n end\n wall.push(zi)\nend\nwall.push(z0)\n\nans = (max_x - min_x + 1) * (max_y - min_y + 1)\n\nfor j in 1...(wall.size)\n zi = wall[j - 1]\n zj = wall[j]\n\n dx = (zj - zi).real.to_i\n dy = (zj - zi).imag.to_i\n\n ans -= ((dx.abs + 1) * (dy.abs + 1) - (dx.abs.gcd(dy.abs) + 1)) / 2\n\n if dy > 0 then\n ans -= (max_x - [zi.real, zj.real].max) * dy\n else\n ans -= (min_x - [zi.real, zj.real].min) * dy\n end\nend\n\nputs ans - n\n" }, { "id": 243, "name": "041", "Crystal": "require \"big\"\n\nmodule Geometric\n alias Real = BigFloat\n EPS = Real.new(1e-15)\n\n extend self\n\n struct Real\n def sgn : Int32\n self < -Geometric::EPS ? -1 : self > Geometric::EPS ? 1 : 0\n end\n end\n\n struct Vec2\n include Comparable(Vec2)\n\n property x : Real, y : Real\n\n def self.zero\n Vec2.new(Real.zero, Real.zero)\n end\n\n def initialize(x, y)\n @x, @y = Real.new(x), Real.new(y)\n end\n\n def +\n self\n end\n\n def -\n Vec2.new(-x, -y)\n end\n\n {% for op in %w[+ - * /] %}\n def {{op.id}}(other : Vec2)\n Vec2.new(x {{op.id}} other.x, y {{op.id}} other.y)\n end\n\n def {{op.id}}(other : Real)\n Vec2.new(x {{op.id}} other, y {{op.id}} other)\n end\n {% end %}\n\n def <=>(other : Vec2)\n {x, y} <=> {other.x, other.y}\n end\n\n def dot(other : Vec2)\n x * other.y - y * other.x\n end\n\n def cross(other : Vec2)\n x * other.y - y * other.x\n end\n end\n\n class Polygon < Array(Vec2)\n def initialize(points : Array(Vec2))\n initialize(points.size)\n concat points\n end\n\n def initialize\n super\n end\n\n def initialize(initial_capacity : Int)\n super\n end\n\n def initialize(size : Int, &block : Int32 -> T)\n super\n end\n\n def after(i : Int32) : Vec2\n self[i != size - 1 ? i + 1 : 0]\n end\n\n def area : Real\n (0...size).sum { |i|\n self[i].cross after(i)\n }.abs / 2\n end\n\n def convex_hull : Polygon\n result = Polygon.new\n points = sort\n points.each do |point|\n while result.size >= 2 && Geometric.ccw(result[-2], result[-1], point) != -1\n result.pop\n end\n result << point\n end\n t = result.size + 1\n points.reverse_each.skip(1).each do |point|\n while result.size >= t && Geometric.ccw(result[-2], result[-1], point) != -1\n result.pop\n end\n result << point\n end\n result.pop\n result\n end\n end\n\n # AB から見て BC が左に曲がる : +1\n # AB から見て BC が右に曲がる : -1\n # ABC, CBA の順に一直線上に並ぶ : +2\n # ACB, BCA の順に一直線上に並ぶ : 0\n # BAC, CAB の順に一直線上に並ぶ : -2\n def ccw(a : Vec2, b : Vec2, c : Vec2) : Int32\n x = (b - a).cross(c - a).sgn\n if x != 0\n x\n elsif (b - a).dot(c - b).sgn > 0\n 2\n elsif (a - b).dot(c - a).sgn > 0\n -2\n else\n 0\n end\n end\nend\n\nn = read_line.to_i\npolygon = Geometric::Polygon.new((1..n).map {\n x, y = read_line.split.map(&.to_f)\n Geometric::Vec2.new(x, y)\n}).convex_hull\n\non_line = (0...polygon.size).sum { |i|\n x = (polygon[i].x - polygon.after(i).x).abs.to_i64\n y = (polygon[i].y - polygon.after(i).y).abs.to_i64\n x.gcd(y)\n}\n\nputs (polygon.area + on_line / 2 - n + 1).to_i64\n", "Ruby": "n = readline.to_i\nz = Array.new(n) do\n Complex(*readline.split.map(&:to_i))\nend\n\nmin_x = z.map(&:real).min\nmin_y = z.map(&:imag).min\nmax_x = z.map(&:real).max\nmax_y = z.map(&:imag).max\n\nz0 = z[0]\nfor zi in z\n if zi.imag < z0.imag or (zi.imag == z0.imag && zi.real < z0.real) then\n z0 = zi\n end\nend\n\nz.sort! do |zi, zj|\n zi -= z0\n zj -= z0\n if zi.angle != zj.angle then\n zi.angle <=> zj.angle\n else\n zi.abs2 <=> zj.abs2\n end\nend\n\nwall = []\nfor zi in z\n while wall.size >= 2\n zj = wall[-1]\n zk = wall[-2]\n if ((zi - zj) / (zk - zj)).angle < 0 then\n break\n end\n wall.pop\n end\n wall.push(zi)\nend\nwall.push(z0)\n\nans = (max_x - min_x + 1) * (max_y - min_y + 1)\n\nfor j in 1...(wall.size)\n zi = wall[j - 1]\n zj = wall[j]\n\n dx = (zj - zi).real.to_i\n dy = (zj - zi).imag.to_i\n\n ans -= ((dx.abs + 1) * (dy.abs + 1) - (dx.abs.gcd(dy.abs) + 1)) / 2\n\n if dy > 0 then\n ans -= (max_x - [zi.real, zj.real].max) * dy\n else\n ans -= (min_x - [zi.real, zj.real].min) * dy\n end\nend\n\nputs ans - n\n" }, { "id": 244, "name": "042", "C++": "#include \n\n#include \n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nint main() {\n\n\tint K;\n\n\tcin >> K;\n\n\tif (K % 9 == 0) {\n\n\t\tvector dp(K + 1);\n\n\t\tdp[0] = 1;\n\n\t\tfor (int i = 1; i <= K; ++i) {\n\n\t\t\tfor (int j = i - 1; j >= i - 9 && j >= 0; --j) {\n\n\t\t\t\tdp[i] += dp[j];\n\n\t\t\t\tif (dp[i] >= mod) dp[i] -= mod;\n\n\t\t\t}\n\n\t\t}\n\n\t\tcout << dp[K] << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << 0 << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "k = read_line.to_i\nputs k % 9 == 0 ? k.times.each_with_object([1i64]) { |_, dp|\n dp << dp.reverse_each.first(9).sum % (10**9 + 7)\n}.last : 0\n" }, { "id": 245, "name": "042", "C++": "#include \n\n#include \n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nint main() {\n\n\tint K;\n\n\tcin >> K;\n\n\tif (K % 9 == 0) {\n\n\t\tvector dp(K + 1);\n\n\t\tdp[0] = 1;\n\n\t\tfor (int i = 1; i <= K; ++i) {\n\n\t\t\tfor (int j = i - 1; j >= i - 9 && j >= 0; --j) {\n\n\t\t\t\tdp[i] += dp[j];\n\n\t\t\t\tif (dp[i] >= mod) dp[i] -= mod;\n\n\t\t\t}\n\n\t\t}\n\n\t\tcout << dp[K] << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << 0 << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar k: int :: cui@inputInt()\n\tif(k % 9 <> 0)\n\t\tdo cui@print(\"0\\n\")\n\t\tret\n\tend if\n\tvar dp: []int :: #[k + 9]int\n\tdo dp[0] :: 1\n\tfor i(0, k - 1)\n\t\tfor j(1, 9)\n\t\t\tdo dp[i + j] :+ dp[i]\n\t\t\tdo dp[i + j] :% 10 ^ 9 + 7\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[k]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 246, "name": "042", "Crystal": "k = read_line.to_i\nputs k % 9 == 0 ? k.times.each_with_object([1i64]) { |_, dp|\n dp << dp.reverse_each.first(9).sum % (10**9 + 7)\n}.last : 0\n", "Kuin": "func main()\n\tvar k: int :: cui@inputInt()\n\tif(k % 9 <> 0)\n\t\tdo cui@print(\"0\\n\")\n\t\tret\n\tend if\n\tvar dp: []int :: #[k + 9]int\n\tdo dp[0] :: 1\n\tfor i(0, k - 1)\n\t\tfor j(1, 9)\n\t\t\tdo dp[i + j] :+ dp[i]\n\t\t\tdo dp[i + j] :% 10 ^ 9 + 7\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[k]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 247, "name": "043", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\n\ntypedef struct edge{\n\tlong long to;\n\tlong long cost;\n}Edge;\ntypedef pair P;\n\nlong long INF=1000000000000000000;\nint V;\nvector G[2000000];\nlong long d[2000000];\n\nvoid dijkstra(int s){\n priority_queue,greater

> que;\n\tfill(d,d+V,INF);\n\td[s]=0;\n\tque.push(P(0,s));\n\twhile(!que.empty()){\n\t\tP p=que.top();que.pop();\n\t\tint v=p.second;\n\t\tif(d[v]d[v]+e.cost){\n\t\t\t d[e.to]=d[v]+e.cost;\n\t\t\t\tque.push(P(d[e.to],e.to));\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nvoid G_push(int st,int to,int w){\n G[st].push_back({to,w});\n G[to].push_back({st,w});\n return;\n}\n\nint main(){\n int H,W,sx,sy,gx,gy,N;\n cin>>H>>W>>sx>>sy>>gx>>gy;\n sx--;sy--;gx--;gy--;\n N=W*H;\n V=2*N;\n vector C(H);\n for(int i=0;i>C.at(i);\n for(int i=0;i0 && C.at(i-1).at(j)=='.')G_push(W*i+j,W*(i-1)+j,0);\n if(j>0 && C.at(i).at(j-1)=='.')G_push(W*i+j+N,W*i+j-1+N,0);\n G_push(W*i+j,W*i+j+N,1);\n }\n G_push(W*sx+sy,W*sx+sy+N,0);\n dijkstra(W*sx+sy);\n printf(\"%lld\\n\",min(d[W*gx+gy],d[W*gx+gy+N]));\n return 0;\n}\n", "Crystal": "struct Point\n Direction = {Point.new(0, 1), Point.new(1, 0), Point.new(0, -1), Point.new(-1, 0)}\n\n property y : Int32\n property x : Int32\n\n def initialize(@y, @x)\n end\n\n def +(other : Point)\n Point.new(y + other.y, x + other.x)\n end\n\n def in_range?(h, w)\n (0...h).includes?(y) && (0...w).includes?(x)\n end\nend\n\nstruct Vertex\n getter p : Point\n getter d : Int32\n\n def initialize(@p, @d)\n end\n\n def to_i(w)\n p.y * w * 4 + p.x * 4 + d\n end\nend\n\nh, w = read_line.split.map(&.to_i)\nstart, goal = {0, 1}.map {\n y, x = read_line.split.map(&.to_i.pred)\n Point.new(y, x)\n}\ns = (1..h).map { read_line }\n\ndist = Array(Int32?).new(h * w * 4, nil)\ndeque = Deque({Vertex, Int32}).new\n(0...4).each do |d|\n e = Vertex.new(start, d)\n dist[e.to_i(w)] = 0\n deque << {e, 0}\nend\n\nadd_edge = ->(dist_from : Int32, to : Vertex, cost : Int32) {\n dist_to = dist[to.to_i(w)]\n if dist_to.nil? || dist_to > dist_from + cost\n dist_to = dist_from + cost\n dist[to.to_i(w)] = dist_to\n if cost == 0\n deque.push({to, dist_to})\n else\n deque.unshift({to, dist_to})\n end\n end\n}\n\nuntil deque.empty?\n v, dist_now = deque.pop\n dist_from = dist[v.to_i(w)].not_nil!\n next if dist_from < dist_now\n\n d1 = v.d\n dir = Point::Direction[v.d]\n p1, p2 = v.p, v.p + dir\n\n if p2.in_range?(h, w) && s[p2.y][p2.x] == '.'\n add_edge.call(dist_from, Vertex.new(p2, d1), 0)\n end\n {d1 - 1, d1 + 1}.each do |d2|\n add_edge.call(dist_from, Vertex.new(p1, d2 % 4), 1)\n end\nend\n\nputs (0...4).min_of { |d|\n dist[Vertex.new(goal, d).to_i(w)].not_nil!\n}\n" }, { "id": 248, "name": "043", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\n\ntypedef struct edge{\n\tlong long to;\n\tlong long cost;\n}Edge;\ntypedef pair P;\n\nlong long INF=1000000000000000000;\nint V;\nvector G[2000000];\nlong long d[2000000];\n\nvoid dijkstra(int s){\n priority_queue,greater

> que;\n\tfill(d,d+V,INF);\n\td[s]=0;\n\tque.push(P(0,s));\n\twhile(!que.empty()){\n\t\tP p=que.top();que.pop();\n\t\tint v=p.second;\n\t\tif(d[v]d[v]+e.cost){\n\t\t\t d[e.to]=d[v]+e.cost;\n\t\t\t\tque.push(P(d[e.to],e.to));\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nvoid G_push(int st,int to,int w){\n G[st].push_back({to,w});\n G[to].push_back({st,w});\n return;\n}\n\nint main(){\n int H,W,sx,sy,gx,gy,N;\n cin>>H>>W>>sx>>sy>>gx>>gy;\n sx--;sy--;gx--;gy--;\n N=W*H;\n V=2*N;\n vector C(H);\n for(int i=0;i>C.at(i);\n for(int i=0;i0 && C.at(i-1).at(j)=='.')G_push(W*i+j,W*(i-1)+j,0);\n if(j>0 && C.at(i).at(j-1)=='.')G_push(W*i+j+N,W*i+j-1+N,0);\n G_push(W*i+j,W*i+j+N,1);\n }\n G_push(W*sx+sy,W*sx+sy+N,0);\n dijkstra(W*sx+sy);\n printf(\"%lld\\n\",min(d[W*gx+gy],d[W*gx+gy+N]));\n return 0;\n}\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar rs: int :: cui@inputInt() - 1\n\tvar cs: int :: cui@inputInt() - 1\n\tvar rt: int :: cui@inputInt() - 1\n\tvar ct: int :: cui@inputInt() - 1\n\t\n\tvar s: [][]char :: #[h][]char\n\tfor y(0, h - 1)\n\t\tdo s[y] :: cui@input()\n\tend for\n\t\n\tvar dx: []int :: [1, 0, -1, 0]\n\tvar dy: []int :: [0, 1, 0, -1]\n\tvar qn: queue :: #queue\n\t\n\tconst infinity: int :: lib@intMax\n\tvar v: [][][]int :: #[h, w, 2]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo v[y][x][0] :: infinity\n\t\t\tdo v[y][x][1] :: infinity\n\t\tend for\n\tend for\n\tdo v[rs][cs][0] :: 0\n\tdo v[rs][cs][1] :: 0\n\tfor i(0, 3)\n\t\tdo qn.add((rs * w + cs) * 4 + i)\n\tend for\n\t\n\tvar cnt: int :: 0\n\twhile(^qn <> 0)\n\t\tvar q: queue :: ##qn\n\t\tdo qn :: #queue\n\t\twhile(^q <> 0)\n\t\t\tvar val: int :: q.get()\n\t\t\tvar pos: int :: val / 4\n\t\t\tvar y: int :: pos / w\n\t\t\tvar x: int :: pos % w\n\t\t\tvar dir: int :: val % 4\n\t\t\twhile loop(true)\n\t\t\t\tdo v[y][x][dir % 2] :: [v[y][x][dir % 2], cnt].min()\n\t\t\t\tif(v[y][x][1 - dir % 2] = infinity)\n\t\t\t\t\tdo qn.add((y * w + x) * 4 + (dir + 1) % 4)\n\t\t\t\t\tdo qn.add((y * w + x) * 4 + (dir + 3) % 4)\n\t\t\t\tend if\n\t\t\t\tdo y :+ dy[dir]\n\t\t\t\tdo x :+ dx[dir]\n\t\t\t\tif(x = -1 | x = w)\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tif(y = -1 | y = h)\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tif(s[y][x] = '#')\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tif(v[y][x][dir % 2] <= cnt)\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\tend while\n\t\tend while\n\t\tdo cnt :+ 1\n\tend while\n\t\n\tvar ans: int :: v[rt][ct].min()\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 249, "name": "043", "Crystal": "struct Point\n Direction = {Point.new(0, 1), Point.new(1, 0), Point.new(0, -1), Point.new(-1, 0)}\n\n property y : Int32\n property x : Int32\n\n def initialize(@y, @x)\n end\n\n def +(other : Point)\n Point.new(y + other.y, x + other.x)\n end\n\n def in_range?(h, w)\n (0...h).includes?(y) && (0...w).includes?(x)\n end\nend\n\nstruct Vertex\n getter p : Point\n getter d : Int32\n\n def initialize(@p, @d)\n end\n\n def to_i(w)\n p.y * w * 4 + p.x * 4 + d\n end\nend\n\nh, w = read_line.split.map(&.to_i)\nstart, goal = {0, 1}.map {\n y, x = read_line.split.map(&.to_i.pred)\n Point.new(y, x)\n}\ns = (1..h).map { read_line }\n\ndist = Array(Int32?).new(h * w * 4, nil)\ndeque = Deque({Vertex, Int32}).new\n(0...4).each do |d|\n e = Vertex.new(start, d)\n dist[e.to_i(w)] = 0\n deque << {e, 0}\nend\n\nadd_edge = ->(dist_from : Int32, to : Vertex, cost : Int32) {\n dist_to = dist[to.to_i(w)]\n if dist_to.nil? || dist_to > dist_from + cost\n dist_to = dist_from + cost\n dist[to.to_i(w)] = dist_to\n if cost == 0\n deque.push({to, dist_to})\n else\n deque.unshift({to, dist_to})\n end\n end\n}\n\nuntil deque.empty?\n v, dist_now = deque.pop\n dist_from = dist[v.to_i(w)].not_nil!\n next if dist_from < dist_now\n\n d1 = v.d\n dir = Point::Direction[v.d]\n p1, p2 = v.p, v.p + dir\n\n if p2.in_range?(h, w) && s[p2.y][p2.x] == '.'\n add_edge.call(dist_from, Vertex.new(p2, d1), 0)\n end\n {d1 - 1, d1 + 1}.each do |d2|\n add_edge.call(dist_from, Vertex.new(p1, d2 % 4), 1)\n end\nend\n\nputs (0...4).min_of { |d|\n dist[Vertex.new(goal, d).to_i(w)].not_nil!\n}\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar rs: int :: cui@inputInt() - 1\n\tvar cs: int :: cui@inputInt() - 1\n\tvar rt: int :: cui@inputInt() - 1\n\tvar ct: int :: cui@inputInt() - 1\n\t\n\tvar s: [][]char :: #[h][]char\n\tfor y(0, h - 1)\n\t\tdo s[y] :: cui@input()\n\tend for\n\t\n\tvar dx: []int :: [1, 0, -1, 0]\n\tvar dy: []int :: [0, 1, 0, -1]\n\tvar qn: queue :: #queue\n\t\n\tconst infinity: int :: lib@intMax\n\tvar v: [][][]int :: #[h, w, 2]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo v[y][x][0] :: infinity\n\t\t\tdo v[y][x][1] :: infinity\n\t\tend for\n\tend for\n\tdo v[rs][cs][0] :: 0\n\tdo v[rs][cs][1] :: 0\n\tfor i(0, 3)\n\t\tdo qn.add((rs * w + cs) * 4 + i)\n\tend for\n\t\n\tvar cnt: int :: 0\n\twhile(^qn <> 0)\n\t\tvar q: queue :: ##qn\n\t\tdo qn :: #queue\n\t\twhile(^q <> 0)\n\t\t\tvar val: int :: q.get()\n\t\t\tvar pos: int :: val / 4\n\t\t\tvar y: int :: pos / w\n\t\t\tvar x: int :: pos % w\n\t\t\tvar dir: int :: val % 4\n\t\t\twhile loop(true)\n\t\t\t\tdo v[y][x][dir % 2] :: [v[y][x][dir % 2], cnt].min()\n\t\t\t\tif(v[y][x][1 - dir % 2] = infinity)\n\t\t\t\t\tdo qn.add((y * w + x) * 4 + (dir + 1) % 4)\n\t\t\t\t\tdo qn.add((y * w + x) * 4 + (dir + 3) % 4)\n\t\t\t\tend if\n\t\t\t\tdo y :+ dy[dir]\n\t\t\t\tdo x :+ dx[dir]\n\t\t\t\tif(x = -1 | x = w)\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tif(y = -1 | y = h)\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tif(s[y][x] = '#')\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tif(v[y][x][dir % 2] <= cnt)\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\tend while\n\t\tend while\n\t\tdo cnt :+ 1\n\tend while\n\t\n\tvar ans: int :: v[rt][ct].min()\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 250, "name": "044", "Crystal": "n, q = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\ni = 0\nq.times do\n t, x, y = read_line.split.map(&.to_i.pred)\n case t\n when 0\n a[(i + x) % n], a[(i + y) % n] = a[(i + y) % n], a[(i + x) % n]\n when 1\n i -= 1\n when 2\n puts a[(i + x) % n]\n end\nend\n", "C++": "#include \n#include \n#define rep(i, n) for(int i = 0; i < n; i++)\nusing namespace std;\n\nint main(){\n int n,q;\n cin >> n >> q;\n deque a(n);\n rep(i, n) cin >> a[i];\n\n rep(i, q){\n int t,x,y;\n cin >> t >> x >> y;\n x--; y--;\n if(t == 1) swap(a[x], a[y]);\n if(t == 2){\n int v = a[n - 1];\n a.erase(a.end() - 1);\n a.push_front(v);\n }\n if(t == 3) cout << a[x] << \"\\n\";\n }\n}" }, { "id": 251, "name": "044", "Crystal": "n, q = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i)\ni = 0\nq.times do\n t, x, y = read_line.split.map(&.to_i.pred)\n case t\n when 0\n a[(i + x) % n], a[(i + y) % n] = a[(i + y) % n], a[(i + x) % n]\n when 1\n i -= 1\n when 2\n puts a[(i + x) % n]\n end\nend\n", "Kuin": "var offset: int\nvar n: int\n\nfunc main()\n\tdo @n :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[@n]int\n\tfor i(0, @n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tvar x: int :: cui@inputInt() - 1\n\t\tvar y: int :: cui@inputInt() - 1\n\t\tswitch(t)\n\t\tcase 1\n\t\t\tvar tmp: int :: a[idx(x)]\n\t\t\tdo a[idx(x)] :: a[idx(y)]\n\t\t\tdo a[idx(y)] :: tmp\n\t\tcase 2\n\t\t\tdo @offset :+ @n - 1\n\t\tcase 3\n\t\t\tvar ans: int :: a[idx(x)]\n\t\t\tdo cui@print(\"\\{ans}\\n\")\n\t\tend switch\n\tend for\n\t\n\tfunc idx(i: int): int\n\t\tret(i + @offset) % @n\n\tend func\nend func\n" }, { "id": 252, "name": "044", "C++": "#include \n#include \n#define rep(i, n) for(int i = 0; i < n; i++)\nusing namespace std;\n\nint main(){\n int n,q;\n cin >> n >> q;\n deque a(n);\n rep(i, n) cin >> a[i];\n\n rep(i, q){\n int t,x,y;\n cin >> t >> x >> y;\n x--; y--;\n if(t == 1) swap(a[x], a[y]);\n if(t == 2){\n int v = a[n - 1];\n a.erase(a.end() - 1);\n a.push_front(v);\n }\n if(t == 3) cout << a[x] << \"\\n\";\n }\n}", "Kuin": "var offset: int\nvar n: int\n\nfunc main()\n\tdo @n :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[@n]int\n\tfor i(0, @n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tvar x: int :: cui@inputInt() - 1\n\t\tvar y: int :: cui@inputInt() - 1\n\t\tswitch(t)\n\t\tcase 1\n\t\t\tvar tmp: int :: a[idx(x)]\n\t\t\tdo a[idx(x)] :: a[idx(y)]\n\t\t\tdo a[idx(y)] :: tmp\n\t\tcase 2\n\t\t\tdo @offset :+ @n - 1\n\t\tcase 3\n\t\t\tvar ans: int :: a[idx(x)]\n\t\t\tdo cui@print(\"\\{ans}\\n\")\n\t\tend switch\n\tend for\n\t\n\tfunc idx(i: int): int\n\t\tret(i + @offset) % @n\n\tend func\nend func\n" }, { "id": 253, "name": "045", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, K;\n\n\tcin >> N >> K;\n\n\tvector X(N), Y(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tcin >> X[i] >> Y[i];\n\n\t}\n\n\tvector > d(N, vector(N));\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\td[i][j] = (long long)(X[i] - X[j]) * (X[i] - X[j]) + (long long)(Y[i] - Y[j]) * (Y[i] - Y[j]);\n\n\t\t}\n\n\t}\n\n\tvector cost(1 << N);\n\n\tfor (int i = 1; i < 1 << N; ++i) {\n\n\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\tfor (int k = 0; k < j; ++k) {\n\n\t\t\t\tif (((i >> j) & 1) == 1 && ((i >> k) & 1) == 1) {\n\n\t\t\t\t\tcost[i] = max(cost[i], d[j][k]);\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tvector > dp(K + 1, vector(1 << N, 1LL << 62));\n\n\tdp[0][0] = 0;\n\n\tfor (int i = 1; i <= K; ++i) {\n\n\t\tfor (int j = 1; j < 1 << N; ++j) {\n\n\t\t\tfor (int k = j; k != 0; k = (k - 1) & j) {\n\n\t\t\t\tdp[i][j] = min(dp[i][j], max(dp[i - 1][j - k], cost[k]));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tcout << dp[K][(1 << N) - 1] << endl;\n\n\treturn 0;\n\n}", "Crystal": "struct Int\n def each_subset(&)\n yield self\n sub = ~-self & self\n loop do\n yield sub\n sub = ~-sub & self\n break if sub == 0\n end\n end\nend\n\nn, k = read_line.split.map(&.to_i)\npoints = (1..n).map { {Int64, Int64}.from read_line.split.map(&.to_i64) }\n\nmax_dist = (0...1 << n).map { |set|\n (0...n).select { |i|\n set.bit(i) == 1\n }.combinations(2).max_of? { |(i, j)|\n (points[i][0] - points[j][0])**2 + (points[i][1] - points[j][1])**2\n } || 0i64\n}\n\ndp = (0...1 << n).map { [10i64 ** 18] * -~k }\ndp[0][0] = 0\n(1...1 << n).each do |set|\n (0...k).each do |i|\n set.each_subset do |sub|\n dp[set][i + 1] = {dp[set][i + 1], {dp[set & ~sub][i], max_dist[sub]}.max}.min\n end\n end\nend\nputs dp[-1][-1]\n" }, { "id": 254, "name": "046", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nvoid print_vector(vector v) {\n for (int i : v) {\n cout << i << \" \";\n }\n cout << endl;\n}\n\nint main() {\n int n;\n cin >> n;\n vector a(n), b(n), c(n);\n rep(i, n) cin >> a[i];\n rep(i, n) cin >> b[i];\n rep(i, n) cin >> c[i];\n vector buc_a(46), buc_b(46), buc_c(46);\n rep(i, n) { buc_c[c[i] % 46]++; }\n rep(i, n) {\n rep(j, 46) { buc_b[(j + b[i]) % 46] += buc_c[j]; }\n }\n rep(i, n) {\n rep(j, 46) { buc_a[(j + a[i]) % 46] += buc_b[j]; }\n }\n cout << buc_a[0] << endl;\n}", "Crystal": "read_line\na = (1..3).map {\n b = read_line.split.map(&.to_i.%(46))\n (0...46).map { |i| b.count(i) }\n}\nmod46 = (0...46).to_a\nputs Array.product(mod46, mod46, mod46).select { |indices|\n indices.sum % 46 == 0\n}.sum { |indices|\n a.zip(indices).product { |(b, i)| b[i].to_i64 }\n}\n" }, { "id": 255, "name": "046", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nvoid print_vector(vector v) {\n for (int i : v) {\n cout << i << \" \";\n }\n cout << endl;\n}\n\nint main() {\n int n;\n cin >> n;\n vector a(n), b(n), c(n);\n rep(i, n) cin >> a[i];\n rep(i, n) cin >> b[i];\n rep(i, n) cin >> c[i];\n vector buc_a(46), buc_b(46), buc_c(46);\n rep(i, n) { buc_c[c[i] % 46]++; }\n rep(i, n) {\n rep(j, 46) { buc_b[(j + b[i]) % 46] += buc_c[j]; }\n }\n rep(i, n) {\n rep(j, 46) { buc_a[(j + a[i]) % 46] += buc_b[j]; }\n }\n cout << buc_a[0] << endl;\n}", "Python": "import sys, numpy\n\nsys.stdin.readline()\n\nA = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\nB = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\nC = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\n\nm = 46\n\na = numpy.bincount(A % m, minlength=m)\nb = numpy.bincount(B % m, minlength=m)\nc = numpy.bincount(C % m, minlength=m)\n\nprint(sum(a[i] * b[j] * c[-(i+j) % m] for i, j in numpy.ndindex(m, m)))\n" }, { "id": 256, "name": "046", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nvoid print_vector(vector v) {\n for (int i : v) {\n cout << i << \" \";\n }\n cout << endl;\n}\n\nint main() {\n int n;\n cin >> n;\n vector a(n), b(n), c(n);\n rep(i, n) cin >> a[i];\n rep(i, n) cin >> b[i];\n rep(i, n) cin >> c[i];\n vector buc_a(46), buc_b(46), buc_c(46);\n rep(i, n) { buc_c[c[i] % 46]++; }\n rep(i, n) {\n rep(j, 46) { buc_b[(j + b[i]) % 46] += buc_c[j]; }\n }\n rep(i, n) {\n rep(j, 46) { buc_a[(j + a[i]) % 46] += buc_b[j]; }\n }\n cout << buc_a[0] << endl;\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: [][]int :: #[3, n]int\n\tfor i(0, 2)\n\t\tfor j(0, n - 1)\n\t\t\tdo a[i][j] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tconst mod: int :: 46\n\tvar dp: [][]int :: #[4, mod]int\n\tdo dp[0][0] :: 1\n\t\n\tfor i(0, 2)\n\t\tfor j(0, n - 1)\n\t\t\tvar v: int :: a[i][j]\n\t\t\tfor k(0, mod - 1)\n\t\t\t\tdo dp[i + 1][(k + v)%mod] :+ dp[i][k]\n\t\t\tend for\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[3][0]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 257, "name": "046", "Crystal": "read_line\na = (1..3).map {\n b = read_line.split.map(&.to_i.%(46))\n (0...46).map { |i| b.count(i) }\n}\nmod46 = (0...46).to_a\nputs Array.product(mod46, mod46, mod46).select { |indices|\n indices.sum % 46 == 0\n}.sum { |indices|\n a.zip(indices).product { |(b, i)| b[i].to_i64 }\n}\n", "Python": "import sys, numpy\n\nsys.stdin.readline()\n\nA = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\nB = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\nC = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\n\nm = 46\n\na = numpy.bincount(A % m, minlength=m)\nb = numpy.bincount(B % m, minlength=m)\nc = numpy.bincount(C % m, minlength=m)\n\nprint(sum(a[i] * b[j] * c[-(i+j) % m] for i, j in numpy.ndindex(m, m)))\n" }, { "id": 258, "name": "046", "Crystal": "read_line\na = (1..3).map {\n b = read_line.split.map(&.to_i.%(46))\n (0...46).map { |i| b.count(i) }\n}\nmod46 = (0...46).to_a\nputs Array.product(mod46, mod46, mod46).select { |indices|\n indices.sum % 46 == 0\n}.sum { |indices|\n a.zip(indices).product { |(b, i)| b[i].to_i64 }\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: [][]int :: #[3, n]int\n\tfor i(0, 2)\n\t\tfor j(0, n - 1)\n\t\t\tdo a[i][j] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tconst mod: int :: 46\n\tvar dp: [][]int :: #[4, mod]int\n\tdo dp[0][0] :: 1\n\t\n\tfor i(0, 2)\n\t\tfor j(0, n - 1)\n\t\t\tvar v: int :: a[i][j]\n\t\t\tfor k(0, mod - 1)\n\t\t\t\tdo dp[i + 1][(k + v)%mod] :+ dp[i][k]\n\t\t\tend for\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[3][0]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 259, "name": "046", "Python": "import sys, numpy\n\nsys.stdin.readline()\n\nA = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\nB = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\nC = numpy.fromstring(sys.stdin.readline(), dtype=int, sep=' ')\n\nm = 46\n\na = numpy.bincount(A % m, minlength=m)\nb = numpy.bincount(B % m, minlength=m)\nc = numpy.bincount(C % m, minlength=m)\n\nprint(sum(a[i] * b[j] * c[-(i+j) % m] for i, j in numpy.ndindex(m, m)))\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: [][]int :: #[3, n]int\n\tfor i(0, 2)\n\t\tfor j(0, n - 1)\n\t\t\tdo a[i][j] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tconst mod: int :: 46\n\tvar dp: [][]int :: #[4, mod]int\n\tdo dp[0][0] :: 1\n\t\n\tfor i(0, 2)\n\t\tfor j(0, n - 1)\n\t\t\tvar v: int :: a[i][j]\n\t\t\tfor k(0, mod - 1)\n\t\t\t\tdo dp[i + 1][(k + v)%mod] :+ dp[i][k]\n\t\t\tend for\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: dp[3][0]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 260, "name": "047", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nconst int mod = 699999953; // large prime number\n\nint main() {\n\n\tint N; string S, T;\n\n\tcin >> N >> S >> T;\n\n\tvector seq1(N), seq3(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tseq1[i] = (S[i] == 'R' ? 0 : (S[i] == 'G' ? 1 : 2));\n\n\t\tseq3[i] = (T[i] == 'R' ? 0 : (T[i] == 'G' ? 1 : 2));\n\n\t}\n\n\tint answer = 0;\n\n\tfor (int i = 0; i < 3; ++i) {\n\n\t\tvector seq2(N);\n\n\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\tseq2[j] = (i - seq3[j] + 3) % 3;\n\n\t\t}\n\n\t\tint power3 = 1, hash1 = 0, hash2 = 0;\n\n\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\thash1 = (hash1 * 3 + seq1[j]) % mod;\n\n\t\t\thash2 = (hash2 + power3 * seq2[N - j - 1]) % mod;\n\n\t\t\tif (hash1 == hash2) {\n\n\t\t\t\t++answer;\n\n\t\t\t}\n\n\t\t\tpower3 = power3 * 3 % mod;\n\n\t\t}\n\n\t\tpower3 = 1, hash1 = 0, hash2 = 0;\n\n\t\tfor (int j = 0; j < N - 1; ++j) {\n\n\t\t\thash1 = (hash1 + power3 * seq1[N - j - 1]) % mod;\n\n\t\t\thash2 = (hash2 * 3 + seq2[j]) % mod;\n\n\t\t\tif (hash1 == hash2) {\n\n\t\t\t\t++answer;\n\n\t\t\t}\n\n\t\t\tpower3 = power3 * 3 % mod;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "class RollingHash\n MOD = (1u64 << 61) - 1\n\n private def mul(a : UInt64, b : UInt64)\n t = a.to_u128 * b\n t = (t >> 61) + (t & MOD)\n (t < MOD ? t : t - MOD).to_u64\n end\n\n getter size : Int32\n\n def initialize(s : String, base : UInt64 = 10007u64)\n initialize(s.size, s.each_char, base, &.ord)\n end\n\n def initialize(a : Array(Int), base : UInt64 = 10007u64)\n initialize(a.size, a, base, &.itself)\n end\n\n def initialize(@size, a : Enumerable, base : UInt64 = 10007u64, &)\n @pow = Array(UInt64).new(size + 1, 1)\n @hash = Array(UInt64).new(size + 1, 0)\n a.each_with_index do |x, i|\n @pow[i + 1] = mul(@pow[i], base)\n @hash[i + 1] = mul(@hash[i], base) + yield(x)\n @hash[i + 1] -= MOD if @hash[i + 1] >= MOD\n end\n end\n\n def [](start : Int, count : Int)\n res = @hash[start + count] + MOD - mul(@hash[start], @pow[count])\n res < MOD ? res : res - MOD\n end\n\n def [](range : Range)\n self[*Indexable.range_to_index_and_count(range, size) || raise IndexError.new]\n end\nend\n\nn = read_line.to_i\ns, t = {0, 1}.map {\n read_line.chars.map { |c| \"RGB\".index(c).not_nil! }\n}\ns_rh = RollingHash.new(s)\nputs (0...3).sum { |k|\n t_rh = RollingHash.new(n, t) { |i| i == k ? i : 3 ^ k ^ i }\n (-n + 1...n).count do |i|\n if i < 0\n s_rh[-i, n + i] == t_rh[0, n + i]\n else\n s_rh[0, n - i] == t_rh[i, n - i]\n end\n end\n}\n" }, { "id": 261, "name": "048", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nint main() {\n int n, k;\n cin >> n >> k;\n priority_queue> q;\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n q.push({b, a});\n }\n ll ans = 0;\n while (k > 0) {\n pair now = q.top();\n q.pop();\n ans += now.first;\n q.push({now.second - now.first, -1});\n k--;\n }\n cout << ans << endl;\n}", "Crystal": "n, k = read_line.split.map(&.to_i)\nputs (1..n).flat_map {\n a, b = read_line.split.map(&.to_i64)\n [a - b, b]\n}.sort[-k..].sum\n" }, { "id": 262, "name": "048", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nint main() {\n int n, k;\n cin >> n >> k;\n priority_queue> q;\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n q.push({b, a});\n }\n ll ans = 0;\n while (k > 0) {\n pair now = q.top();\n q.pop();\n ans += now.first;\n q.push({now.second - now.first, -1});\n k--;\n }\n cout << ans << endl;\n}", "Python": "#!/usr/bin/env python3\n\n\ndef main():\n n, k = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n\n points = []\n for [a, b] in ab:\n points.append(b)\n points.append(a - b)\n\n points.sort()\n points.reverse()\n\n ans = sum(points[:k])\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n" }, { "id": 263, "name": "048", "C++": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\ntypedef long long ll;\n\nint main() {\n int n, k;\n cin >> n >> k;\n priority_queue> q;\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n q.push({b, a});\n }\n ll ans = 0;\n while (k > 0) {\n pair now = q.top();\n q.pop();\n ans += now.first;\n q.push({now.second - now.first, -1});\n k--;\n }\n cout << ans << endl;\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar c: []int :: #[2 * n]int\n\tfor i(0, n - 1)\n\t\tvar a: int :: cui@inputInt()\n\t\tvar b: int :: cui@inputInt()\n\t\tdo c[2 * i] :: b\n\t\tdo c[2 * i + 1] :: a - b\n\tend for\n\tdo c.sort()\n\tdo c.reverse()\n\t\n\tvar ans: int :: 0\n\tfor i(0, k - 1)\n\t\tdo ans :+ c[i]\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 264, "name": "048", "Crystal": "n, k = read_line.split.map(&.to_i)\nputs (1..n).flat_map {\n a, b = read_line.split.map(&.to_i64)\n [a - b, b]\n}.sort[-k..].sum\n", "Python": "#!/usr/bin/env python3\n\n\ndef main():\n n, k = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n\n points = []\n for [a, b] in ab:\n points.append(b)\n points.append(a - b)\n\n points.sort()\n points.reverse()\n\n ans = sum(points[:k])\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n" }, { "id": 265, "name": "048", "Crystal": "n, k = read_line.split.map(&.to_i)\nputs (1..n).flat_map {\n a, b = read_line.split.map(&.to_i64)\n [a - b, b]\n}.sort[-k..].sum\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar c: []int :: #[2 * n]int\n\tfor i(0, n - 1)\n\t\tvar a: int :: cui@inputInt()\n\t\tvar b: int :: cui@inputInt()\n\t\tdo c[2 * i] :: b\n\t\tdo c[2 * i + 1] :: a - b\n\tend for\n\tdo c.sort()\n\tdo c.reverse()\n\t\n\tvar ans: int :: 0\n\tfor i(0, k - 1)\n\t\tdo ans :+ c[i]\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 266, "name": "048", "Python": "#!/usr/bin/env python3\n\n\ndef main():\n n, k = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n\n points = []\n for [a, b] in ab:\n points.append(b)\n points.append(a - b)\n\n points.sort()\n points.reverse()\n\n ans = sum(points[:k])\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar c: []int :: #[2 * n]int\n\tfor i(0, n - 1)\n\t\tvar a: int :: cui@inputInt()\n\t\tvar b: int :: cui@inputInt()\n\t\tdo c[2 * i] :: b\n\t\tdo c[2 * i + 1] :: a - b\n\tend for\n\tdo c.sort()\n\tdo c.reverse()\n\t\n\tvar ans: int :: 0\n\tfor i(0, k - 1)\n\t\tdo ans :+ c[i]\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 267, "name": "049", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass UnionFind {\n\npublic:\n\n\tvector par;\n\n\n\n\tvoid init(int sz) {\n\n\t\tpar.resize(sz, -1);\n\n\t}\n\n\tint root(int pos) {\n\n\t\tif (par[pos] == -1) return pos;\n\n\t\tpar[pos] = root(par[pos]);\n\n\t\treturn par[pos];\n\n\t}\n\n\tvoid unite(int u, int v) {\n\n\t\tu = root(u); v = root(v);\n\n\t\tif (u == v) return;\n\n\t\tpar[u] = v;\n\n\t}\n\n\tbool same(int u, int v) {\n\n\t\tif (root(u) == root(v)) return true;\n\n\t\treturn false;\n\n\t}\n\n};\n\n\n\nlong long N, M;\n\nlong long C[1 << 19], L[1 << 19], R[1 << 19];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) {\n\n\t\tcin >> C[i] >> L[i] >> R[i];\n\n\t}\n\n\n\n\t// Step #2. ソート\n\n\tvector> tup;\n\n\tfor (int i = 1; i <= M; i++) tup.push_back(make_tuple(C[i], L[i] - 1, R[i]));\n\n\tsort(tup.begin(), tup.end());\n\n\n\n\t// Step #3. 最小全域木を求める\n\n\tlong long cnt1 = 0, cnt2 = 0;\n\n\tUnionFind UF;\n\n\tUF.init(N + 2);\n\n\tfor (int i = 0; i < tup.size(); i++) {\n\n\t\tint u = get<1>(tup[i]);\n\n\t\tint v = get<2>(tup[i]);\n\n\t\tif (UF.same(u, v) == false) {\n\n\t\t\tUF.unite(u, v);\n\n\t\t\tcnt1 += get<0>(tup[i]);\n\n\t\t\tcnt2 += 1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tif (cnt2 != N) cout << \"-1\" << endl;\n\n\telse cout << cnt1 << endl;\n\n\treturn 0;\n\n}", "Crystal": "class UnionFind\n @d : Array(Int32)\n\n def initialize(n : Int32)\n @d = Array.new(n, -1)\n end\n\n def root(x : Int32)\n @d[x] < 0 ? x : (@d[x] = root(@d[x]))\n end\n\n def unite(x : Int32, y : Int32)\n x = root(x)\n y = root(y)\n return false if x == y\n x, y = y, x if @d[x] > @d[y]\n @d[x] += @d[y]\n @d[y] = x\n true\n end\n\n def same?(x : Int32, y : Int32)\n root(x) == root(y)\n end\n\n def size(x : Int32)\n -@d[root(x)]\n end\nend\n\nstruct Edge2(T)\n include Comparable(Edge2(T))\n\n property from : Int32\n property to : Int32\n property cost : T\n\n def initialize(@from : Int32, @to : Int32, @cost : T)\n end\n\n def <=>(other : Edge2(T))\n {cost, from, to} <=> {other.cost, other.from, other.to}\n end\n\n def to_s(io) : Nil\n io << '(' << from << \", \" << to << \", \" << cost << ')'\n end\nend\n\ndef kruskal(n : Int32, edges : Array(Edge2(T))) : T? forall T\n uf = UnionFind.new(n)\n result = edges.sort.sum do |edge|\n if uf.unite(edge.from, edge.to)\n edge.cost\n else\n T.zero\n end\n end\n uf.size(0) == n ? result : nil\nend\n\nn, m = read_line.split.map(&.to_i)\nedges = (1..m).map {\n c, l, r = read_line.split.map(&.to_i)\n Edge2.new(l - 1, r, c.to_i64)\n}\nputs kruskal(n + 1, edges) || -1\n" }, { "id": 268, "name": "049", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nclass UnionFind {\n\npublic:\n\n\tvector par;\n\n\n\n\tvoid init(int sz) {\n\n\t\tpar.resize(sz, -1);\n\n\t}\n\n\tint root(int pos) {\n\n\t\tif (par[pos] == -1) return pos;\n\n\t\tpar[pos] = root(par[pos]);\n\n\t\treturn par[pos];\n\n\t}\n\n\tvoid unite(int u, int v) {\n\n\t\tu = root(u); v = root(v);\n\n\t\tif (u == v) return;\n\n\t\tpar[u] = v;\n\n\t}\n\n\tbool same(int u, int v) {\n\n\t\tif (root(u) == root(v)) return true;\n\n\t\treturn false;\n\n\t}\n\n};\n\n\n\nlong long N, M;\n\nlong long C[1 << 19], L[1 << 19], R[1 << 19];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> M;\n\n\tfor (int i = 1; i <= M; i++) {\n\n\t\tcin >> C[i] >> L[i] >> R[i];\n\n\t}\n\n\n\n\t// Step #2. ソート\n\n\tvector> tup;\n\n\tfor (int i = 1; i <= M; i++) tup.push_back(make_tuple(C[i], L[i] - 1, R[i]));\n\n\tsort(tup.begin(), tup.end());\n\n\n\n\t// Step #3. 最小全域木を求める\n\n\tlong long cnt1 = 0, cnt2 = 0;\n\n\tUnionFind UF;\n\n\tUF.init(N + 2);\n\n\tfor (int i = 0; i < tup.size(); i++) {\n\n\t\tint u = get<1>(tup[i]);\n\n\t\tint v = get<2>(tup[i]);\n\n\t\tif (UF.same(u, v) == false) {\n\n\t\t\tUF.unite(u, v);\n\n\t\t\tcnt1 += get<0>(tup[i]);\n\n\t\t\tcnt2 += 1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. 出力\n\n\tif (cnt2 != N) cout << \"-1\" << endl;\n\n\telse cout << cnt1 << endl;\n\n\treturn 0;\n\n}", "Python": "from numpy import*\nfrom scipy.sparse import*\n(n,m),*a=[int_(t.split())for t in open(0)]\na=int_(a).T\na[1]-=1\na=a[:,argsort(a[0])]\na=a[:,unique(a[1:],return_index=1,axis=1)[1]]\nprint([-1,int(sum(b:=csgraph.minimum_spanning_tree(coo_matrix((a[0],a[1:]),(n+1,n+1))).data))][len(b)==n])" }, { "id": 269, "name": "049", "Crystal": "class UnionFind\n @d : Array(Int32)\n\n def initialize(n : Int32)\n @d = Array.new(n, -1)\n end\n\n def root(x : Int32)\n @d[x] < 0 ? x : (@d[x] = root(@d[x]))\n end\n\n def unite(x : Int32, y : Int32)\n x = root(x)\n y = root(y)\n return false if x == y\n x, y = y, x if @d[x] > @d[y]\n @d[x] += @d[y]\n @d[y] = x\n true\n end\n\n def same?(x : Int32, y : Int32)\n root(x) == root(y)\n end\n\n def size(x : Int32)\n -@d[root(x)]\n end\nend\n\nstruct Edge2(T)\n include Comparable(Edge2(T))\n\n property from : Int32\n property to : Int32\n property cost : T\n\n def initialize(@from : Int32, @to : Int32, @cost : T)\n end\n\n def <=>(other : Edge2(T))\n {cost, from, to} <=> {other.cost, other.from, other.to}\n end\n\n def to_s(io) : Nil\n io << '(' << from << \", \" << to << \", \" << cost << ')'\n end\nend\n\ndef kruskal(n : Int32, edges : Array(Edge2(T))) : T? forall T\n uf = UnionFind.new(n)\n result = edges.sort.sum do |edge|\n if uf.unite(edge.from, edge.to)\n edge.cost\n else\n T.zero\n end\n end\n uf.size(0) == n ? result : nil\nend\n\nn, m = read_line.split.map(&.to_i)\nedges = (1..m).map {\n c, l, r = read_line.split.map(&.to_i)\n Edge2.new(l - 1, r, c.to_i64)\n}\nputs kruskal(n + 1, edges) || -1\n", "Python": "from numpy import*\nfrom scipy.sparse import*\n(n,m),*a=[int_(t.split())for t in open(0)]\na=int_(a).T\na[1]-=1\na=a[:,argsort(a[0])]\na=a[:,unique(a[1:],return_index=1,axis=1)[1]]\nprint([-1,int(sum(b:=csgraph.minimum_spanning_tree(coo_matrix((a[0],a[1:]),(n+1,n+1))).data))][len(b)==n])" }, { "id": 270, "name": "050", "C++": "#include \n\nusing namespace std;\n\n\n\nint mod = 1000000007;\n\nint N, L, dp[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> L;\n\n\n\n\t// Step #2. 動的計画法\n\n\tdp[0] = 1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i < L) dp[i] = dp[i - 1];\n\n\t\telse dp[i] = (dp[i - 1] + dp[i - L]) % mod;\n\n\t}\n\n\n\n\t// Step #3. 出力\n\n\tcout << dp[N] << endl;\n\n\treturn 0;\n\n}", "Crystal": "MOD = 10**9 + 7\nn, l = read_line.split.map(&.to_i)\ndp = Array.new(n + 1, 0i64)\ndp[0] = 1i64\n(1..n).each do |i|\n dp[i] += dp[i - 1]\n dp[i] += dp[i - l] if i - l >= 0\n dp[i] %= MOD\nend\nputs dp[n]\n" }, { "id": 271, "name": "050", "C++": "#include \n\nusing namespace std;\n\n\n\nint mod = 1000000007;\n\nint N, L, dp[100009];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> L;\n\n\n\n\t// Step #2. 動的計画法\n\n\tdp[0] = 1;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i < L) dp[i] = dp[i - 1];\n\n\t\telse dp[i] = (dp[i - 1] + dp[i - L]) % mod;\n\n\t}\n\n\n\n\t// Step #3. 出力\n\n\tcout << dp[N] << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tconst mod: int :: 1000000007\n\t\n\tvar dp: []int :: #[n + 1]int\n\tdo dp[0] :: 1\n\tfor i(0, n - 1)\n\t\tdo dp[i + 1] :+ dp[i]\n\t\tdo dp[i + 1] :% mod\n\t\tif(i + l <= n)\n\t\t\tdo dp[i + l] :+ dp[i]\n\t\t\tdo dp[i + l] :% mod\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: dp[n]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 272, "name": "050", "Crystal": "MOD = 10**9 + 7\nn, l = read_line.split.map(&.to_i)\ndp = Array.new(n + 1, 0i64)\ndp[0] = 1i64\n(1..n).each do |i|\n dp[i] += dp[i - 1]\n dp[i] += dp[i - l] if i - l >= 0\n dp[i] %= MOD\nend\nputs dp[n]\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar l: int :: cui@inputInt()\n\tconst mod: int :: 1000000007\n\t\n\tvar dp: []int :: #[n + 1]int\n\tdo dp[0] :: 1\n\tfor i(0, n - 1)\n\t\tdo dp[i + 1] :+ dp[i]\n\t\tdo dp[i + 1] :% mod\n\t\tif(i + l <= n)\n\t\t\tdo dp[i + l] :+ dp[i]\n\t\t\tdo dp[i + l] :% mod\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: dp[n]\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 273, "name": "051", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, K, P, Answer = 0;\n\nlong long A[100];\n\nvector vec1[100], vec2[100];\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N >> K >> P;\n\n\tfor (int i = 0; i < N; i++) cin >> A[i];\n\n\n\n\t// Step #2. ”¼•ª‘S—ñ‹“\n\n\tint mid = N / 2;\n\n\tfor (int i = 0; i < (1 << mid); i++) {\n\n\t\tlong long cnt1 = 0, cnt2 = 0;\n\n\t\tfor (int j = 0; j < mid; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) { cnt1 += A[j]; cnt2 += 1; }\n\n\t\t}\n\n\t\tvec1[cnt2].push_back(cnt1);\n\n\t}\n\n\tfor (int i = 0; i < (1 << (N - mid)); i++) {\n\n\t\tlong long cnt1 = 0, cnt2 = 0;\n\n\t\tfor (int j = 0; j < N - mid; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) { cnt1 += A[mid + j]; cnt2 += 1; }\n\n\t\t}\n\n\t\tvec2[cnt2].push_back(cnt1);\n\n\t}\n\n\t\n\n\t// Step #3. “š‚¦‚ð‹�‚ß‚é\n\n\tfor (int i = 0; i <= N; i++) {\n\n\t\tsort(vec1[i].begin(), vec1[i].end());\n\n\t\tsort(vec2[i].begin(), vec2[i].end());\n\n\t}\n\n\tfor (int h = 0; h <= K; h++) {\n\n\t\tfor (int i = 0; i < (int)vec1[h].size(); i++) {\n\n\t\t\tint pos1 = lower_bound(vec2[K - h].begin(), vec2[K - h].end(), P - vec1[h][i] + 1) - vec2[K - h].begin();\n\n\t\t\tAnswer += (long long)pos1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. �o—Í\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "n, m, k = read_line.split.try { |(n, m, k)| {n.to_i, m.to_i, k.to_i64} }\na = read_line.split.map(&.to_i64)\nb1, b2 = {a[...n // 2], a[n // 2..]}.map { |a|\n (0..m).map do |cnt|\n a.combinations(cnt).map(&.sum).sort\n end\n}\nputs b1.each_with_index.sum { |c, cnt1|\n c.sum do |sum1|\n (b2[m - cnt1].bsearch_index { |sum2| sum1 + sum2 > k } || b2[m - cnt1].size).to_i64\n end\n}\n" }, { "id": 274, "name": "051", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, K, P, Answer = 0;\n\nlong long A[100];\n\nvector vec1[100], vec2[100];\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N >> K >> P;\n\n\tfor (int i = 0; i < N; i++) cin >> A[i];\n\n\n\n\t// Step #2. ”¼•ª‘S—ñ‹“\n\n\tint mid = N / 2;\n\n\tfor (int i = 0; i < (1 << mid); i++) {\n\n\t\tlong long cnt1 = 0, cnt2 = 0;\n\n\t\tfor (int j = 0; j < mid; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) { cnt1 += A[j]; cnt2 += 1; }\n\n\t\t}\n\n\t\tvec1[cnt2].push_back(cnt1);\n\n\t}\n\n\tfor (int i = 0; i < (1 << (N - mid)); i++) {\n\n\t\tlong long cnt1 = 0, cnt2 = 0;\n\n\t\tfor (int j = 0; j < N - mid; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) { cnt1 += A[mid + j]; cnt2 += 1; }\n\n\t\t}\n\n\t\tvec2[cnt2].push_back(cnt1);\n\n\t}\n\n\t\n\n\t// Step #3. “š‚¦‚ð‹�‚ß‚é\n\n\tfor (int i = 0; i <= N; i++) {\n\n\t\tsort(vec1[i].begin(), vec1[i].end());\n\n\t\tsort(vec2[i].begin(), vec2[i].end());\n\n\t}\n\n\tfor (int h = 0; h <= K; h++) {\n\n\t\tfor (int i = 0; i < (int)vec1[h].size(); i++) {\n\n\t\t\tint pos1 = lower_bound(vec2[K - h].begin(), vec2[K - h].end(), P - vec1[h][i] + 1) - vec2[K - h].begin();\n\n\t\t\tAnswer += (long long)pos1;\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #4. �o—Í\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar p: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar m: int :: n / 2\n\tvar x: []list :: #[k + 1]list\n\tfor i(0, k)\n\t\tdo x[i] :: #list\n\tend for\n\tfor id(0, 2 ^ m - 1)\n\t\tvar _: int :: id\n\t\tvar f: []bool :: #[m]bool\n\t\tfor i(0, m - 1)\n\t\t\tdo f[i] :: _ % 2 = 1\n\t\t\tdo _ :/ 2\n\t\tend for\n\t\tvar sum: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, m - 1)\n\t\t\tif(f[i])\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo sum :+ a[i]\n\t\t\tend if\n\t\tend for\n\t\tif(cnt <= k)\n\t\t\tdo x[cnt].add(sum)\n\t\tend if\n\tend for\n\tvar y: [][]int :: #[k + 1][]int\n\tfor i(0, k)\n\t\tdo y[i] :: #[^x[i]]int\n\t\tdo x[i].head()\n\t\tfor j(0, ^x[i] - 1)\n\t\t\tdo y[i][j] :: x[i].get()\n\t\t\tdo x[i].next()\n\t\tend for\n\t\tdo y[i].sort()\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor id(0, 2 ^ (n - m) - 1)\n\t\tvar _: int :: id\n\t\tvar f: []bool :: #[n - m]bool\n\t\tfor i(0, n - m - 1)\n\t\t\tdo f[i] :: _ % 2 = 1\n\t\t\tdo _ :/ 2\n\t\tend for\n\t\tvar sum: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n - m - 1)\n\t\t\tif(f[i])\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo sum :+ a[m + i]\n\t\t\tend if\n\t\tend for\n\t\tif(cnt <= k)\n\t\t\tvar ok: int :: -1\n\t\t\tvar ng: int :: ^y[k - cnt]\n\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\tif(sum + y[k - cnt][mid] <= p)\n\t\t\t\t\tdo ok :: mid\n\t\t\t\telse\n\t\t\t\t\tdo ng :: mid\n\t\t\t\tend if\n\t\t\tend while\n\t\t\tdo ans :+ ok + 1\n\t\tend if\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 275, "name": "051", "Crystal": "n, m, k = read_line.split.try { |(n, m, k)| {n.to_i, m.to_i, k.to_i64} }\na = read_line.split.map(&.to_i64)\nb1, b2 = {a[...n // 2], a[n // 2..]}.map { |a|\n (0..m).map do |cnt|\n a.combinations(cnt).map(&.sum).sort\n end\n}\nputs b1.each_with_index.sum { |c, cnt1|\n c.sum do |sum1|\n (b2[m - cnt1].bsearch_index { |sum2| sum1 + sum2 > k } || b2[m - cnt1].size).to_i64\n end\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\tvar p: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar m: int :: n / 2\n\tvar x: []list :: #[k + 1]list\n\tfor i(0, k)\n\t\tdo x[i] :: #list\n\tend for\n\tfor id(0, 2 ^ m - 1)\n\t\tvar _: int :: id\n\t\tvar f: []bool :: #[m]bool\n\t\tfor i(0, m - 1)\n\t\t\tdo f[i] :: _ % 2 = 1\n\t\t\tdo _ :/ 2\n\t\tend for\n\t\tvar sum: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, m - 1)\n\t\t\tif(f[i])\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo sum :+ a[i]\n\t\t\tend if\n\t\tend for\n\t\tif(cnt <= k)\n\t\t\tdo x[cnt].add(sum)\n\t\tend if\n\tend for\n\tvar y: [][]int :: #[k + 1][]int\n\tfor i(0, k)\n\t\tdo y[i] :: #[^x[i]]int\n\t\tdo x[i].head()\n\t\tfor j(0, ^x[i] - 1)\n\t\t\tdo y[i][j] :: x[i].get()\n\t\t\tdo x[i].next()\n\t\tend for\n\t\tdo y[i].sort()\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor id(0, 2 ^ (n - m) - 1)\n\t\tvar _: int :: id\n\t\tvar f: []bool :: #[n - m]bool\n\t\tfor i(0, n - m - 1)\n\t\t\tdo f[i] :: _ % 2 = 1\n\t\t\tdo _ :/ 2\n\t\tend for\n\t\tvar sum: int :: 0\n\t\tvar cnt: int :: 0\n\t\tfor i(0, n - m - 1)\n\t\t\tif(f[i])\n\t\t\t\tdo cnt :+ 1\n\t\t\t\tdo sum :+ a[m + i]\n\t\t\tend if\n\t\tend for\n\t\tif(cnt <= k)\n\t\t\tvar ok: int :: -1\n\t\t\tvar ng: int :: ^y[k - cnt]\n\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\tif(sum + y[k - cnt][mid] <= p)\n\t\t\t\t\tdo ok :: mid\n\t\t\t\telse\n\t\t\t\t\tdo ng :: mid\n\t\t\t\tend if\n\t\t\tend while\n\t\t\tdo ans :+ ok + 1\n\t\tend if\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 276, "name": "052", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long mod = 1000000007;\n\nlong long N, A[1009][8], Answer = 1;\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 1; j <= 6; j++) cin >> A[i][j];\n\n\t}\n\n\t\n\n\t// Step #2. “š‚¦‚ğ‹�‚ß‚é\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tAnswer *= (A[i][1] + A[i][2] + A[i][3] + A[i][4] + A[i][5] + A[i][6]);\n\n\t\tAnswer %= mod;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "puts (1..read_line.to_i).reduce(1i64) { |acc, _|\n acc * read_line.split.sum(&.to_i) % (10**9 + 7)\n}\n" }, { "id": 277, "name": "052", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long mod = 1000000007;\n\nlong long N, A[1009][8], Answer = 1;\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 1; j <= 6; j++) cin >> A[i][j];\n\n\t}\n\n\t\n\n\t// Step #2. “š‚¦‚ğ‹�‚ß‚é\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tAnswer *= (A[i][1] + A[i][2] + A[i][3] + A[i][4] + A[i][5] + A[i][6]);\n\n\t\tAnswer %= mod;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar ans: int :: 1\n\tfor i(0, n - 1)\n\t\tvar sum: int :: 0\n\t\tfor j(0, 5)\n\t\t\tdo sum :+ cui@inputInt()\n\t\tend for\n\t\tdo ans :* sum\n\t\tdo ans :% 10 ^ 9 + 7\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 278, "name": "052", "Crystal": "puts (1..read_line.to_i).reduce(1i64) { |acc, _|\n acc * read_line.split.sum(&.to_i) % (10**9 + 7)\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\t\n\tvar ans: int :: 1\n\tfor i(0, n - 1)\n\t\tvar sum: int :: 0\n\t\tfor j(0, 5)\n\t\t\tdo sum :+ cui@inputInt()\n\t\tend for\n\t\tdo ans :* sum\n\t\tdo ans :% 10 ^ 9 + 7\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 279, "name": "053", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// ‚±‚ê 16 ‰ñ‚©‚猸‚ç‚·‚ÌŒµ‚µ‚­‚È‚¢‚©�@�â‘Î Diff 2800 ‚ ‚邾‚낱‚ñ‚È‚Ì\n\nint N;\n\nint idx[1609];\n\nint fib[16] = { 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597 };\n\n\n\nint Ask(int pos) {\n\n\tif (idx[pos] == -1) {\n\n\t\tcout << \"? \" << pos << endl;\n\n\t\tint t; cin >> t;\n\n\t\tidx[pos] = t;\n\n\t\treturn t;\n\n\t}\n\n\treturn idx[pos];\n\n}\n\n\n\nvoid solve() {\n\n\tcin >> N;\n\n\n\n\tint Answer = 0;\n\n\tfor (int i = 0; i <= N; i++) idx[i] = -1;\n\n\tfor (int i = N + 1; i <= 1600; i++) idx[i] = -i;\n\n\n\n\tif (N <= 5) {\n\n\t\tfor (int i = 1; i <= N; i++) Answer = max(Answer, Ask(i));\n\n\t}\n\n\telse {\n\n\t\tint cl = 0, cr = 1597, dl = 610, dr = 987;\n\n\t\tint el = Ask(dl);\n\n\t\tint er = Ask(dr);\n\n\t\tAnswer = max({ Answer, el, er });\n\n\t\tif (el < er) { cl = dl; dl = dr; dr = -1; el = er; er = -1; }\n\n\t\telse { cr = dr; dr = dl; dl = -1; er = el; el = -1; }\n\n\n\n\t\tfor (int i = 12; i >= 0; i--) {\n\n\t\t\tif (dl == -1) {\n\n\t\t\t\tdl = cl + fib[i];\n\n\t\t\t\tel = Ask(dl);\n\n\t\t\t}\n\n\t\t\telse if (dr == -1) {\n\n\t\t\t\tdr = cr - fib[i];\n\n\t\t\t\ter = Ask(dr);\n\n\t\t\t}\n\n\t\t\tAnswer = max({ Answer, el, er });\n\n\t\t\tif (el < er) { cl = dl; dl = dr; dr = -1; el = er; er = -1; }\n\n\t\t\telse { cr = dr; dr = dl; dl = -1; er = el; el = -1; }\n\n\t\t}\n\n\t\tfor (int i = cl + 1; i <= cr - 1; i++) Answer = max(Answer, Ask(i));\n\n\t}\n\n\n\n\tcout << \"! \" << Answer << endl;\n\n}\n\n\n\nint main() {\n\n\tint T; cin >> T;\n\n\tfor (int i = 1; i <= T; i++) {\n\n\t\tsolve();\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "class Manager\n getter memo = {} of Int32 => Int32\n\n delegate :[]=, to: @memo\n delegate has_key?, to: @memo\n\n def ask(x : Int32)\n if @memo.has_key?(x)\n @memo[x]\n else\n puts \"? #{x + 1}\"; STDOUT.flush\n res = read_line.to_i\n exit(1) if res == -1\n @memo[x] = res\n end\n end\n\n def answer(val : Int32)\n puts \"! #{val}\"; STDOUT.flush\n end\nend\n\nread_line.to_i.times do\n s = Manager.new\n n = read_line.to_i\n\n if n == 1\n s.answer(s.ask(0))\n next\n end\n\n fib = [1, 1]\n while fib[-1] <= n\n fib << fib[-1] + fib[-2]\n end\n m = fib[-1] - 1\n (n...m).each { |i| s[i] = -i }\n\n range = (0..m - 1)\n fib_i = fib.size - 3\n while range.size >= 3\n li = range.begin + (fib[fib_i] - 1)\n ri = range.end - (fib[fib_i] - 1)\n left, right = s.ask(li), s.ask(ri)\n range = if left >= right\n range.begin..ri - 1\n else\n li + 1..range.end\n end\n fib_i -= 1\n end\n s.answer [s.ask(range.begin), s.ask(range.end)].max\nend\n" }, { "id": 280, "name": "053", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\n// ‚±‚ê 16 ‰ñ‚©‚猸‚ç‚·‚ÌŒµ‚µ‚­‚È‚¢‚©�@�â‘Î Diff 2800 ‚ ‚邾‚낱‚ñ‚È‚Ì\n\nint N;\n\nint idx[1609];\n\nint fib[16] = { 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597 };\n\n\n\nint Ask(int pos) {\n\n\tif (idx[pos] == -1) {\n\n\t\tcout << \"? \" << pos << endl;\n\n\t\tint t; cin >> t;\n\n\t\tidx[pos] = t;\n\n\t\treturn t;\n\n\t}\n\n\treturn idx[pos];\n\n}\n\n\n\nvoid solve() {\n\n\tcin >> N;\n\n\n\n\tint Answer = 0;\n\n\tfor (int i = 0; i <= N; i++) idx[i] = -1;\n\n\tfor (int i = N + 1; i <= 1600; i++) idx[i] = -i;\n\n\n\n\tif (N <= 5) {\n\n\t\tfor (int i = 1; i <= N; i++) Answer = max(Answer, Ask(i));\n\n\t}\n\n\telse {\n\n\t\tint cl = 0, cr = 1597, dl = 610, dr = 987;\n\n\t\tint el = Ask(dl);\n\n\t\tint er = Ask(dr);\n\n\t\tAnswer = max({ Answer, el, er });\n\n\t\tif (el < er) { cl = dl; dl = dr; dr = -1; el = er; er = -1; }\n\n\t\telse { cr = dr; dr = dl; dl = -1; er = el; el = -1; }\n\n\n\n\t\tfor (int i = 12; i >= 0; i--) {\n\n\t\t\tif (dl == -1) {\n\n\t\t\t\tdl = cl + fib[i];\n\n\t\t\t\tel = Ask(dl);\n\n\t\t\t}\n\n\t\t\telse if (dr == -1) {\n\n\t\t\t\tdr = cr - fib[i];\n\n\t\t\t\ter = Ask(dr);\n\n\t\t\t}\n\n\t\t\tAnswer = max({ Answer, el, er });\n\n\t\t\tif (el < er) { cl = dl; dl = dr; dr = -1; el = er; er = -1; }\n\n\t\t\telse { cr = dr; dr = dl; dl = -1; er = el; el = -1; }\n\n\t\t}\n\n\t\tfor (int i = cl + 1; i <= cr - 1; i++) Answer = max(Answer, Ask(i));\n\n\t}\n\n\n\n\tcout << \"! \" << Answer << endl;\n\n}\n\n\n\nint main() {\n\n\tint T; cin >> T;\n\n\tfor (int i = 1; i <= T; i++) {\n\n\t\tsolve();\n\n\t}\n\n\treturn 0;\n\n}", "Ruby": "FIB = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]\n\ndef query(i)\n puts \"? #{i}\"\n $stdout.flush\n readline.to_i\nend\n\ndef doit\n n = readline.to_i\n offset = 0\n a = []\n (FIB.size - 2).downto(0) do |i|\n lo = offset + FIB[i + 0]\n hi = offset + FIB[i + 1]\n a[lo] ||= (lo <= n) ? query(lo) : 0\n a[hi] ||= (hi <= n) ? query(hi) : 0\n offset = lo if a[lo] < a[hi]\n end\n puts \"! #{a[offset + 1]}\"\n $stdout.flush\nend\n\ndef main\n t = readline.to_i\n t.times { doit }\nend\n\nmain if __FILE__ == $0\n" }, { "id": 281, "name": "053", "Crystal": "class Manager\n getter memo = {} of Int32 => Int32\n\n delegate :[]=, to: @memo\n delegate has_key?, to: @memo\n\n def ask(x : Int32)\n if @memo.has_key?(x)\n @memo[x]\n else\n puts \"? #{x + 1}\"; STDOUT.flush\n res = read_line.to_i\n exit(1) if res == -1\n @memo[x] = res\n end\n end\n\n def answer(val : Int32)\n puts \"! #{val}\"; STDOUT.flush\n end\nend\n\nread_line.to_i.times do\n s = Manager.new\n n = read_line.to_i\n\n if n == 1\n s.answer(s.ask(0))\n next\n end\n\n fib = [1, 1]\n while fib[-1] <= n\n fib << fib[-1] + fib[-2]\n end\n m = fib[-1] - 1\n (n...m).each { |i| s[i] = -i }\n\n range = (0..m - 1)\n fib_i = fib.size - 3\n while range.size >= 3\n li = range.begin + (fib[fib_i] - 1)\n ri = range.end - (fib[fib_i] - 1)\n left, right = s.ask(li), s.ask(ri)\n range = if left >= right\n range.begin..ri - 1\n else\n li + 1..range.end\n end\n fib_i -= 1\n end\n s.answer [s.ask(range.begin), s.ask(range.end)].max\nend\n", "Ruby": "FIB = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]\n\ndef query(i)\n puts \"? #{i}\"\n $stdout.flush\n readline.to_i\nend\n\ndef doit\n n = readline.to_i\n offset = 0\n a = []\n (FIB.size - 2).downto(0) do |i|\n lo = offset + FIB[i + 0]\n hi = offset + FIB[i + 1]\n a[lo] ||= (lo <= n) ? query(lo) : 0\n a[hi] ||= (hi <= n) ? query(hi) : 0\n offset = lo if a[lo] < a[hi]\n end\n puts \"! #{a[offset + 1]}\"\n $stdout.flush\nend\n\ndef main\n t = readline.to_i\n t.times { doit }\nend\n\nmain if __FILE__ == $0\n" }, { "id": 282, "name": "054", "C++": "#include \n#include \n#include \nusing namespace std;\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector > G(N + M);\n\tfor (int i = 0; i < M; ++i) {\n\t\tint k, v;\n\t\tcin >> k;\n\t\tfor (int j = 0; j < k; ++j) {\n\t\t\tcin >> v; --v;\n\t\t\tG[v].push_back(N + i);\n\t\t\tG[N + i].push_back(v);\n\t\t}\n\t}\n\tqueue que;\n\tque.push(0);\n\tvector dist(N + M, -2);\n\tdist[0] = 0;\n\twhile (!que.empty()) {\n\t\tint u = que.front(); que.pop();\n\t\tfor (int i : G[u]) {\n\t\t\tif (dist[i] == -2) {\n\t\t\t\tdist[i] = dist[u] + 1;\n\t\t\t\tque.push(i);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << dist[i] / 2 << '\\n';\n\t}\n\treturn 0;\n}", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def bfs(start : Int32)\n queue = Deque{start}\n dist = Array(Int32?).new(size, nil)\n dist[start] = 0\n while v = queue.pop?\n graph[v].each do |edge|\n if dist[edge].nil?\n dist[edge] = dist[v].not_nil! + 1\n queue.unshift edge\n end\n end\n end\n dist\n end\nend\n\nn, m = read_line.split.map(&.to_i)\ng = UnweightedGraph.new(n + m)\nm.times do |i|\n read_line\n a = read_line.split.map(&.to_i.pred)\n a.each do |j|\n g.add_edge(j, n + i)\n end\nend\nputs g.bfs(0).first(n).join('\\n') { |x| x ? x // 2 : -1 }\n" }, { "id": 283, "name": "054", "C++": "#include \n#include \n#include \nusing namespace std;\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector > G(N + M);\n\tfor (int i = 0; i < M; ++i) {\n\t\tint k, v;\n\t\tcin >> k;\n\t\tfor (int j = 0; j < k; ++j) {\n\t\t\tcin >> v; --v;\n\t\t\tG[v].push_back(N + i);\n\t\t\tG[N + i].push_back(v);\n\t\t}\n\t}\n\tqueue que;\n\tque.push(0);\n\tvector dist(N + M, -2);\n\tdist[0] = 0;\n\twhile (!que.empty()) {\n\t\tint u = que.front(); que.pop();\n\t\tfor (int i : G[u]) {\n\t\t\tif (dist[i] == -2) {\n\t\t\t\tdist[i] = dist[u] + 1;\n\t\t\t\tque.push(i);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << dist[i] / 2 << '\\n';\n\t}\n\treturn 0;\n}", "Python": "from collections import deque\nn, m = map(int,input().split())\ng = [[] for _ in range(n + m)]\n\n# 論文の頂点をn+1, n+2, ... ,n + mとする \nfor i in range(m):\n K = int(input())\n for R in map(int,input().split()):\n g[n + i].append(R - 1)\n g[R - 1].append(n + i)\n\ndist = [-1] * (n + m)\ndist[0] = 0\nq = deque()\nq.append(0)\n\nwhile q:\n v = q.popleft()\n for i in g[v]:\n if dist[i] != -1: continue\n dist[i] = dist[v] + 1\n q.append(i)\n\nfor i in range(n):\n print(dist[i] // 2)" }, { "id": 284, "name": "054", "Crystal": "class UnweightedGraph\n getter graph : Array(Array(Int32))\n\n def initialize(size : Int)\n @graph = Array.new(size) { Array(Int32).new }\n end\n\n def add_edge(v, u)\n @graph[v] << u\n @graph[u] << v\n end\n\n delegate size, to: @graph\n delegate :[], to: @graph\n\n def bfs(start : Int32)\n queue = Deque{start}\n dist = Array(Int32?).new(size, nil)\n dist[start] = 0\n while v = queue.pop?\n graph[v].each do |edge|\n if dist[edge].nil?\n dist[edge] = dist[v].not_nil! + 1\n queue.unshift edge\n end\n end\n end\n dist\n end\nend\n\nn, m = read_line.split.map(&.to_i)\ng = UnweightedGraph.new(n + m)\nm.times do |i|\n read_line\n a = read_line.split.map(&.to_i.pred)\n a.each do |j|\n g.add_edge(j, n + i)\n end\nend\nputs g.bfs(0).first(n).join('\\n') { |x| x ? x // 2 : -1 }\n", "Python": "from collections import deque\nn, m = map(int,input().split())\ng = [[] for _ in range(n + m)]\n\n# 論文の頂点をn+1, n+2, ... ,n + mとする \nfor i in range(m):\n K = int(input())\n for R in map(int,input().split()):\n g[n + i].append(R - 1)\n g[R - 1].append(n + i)\n\ndist = [-1] * (n + m)\ndist[0] = 0\nq = deque()\nq.append(0)\n\nwhile q:\n v = q.popleft()\n for i in g[v]:\n if dist[i] != -1: continue\n dist[i] = dist[v] + 1\n q.append(i)\n\nfor i in range(n):\n print(dist[i] // 2)" }, { "id": 285, "name": "055", "C++": "#include \n#include \n\nusing namespace std;\n\nuint64_t calc(uint64_t P, uint64_t Q, uint64_t A[], uint64_t N, uint64_t remaining, uint64_t product_mod_P) {\n\tif (remaining == 0) {\n\t\treturn product_mod_P == Q ? 1 : 0;\n\t}\n\n\tuint64_t result = 0;\n\tfor (uint64_t i = remaining - 1; i < N; i++) {\n\t\tresult += calc(P, Q, A, i, remaining - 1, (product_mod_P * A[i]) % P);\n\t}\n\n\treturn result;\n}\n\nint main() {\n\tuint64_t N, P, Q;\n\tcin >> N >> P >> Q;\n\n\tuint64_t A[N];\n\tfor (uint64_t &a : A) {\n\t\tcin >> a;\n\t}\n\n\tcout << calc(P, Q, A, N, 5, 1) << endl;\n\n\treturn 0;\n}\n", "Crystal": "n, p, q = read_line.split.try { |(n, p, q)| {n.to_i, p.to_i64, q.to_i64} }\na = read_line.split.map(&.to_i64)\ncnt = 0\n(0...n).each do |i1|\n (0...i1).each do |i2|\n x2 = a[i1] * a[i2] % p\n (0...i2).each do |i3|\n x3 = x2 * a[i3] % p\n (0...i3).each do |i4|\n x4 = x3 * a[i4] % p\n (0...i4).each do |i5|\n cnt += 1 if x4 * a[i5] % p == q\n end\n end\n end\n end\nend\nputs cnt\n" }, { "id": 286, "name": "055", "C++": "#include \n#include \n\nusing namespace std;\n\nuint64_t calc(uint64_t P, uint64_t Q, uint64_t A[], uint64_t N, uint64_t remaining, uint64_t product_mod_P) {\n\tif (remaining == 0) {\n\t\treturn product_mod_P == Q ? 1 : 0;\n\t}\n\n\tuint64_t result = 0;\n\tfor (uint64_t i = remaining - 1; i < N; i++) {\n\t\tresult += calc(P, Q, A, i, remaining - 1, (product_mod_P * A[i]) % P);\n\t}\n\n\treturn result;\n}\n\nint main() {\n\tuint64_t N, P, Q;\n\tcin >> N >> P >> Q;\n\n\tuint64_t A[N];\n\tfor (uint64_t &a : A) {\n\t\tcin >> a;\n\t}\n\n\tcout << calc(P, Q, A, N, 5, 1) << endl;\n\n\treturn 0;\n}\n", "Python": "import itertools as t\nN,P,Q,*A=map(int,open(0).read().split())\nprint(sum(1for a,b,c,d,e in t.combinations(A,5)if a*b%P*c%P*d%P*e%P==Q))" }, { "id": 287, "name": "055", "C++": "#include \n#include \n\nusing namespace std;\n\nuint64_t calc(uint64_t P, uint64_t Q, uint64_t A[], uint64_t N, uint64_t remaining, uint64_t product_mod_P) {\n\tif (remaining == 0) {\n\t\treturn product_mod_P == Q ? 1 : 0;\n\t}\n\n\tuint64_t result = 0;\n\tfor (uint64_t i = remaining - 1; i < N; i++) {\n\t\tresult += calc(P, Q, A, i, remaining - 1, (product_mod_P * A[i]) % P);\n\t}\n\n\treturn result;\n}\n\nint main() {\n\tuint64_t N, P, Q;\n\tcin >> N >> P >> Q;\n\n\tuint64_t A[N];\n\tfor (uint64_t &a : A) {\n\t\tcin >> a;\n\t}\n\n\tcout << calc(P, Q, A, N, 5, 1) << endl;\n\n\treturn 0;\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar p: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tvar p1: int :: a[i] % p\n\t\tfor j(0, i - 1)\n\t\t\tvar p2: int :: p1 * a[j] % p\n\t\t\tfor k(0, j - 1)\n\t\t\t\tvar p3: int :: p2 * a[k] % p\n\t\t\t\tfor l(0, k - 1)\n\t\t\t\t\tvar p4: int :: p3 * a[l] % p\n\t\t\t\t\tfor m(0, l - 1)\n\t\t\t\t\t\tvar p5: int :: p4 * a[m] % p\n\t\t\t\t\t\tif(p5 = q)\n\t\t\t\t\t\t\tdo ans :+ 1\n\t\t\t\t\t\tend if\n\t\t\t\t\tend for\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 288, "name": "055", "Crystal": "n, p, q = read_line.split.try { |(n, p, q)| {n.to_i, p.to_i64, q.to_i64} }\na = read_line.split.map(&.to_i64)\ncnt = 0\n(0...n).each do |i1|\n (0...i1).each do |i2|\n x2 = a[i1] * a[i2] % p\n (0...i2).each do |i3|\n x3 = x2 * a[i3] % p\n (0...i3).each do |i4|\n x4 = x3 * a[i4] % p\n (0...i4).each do |i5|\n cnt += 1 if x4 * a[i5] % p == q\n end\n end\n end\n end\nend\nputs cnt\n", "Python": "import itertools as t\nN,P,Q,*A=map(int,open(0).read().split())\nprint(sum(1for a,b,c,d,e in t.combinations(A,5)if a*b%P*c%P*d%P*e%P==Q))" }, { "id": 289, "name": "055", "Crystal": "n, p, q = read_line.split.try { |(n, p, q)| {n.to_i, p.to_i64, q.to_i64} }\na = read_line.split.map(&.to_i64)\ncnt = 0\n(0...n).each do |i1|\n (0...i1).each do |i2|\n x2 = a[i1] * a[i2] % p\n (0...i2).each do |i3|\n x3 = x2 * a[i3] % p\n (0...i3).each do |i4|\n x4 = x3 * a[i4] % p\n (0...i4).each do |i5|\n cnt += 1 if x4 * a[i5] % p == q\n end\n end\n end\n end\nend\nputs cnt\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar p: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tvar p1: int :: a[i] % p\n\t\tfor j(0, i - 1)\n\t\t\tvar p2: int :: p1 * a[j] % p\n\t\t\tfor k(0, j - 1)\n\t\t\t\tvar p3: int :: p2 * a[k] % p\n\t\t\t\tfor l(0, k - 1)\n\t\t\t\t\tvar p4: int :: p3 * a[l] % p\n\t\t\t\t\tfor m(0, l - 1)\n\t\t\t\t\t\tvar p5: int :: p4 * a[m] % p\n\t\t\t\t\t\tif(p5 = q)\n\t\t\t\t\t\t\tdo ans :+ 1\n\t\t\t\t\t\tend if\n\t\t\t\t\tend for\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 290, "name": "055", "Python": "import itertools as t\nN,P,Q,*A=map(int,open(0).read().split())\nprint(sum(1for a,b,c,d,e in t.combinations(A,5)if a*b%P*c%P*d%P*e%P==Q))", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar p: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tvar p1: int :: a[i] % p\n\t\tfor j(0, i - 1)\n\t\t\tvar p2: int :: p1 * a[j] % p\n\t\t\tfor k(0, j - 1)\n\t\t\t\tvar p3: int :: p2 * a[k] % p\n\t\t\t\tfor l(0, k - 1)\n\t\t\t\t\tvar p4: int :: p3 * a[l] % p\n\t\t\t\t\tfor m(0, l - 1)\n\t\t\t\t\t\tvar p5: int :: p4 * a[m] % p\n\t\t\t\t\t\tif(p5 = q)\n\t\t\t\t\t\t\tdo ans :+ 1\n\t\t\t\t\t\tend if\n\t\t\t\t\tend for\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend for\n\t\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 291, "name": "056", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint N, S;\n\n\tcin >> N >> S;\n\n\tvector A(N), B(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t}\n\n\tvector > dp(N + 1, vector(S + 1, false));\n\n\tdp[0][0] = true;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tfor (int j = 0; j <= S; ++j) {\n\n\t\t\tif (j >= A[i] && dp[i][j - A[i]]) dp[i + 1][j] = true;\n\n\t\t\tif (j >= B[i] && dp[i][j - B[i]]) dp[i + 1][j] = true;\n\n\t\t}\n\n\t}\n\n\tif (!dp[N][S]) {\n\n\t\tcout << \"Impossible\" << endl;\n\n\t}\n\n\telse {\n\n\t\tstring res(N, '?');\n\n\t\tint pos = S;\n\n\t\tfor (int i = N - 1; i >= 0; --i) {\n\n\t\t\tif (pos >= B[i] && dp[i][pos - B[i]]) {\n\n\t\t\t\tres[i] = 'B';\n\n\t\t\t\tpos -= B[i];\n\n\t\t\t}\n\n\t\t\telse {\n\n\t\t\t\tres[i] = 'A';\n\n\t\t\t\tpos -= A[i];\n\n\t\t\t}\n\n\t\t}\n\n\t\tcout << res << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n, s = read_line.split.map(&.to_i)\nab = Array.new(n) { {Int32, Int32}.from read_line.split.map(&.to_i) }\nprev = Array.new(n + 1) { Array(Int32?).new(s + 1, nil) }\n\nab.each_with_index do |(a, b), i|\n (0..s).each do |j|\n prev[i + 1][j + a] = 0 if (prev[i][j] || i == j == 0) && j + a <= s\n prev[i + 1][j + b] = 1 if (prev[i][j] || i == j == 0) && j + b <= s\n end\nend\n\nans = String::Builder.new\ni, j = n, s\nwhile k = prev[i][j]\n ans << 'A' + k\n i -= 1\n j -= ab[i][k]\nend\nputs i == 0 ? ans.to_s.reverse : \"Impossible\"\n" }, { "id": 292, "name": "056", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint N, S;\n\n\tcin >> N >> S;\n\n\tvector A(N), B(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t}\n\n\tvector > dp(N + 1, vector(S + 1, false));\n\n\tdp[0][0] = true;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tfor (int j = 0; j <= S; ++j) {\n\n\t\t\tif (j >= A[i] && dp[i][j - A[i]]) dp[i + 1][j] = true;\n\n\t\t\tif (j >= B[i] && dp[i][j - B[i]]) dp[i + 1][j] = true;\n\n\t\t}\n\n\t}\n\n\tif (!dp[N][S]) {\n\n\t\tcout << \"Impossible\" << endl;\n\n\t}\n\n\telse {\n\n\t\tstring res(N, '?');\n\n\t\tint pos = S;\n\n\t\tfor (int i = N - 1; i >= 0; --i) {\n\n\t\t\tif (pos >= B[i] && dp[i][pos - B[i]]) {\n\n\t\t\t\tres[i] = 'B';\n\n\t\t\t\tpos -= B[i];\n\n\t\t\t}\n\n\t\t\telse {\n\n\t\t\t\tres[i] = 'A';\n\n\t\t\t\tpos -= A[i];\n\n\t\t\t}\n\n\t\t}\n\n\t\tcout << res << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Python": "import sys\nsys.setrecursionlimit(10**7)\n\ndef input(): return sys.stdin.readline().strip()\ndef INTS(): return [ int(s) for s in input().split(\" \")]\ndef log(*args, **kwargs): print(\"DEBUG:\", *args, **kwargs, file=sys.stderr)\n\ndef main():\n n, s = INTS()\n\n A = []\n B = []\n\n for i in range(n):\n a,b = INTS()\n A.append(a)\n B.append(b)\n \n # dp[i][j] = i日目までを考慮して、合計をj円にする方法があるか？\n dp = [[False] * (s+1) for _ in range(n+1)]\n # 0日目0円は自明にOK\n dp[0][0] = True\n\n for i in range(1, n+1):\n for j in range(s + 1):\n # 1日前に 「j - (この商品の値段) 円」 が可能なら可能\n if A[i-1] <= j and dp[i-1][j - A[i-1]]:\n dp[i][j] = True\n if B[i-1] <= j and dp[i-1][j - B[i-1]]:\n dp[i][j] = True\n\n if dp[n][s] == False:\n # n日目にs円にする方法がない\n print(\"Impossible\")\n return\n\n # 最終日の状態からさかのぼって、どの商品を選べばよいかを調べる\n x = n\n y = s\n ans = []\n while x > 0:\n if y >= A[x-1] and dp[x-1][y-A[x-1]]:\n ans.append(\"A\")\n y -= A[x-1]\n elif y >= B[x-1] and dp[x-1][y-B[x-1]]:\n ans.append(\"B\")\n y -= B[x-1]\n x -= 1\n\n print(\"\".join(list(reversed(ans))))\n\nmain()\n" }, { "id": 293, "name": "056", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint N, S;\n\n\tcin >> N >> S;\n\n\tvector A(N), B(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t}\n\n\tvector > dp(N + 1, vector(S + 1, false));\n\n\tdp[0][0] = true;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tfor (int j = 0; j <= S; ++j) {\n\n\t\t\tif (j >= A[i] && dp[i][j - A[i]]) dp[i + 1][j] = true;\n\n\t\t\tif (j >= B[i] && dp[i][j - B[i]]) dp[i + 1][j] = true;\n\n\t\t}\n\n\t}\n\n\tif (!dp[N][S]) {\n\n\t\tcout << \"Impossible\" << endl;\n\n\t}\n\n\telse {\n\n\t\tstring res(N, '?');\n\n\t\tint pos = S;\n\n\t\tfor (int i = N - 1; i >= 0; --i) {\n\n\t\t\tif (pos >= B[i] && dp[i][pos - B[i]]) {\n\n\t\t\t\tres[i] = 'B';\n\n\t\t\t\tpos -= B[i];\n\n\t\t\t}\n\n\t\t\telse {\n\n\t\t\t\tres[i] = 'A';\n\n\t\t\t\tpos -= A[i];\n\n\t\t\t}\n\n\t\t}\n\n\t\tcout << res << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar s: int :: cui@inputInt()\n\tvar ab: [][]int :: #[n + 1, 2]int\n\tfor i(1, n)\n\t\tfor iab(0, 1)\n\t\t\tdo ab[i][iab] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\t; dp[i][j] = i日目まででｊ円分購入\n\tvar dp: [][]bool :: #[n + 1, s + 1]bool\n\tdo dp[0][0] :: true\n\tfor i(1, n)\n\t\tfor j(s, 0, -1)\n\t\t\tfor iab(0, 1)\n\t\t\t\tvar prev: int :: j - ab[i][iab]\n\t\t\t\tif(prev >= 0 & dp[i - 1][prev])\n\t\t\t\t\tdo dp[i][j] :: true\n\t\t\t\tend if\n\t\t\tend for\n\t\tend for\n\tend for\n\tif(!dp[n][s])\n\t\tdo cui@print(\"Impossible\\n\")\n\t\tret\n\tend if\n\tvar ans: []char :: #[n]char\n\tvar val: int :: s\n\tfor i(n, 1, -1)\n\t\tfor iab(0, 1)\n\t\t\tvar next: int :: val - ab[i][iab]\n\t\t\tif(next >= 0 & dp[i - 1][next])\n\t\t\t\tdo val :: next\n\t\t\t\tdo ans[i - 1] :: iab = 0 ?('A', 'B')\n\t\t\t\tbreak iab\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 294, "name": "056", "Crystal": "n, s = read_line.split.map(&.to_i)\nab = Array.new(n) { {Int32, Int32}.from read_line.split.map(&.to_i) }\nprev = Array.new(n + 1) { Array(Int32?).new(s + 1, nil) }\n\nab.each_with_index do |(a, b), i|\n (0..s).each do |j|\n prev[i + 1][j + a] = 0 if (prev[i][j] || i == j == 0) && j + a <= s\n prev[i + 1][j + b] = 1 if (prev[i][j] || i == j == 0) && j + b <= s\n end\nend\n\nans = String::Builder.new\ni, j = n, s\nwhile k = prev[i][j]\n ans << 'A' + k\n i -= 1\n j -= ab[i][k]\nend\nputs i == 0 ? ans.to_s.reverse : \"Impossible\"\n", "Python": "import sys\nsys.setrecursionlimit(10**7)\n\ndef input(): return sys.stdin.readline().strip()\ndef INTS(): return [ int(s) for s in input().split(\" \")]\ndef log(*args, **kwargs): print(\"DEBUG:\", *args, **kwargs, file=sys.stderr)\n\ndef main():\n n, s = INTS()\n\n A = []\n B = []\n\n for i in range(n):\n a,b = INTS()\n A.append(a)\n B.append(b)\n \n # dp[i][j] = i日目までを考慮して、合計をj円にする方法があるか？\n dp = [[False] * (s+1) for _ in range(n+1)]\n # 0日目0円は自明にOK\n dp[0][0] = True\n\n for i in range(1, n+1):\n for j in range(s + 1):\n # 1日前に 「j - (この商品の値段) 円」 が可能なら可能\n if A[i-1] <= j and dp[i-1][j - A[i-1]]:\n dp[i][j] = True\n if B[i-1] <= j and dp[i-1][j - B[i-1]]:\n dp[i][j] = True\n\n if dp[n][s] == False:\n # n日目にs円にする方法がない\n print(\"Impossible\")\n return\n\n # 最終日の状態からさかのぼって、どの商品を選べばよいかを調べる\n x = n\n y = s\n ans = []\n while x > 0:\n if y >= A[x-1] and dp[x-1][y-A[x-1]]:\n ans.append(\"A\")\n y -= A[x-1]\n elif y >= B[x-1] and dp[x-1][y-B[x-1]]:\n ans.append(\"B\")\n y -= B[x-1]\n x -= 1\n\n print(\"\".join(list(reversed(ans))))\n\nmain()\n" }, { "id": 295, "name": "056", "Crystal": "n, s = read_line.split.map(&.to_i)\nab = Array.new(n) { {Int32, Int32}.from read_line.split.map(&.to_i) }\nprev = Array.new(n + 1) { Array(Int32?).new(s + 1, nil) }\n\nab.each_with_index do |(a, b), i|\n (0..s).each do |j|\n prev[i + 1][j + a] = 0 if (prev[i][j] || i == j == 0) && j + a <= s\n prev[i + 1][j + b] = 1 if (prev[i][j] || i == j == 0) && j + b <= s\n end\nend\n\nans = String::Builder.new\ni, j = n, s\nwhile k = prev[i][j]\n ans << 'A' + k\n i -= 1\n j -= ab[i][k]\nend\nputs i == 0 ? ans.to_s.reverse : \"Impossible\"\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar s: int :: cui@inputInt()\n\tvar ab: [][]int :: #[n + 1, 2]int\n\tfor i(1, n)\n\t\tfor iab(0, 1)\n\t\t\tdo ab[i][iab] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\t; dp[i][j] = i日目まででｊ円分購入\n\tvar dp: [][]bool :: #[n + 1, s + 1]bool\n\tdo dp[0][0] :: true\n\tfor i(1, n)\n\t\tfor j(s, 0, -1)\n\t\t\tfor iab(0, 1)\n\t\t\t\tvar prev: int :: j - ab[i][iab]\n\t\t\t\tif(prev >= 0 & dp[i - 1][prev])\n\t\t\t\t\tdo dp[i][j] :: true\n\t\t\t\tend if\n\t\t\tend for\n\t\tend for\n\tend for\n\tif(!dp[n][s])\n\t\tdo cui@print(\"Impossible\\n\")\n\t\tret\n\tend if\n\tvar ans: []char :: #[n]char\n\tvar val: int :: s\n\tfor i(n, 1, -1)\n\t\tfor iab(0, 1)\n\t\t\tvar next: int :: val - ab[i][iab]\n\t\t\tif(next >= 0 & dp[i - 1][next])\n\t\t\t\tdo val :: next\n\t\t\t\tdo ans[i - 1] :: iab = 0 ?('A', 'B')\n\t\t\t\tbreak iab\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 296, "name": "056", "Python": "import sys\nsys.setrecursionlimit(10**7)\n\ndef input(): return sys.stdin.readline().strip()\ndef INTS(): return [ int(s) for s in input().split(\" \")]\ndef log(*args, **kwargs): print(\"DEBUG:\", *args, **kwargs, file=sys.stderr)\n\ndef main():\n n, s = INTS()\n\n A = []\n B = []\n\n for i in range(n):\n a,b = INTS()\n A.append(a)\n B.append(b)\n \n # dp[i][j] = i日目までを考慮して、合計をj円にする方法があるか？\n dp = [[False] * (s+1) for _ in range(n+1)]\n # 0日目0円は自明にOK\n dp[0][0] = True\n\n for i in range(1, n+1):\n for j in range(s + 1):\n # 1日前に 「j - (この商品の値段) 円」 が可能なら可能\n if A[i-1] <= j and dp[i-1][j - A[i-1]]:\n dp[i][j] = True\n if B[i-1] <= j and dp[i-1][j - B[i-1]]:\n dp[i][j] = True\n\n if dp[n][s] == False:\n # n日目にs円にする方法がない\n print(\"Impossible\")\n return\n\n # 最終日の状態からさかのぼって、どの商品を選べばよいかを調べる\n x = n\n y = s\n ans = []\n while x > 0:\n if y >= A[x-1] and dp[x-1][y-A[x-1]]:\n ans.append(\"A\")\n y -= A[x-1]\n elif y >= B[x-1] and dp[x-1][y-B[x-1]]:\n ans.append(\"B\")\n y -= B[x-1]\n x -= 1\n\n print(\"\".join(list(reversed(ans))))\n\nmain()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar s: int :: cui@inputInt()\n\tvar ab: [][]int :: #[n + 1, 2]int\n\tfor i(1, n)\n\t\tfor iab(0, 1)\n\t\t\tdo ab[i][iab] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\t; dp[i][j] = i日目まででｊ円分購入\n\tvar dp: [][]bool :: #[n + 1, s + 1]bool\n\tdo dp[0][0] :: true\n\tfor i(1, n)\n\t\tfor j(s, 0, -1)\n\t\t\tfor iab(0, 1)\n\t\t\t\tvar prev: int :: j - ab[i][iab]\n\t\t\t\tif(prev >= 0 & dp[i - 1][prev])\n\t\t\t\t\tdo dp[i][j] :: true\n\t\t\t\tend if\n\t\t\tend for\n\t\tend for\n\tend for\n\tif(!dp[n][s])\n\t\tdo cui@print(\"Impossible\\n\")\n\t\tret\n\tend if\n\tvar ans: []char :: #[n]char\n\tvar val: int :: s\n\tfor i(n, 1, -1)\n\t\tfor iab(0, 1)\n\t\t\tvar next: int :: val - ab[i][iab]\n\t\t\tif(next >= 0 & dp[i - 1][next])\n\t\t\t\tdo val :: next\n\t\t\t\tdo ans[i - 1] :: iab = 0 ?('A', 'B')\n\t\t\t\tbreak iab\n\t\t\tend if\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 297, "name": "057", "Crystal": "require \"big\"\nn, m = read_line.split.map(&.to_i)\na = (1..n).map {\n read_line\n b = read_line.split.map(&.to_i.pred)\n b.reduce(BigInt.zero) { |acc, i| acc | BigInt.new(1) << i }\n}\ns = read_line.delete(' ').reverse.to_big_i(2)\n\nbasis = [] of BigInt\na.each do |e|\n basis.each { |b| e = {e, e ^ b}.min }\n basis << e unless e.zero?\nend\nbasis.sort.reverse_each do |b|\n i = (0...m).reverse_each.find { |i| b.bit(i) == 1 }.not_nil!\n s ^= b if s.bit(i) == 1\nend\nputs s.zero? ? (n - basis.size).times.reduce(1i64) { |acc, _| acc * 2 % 998244353 } : 0\n", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, M;\n\n\tcin >> N >> M;\n\n\tvector > D(N, vector(M, 0));\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint t, x;\n\n\t\tcin >> t;\n\n\t\tfor (int j = 0; j < t; ++j) {\n\n\t\t\tcin >> x;\n\n\t\t\tD[i][--x] = 1;\n\n\t\t}\n\n\t}\n\n\tvector S(M);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tcin >> S[i];\n\n\t}\n\n\tint pos = 0;\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tbool found = false;\n\n\t\tfor (int j = pos; j < N; ++j) {\n\n\t\t\tif (D[j][i] == 1) {\n\n\t\t\t\tif (j != pos) {\n\n\t\t\t\t\tswap(D[j], D[pos]);\n\n\t\t\t\t}\n\n\t\t\t\tfound = true;\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (found) {\n\n\t\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\t\tif (j != pos && D[j][i] == 1) {\n\n\t\t\t\t\tfor (int k = i; k < M; ++k) {\n\n\t\t\t\t\t\tD[j][k] ^= D[pos][k];\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif (S[i] == 1) {\n\n\t\t\t\tfor (int j = i; j < M; ++j) {\n\n\t\t\t\t\tS[j] ^= D[pos][j];\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t++pos;\n\n\t\t}\n\n\t}\n\n\tif (S == vector(M, 0)) {\n\n\t\tint ans = 1;\n\n\t\tfor (int i = pos; i < N; ++i) {\n\n\t\t\tans = ans * 2 % 998244353;\n\n\t\t}\n\n\t\tcout << ans << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << 0 << endl;\n\n\t}\n\n\treturn 0;\n\n}" }, { "id": 298, "name": "057", "Crystal": "require \"big\"\nn, m = read_line.split.map(&.to_i)\na = (1..n).map {\n read_line\n b = read_line.split.map(&.to_i.pred)\n b.reduce(BigInt.zero) { |acc, i| acc | BigInt.new(1) << i }\n}\ns = read_line.delete(' ').reverse.to_big_i(2)\n\nbasis = [] of BigInt\na.each do |e|\n basis.each { |b| e = {e, e ^ b}.min }\n basis << e unless e.zero?\nend\nbasis.sort.reverse_each do |b|\n i = (0...m).reverse_each.find { |i| b.bit(i) == 1 }.not_nil!\n s ^= b if s.bit(i) == 1\nend\nputs s.zero? ? (n - basis.size).times.reduce(1i64) { |acc, _| acc * 2 % 998244353 } : 0\n", "Python": "import sys\nfrom collections import defaultdict, Counter, deque\nfrom itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate\nimport operator\nfrom math import sqrt, gcd, factorial\n# from math import isqrt, prod,comb # python3.8用(notpypy)\n#from bisect import bisect_left,bisect_right\n#from functools import lru_cache,reduce\n#from heapq import heappush,heappop,heapify,heappushpop,heapreplace\nimport numpy as np\n#import networkx as nx\n#from networkx.utils import UnionFind\n#from numba import njit, b1, i1, i4, i8, f8\n#from scipy.sparse import csr_matrix\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError\n# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1\ndef input(): return sys.stdin.readline().rstrip()\ndef divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\n\ndef hakidashi2(A):\n x,y=A.shape\n ans = []\n for i in range(y):\n if A[:,i].max() != 0:\n A=A[np.argsort(A[:,i])[::-1]]\n ans.append(np.copy(A[0]))\n #print(A)\n A[np.where(A[:,i]>0)[0]]^=A[0]\n return np.stack(ans)\n\ndef hakidashi_hantei2(ans, K):\n for aa in ans:\n if K[np.where(aa==1)[0][0]]!=0:\n K ^= aa\n return np.all(K == np.zeros_like(K))\n\n\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n m,n=map(int, input().split())\n panels=np.zeros((m,n),dtype=np.int64)\n for i in range(m):\n t=int(input())\n A=list(map(int, input().split()))\n for AA in A:\n panels[i][AA-1]+=1\n\n ans=hakidashi2(panels)\n S=np.array(list(map(int, input().split())),dtype=np.int64)\n if hakidashi_hantei2(ans,S):\n print(pow(2,len(panels)-len(ans),mod2))\n else:\n print(0)\n\n\nif __name__ == '__main__':\n main()\n\n" }, { "id": 299, "name": "057", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, M;\n\n\tcin >> N >> M;\n\n\tvector > D(N, vector(M, 0));\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint t, x;\n\n\t\tcin >> t;\n\n\t\tfor (int j = 0; j < t; ++j) {\n\n\t\t\tcin >> x;\n\n\t\t\tD[i][--x] = 1;\n\n\t\t}\n\n\t}\n\n\tvector S(M);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tcin >> S[i];\n\n\t}\n\n\tint pos = 0;\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tbool found = false;\n\n\t\tfor (int j = pos; j < N; ++j) {\n\n\t\t\tif (D[j][i] == 1) {\n\n\t\t\t\tif (j != pos) {\n\n\t\t\t\t\tswap(D[j], D[pos]);\n\n\t\t\t\t}\n\n\t\t\t\tfound = true;\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (found) {\n\n\t\t\tfor (int j = 0; j < N; ++j) {\n\n\t\t\t\tif (j != pos && D[j][i] == 1) {\n\n\t\t\t\t\tfor (int k = i; k < M; ++k) {\n\n\t\t\t\t\t\tD[j][k] ^= D[pos][k];\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif (S[i] == 1) {\n\n\t\t\t\tfor (int j = i; j < M; ++j) {\n\n\t\t\t\t\tS[j] ^= D[pos][j];\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t++pos;\n\n\t\t}\n\n\t}\n\n\tif (S == vector(M, 0)) {\n\n\t\tint ans = 1;\n\n\t\tfor (int i = pos; i < N; ++i) {\n\n\t\t\tans = ans * 2 % 998244353;\n\n\t\t}\n\n\t\tcout << ans << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << 0 << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Python": "import sys\nfrom collections import defaultdict, Counter, deque\nfrom itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate\nimport operator\nfrom math import sqrt, gcd, factorial\n# from math import isqrt, prod,comb # python3.8用(notpypy)\n#from bisect import bisect_left,bisect_right\n#from functools import lru_cache,reduce\n#from heapq import heappush,heappop,heapify,heappushpop,heapreplace\nimport numpy as np\n#import networkx as nx\n#from networkx.utils import UnionFind\n#from numba import njit, b1, i1, i4, i8, f8\n#from scipy.sparse import csr_matrix\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError\n# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1\ndef input(): return sys.stdin.readline().rstrip()\ndef divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\n\ndef hakidashi2(A):\n x,y=A.shape\n ans = []\n for i in range(y):\n if A[:,i].max() != 0:\n A=A[np.argsort(A[:,i])[::-1]]\n ans.append(np.copy(A[0]))\n #print(A)\n A[np.where(A[:,i]>0)[0]]^=A[0]\n return np.stack(ans)\n\ndef hakidashi_hantei2(ans, K):\n for aa in ans:\n if K[np.where(aa==1)[0][0]]!=0:\n K ^= aa\n return np.all(K == np.zeros_like(K))\n\n\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n m,n=map(int, input().split())\n panels=np.zeros((m,n),dtype=np.int64)\n for i in range(m):\n t=int(input())\n A=list(map(int, input().split()))\n for AA in A:\n panels[i][AA-1]+=1\n\n ans=hakidashi2(panels)\n S=np.array(list(map(int, input().split())),dtype=np.int64)\n if hakidashi_hantei2(ans,S):\n print(pow(2,len(panels)-len(ans),mod2))\n else:\n print(0)\n\n\nif __name__ == '__main__':\n main()\n\n" }, { "id": 300, "name": "058", "Crystal": "MOD = 10**5\nn, k = read_line.split.try { |(n, k)| {n.to_i, k.to_i64} }\n\nnext_num = (0...MOD).map do |x|\n # 0.36.0 からは (x + x.digits.sum) % MOD とかける\n (x + x.to_s.chars.sum(&.to_i)) % MOD\nend\n\ntime = Array(Int32?).new(MOD, nil)\ncnt = 0\nwhile time[n].nil?\n time[n] = cnt\n n = next_num[n]\n cnt += 1\nend\n\nto_cycle = time[n].not_nil!\ncycle = cnt - to_cycle\nk = (k - to_cycle) % cycle + to_cycle if k >= to_cycle\nputs time.index(k)\n", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint digit_sum(int x) {\n\n\tint ans = 0;\n\n\twhile (x > 0) {\n\n\t\tans += x % 10;\n\n\t\tx /= 10;\n\n\t}\n\n\treturn ans;\n\n}\n\nint main() {\n\n\tconst int mod = 100000;\n\n\tint N; long long K;\n\n\tcin >> N >> K;\n\n\tvector nxt(mod);\n\n\tfor (int i = 0; i < mod; ++i) {\n\n\t\tnxt[i] = (i + digit_sum(i)) % mod;\n\n\t}\n\n\tvector time_stamp(mod, -1);\n\n\tint pos = N, cnt = 0;\n\n\twhile (time_stamp[pos] == -1) {\n\n\t\ttime_stamp[pos] = cnt;\n\n\t\tpos = nxt[pos];\n\n\t\t++cnt;\n\n\t}\n\n\tint cycle = cnt - time_stamp[pos];\n\n\tif (K >= time_stamp[pos]) {\n\n\t\tK = (K - time_stamp[pos]) % cycle + time_stamp[pos];\n\n\t}\n\n\tint answer = -1;\n\n\tfor (int i = 0; i < mod; ++i) {\n\n\t\tif (time_stamp[i] == K) {\n\n\t\t\tanswer = i;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}" }, { "id": 301, "name": "058", "Crystal": "MOD = 10**5\nn, k = read_line.split.try { |(n, k)| {n.to_i, k.to_i64} }\n\nnext_num = (0...MOD).map do |x|\n # 0.36.0 からは (x + x.digits.sum) % MOD とかける\n (x + x.to_s.chars.sum(&.to_i)) % MOD\nend\n\ntime = Array(Int32?).new(MOD, nil)\ncnt = 0\nwhile time[n].nil?\n time[n] = cnt\n n = next_num[n]\n cnt += 1\nend\n\nto_cycle = time[n].not_nil!\ncycle = cnt - to_cycle\nk = (k - to_cycle) % cycle + to_cycle if k >= to_cycle\nputs time.index(k)\n", "Python": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef INTS(): return [ int(s) for s in input().split(\" \")]\ndef log(*args, **kwargs): print(\"DEBUG:\", *args, **kwargs, file=sys.stderr)\n\nclass Doubling():\n def __init__(self, n, k_max, f) -> None:\n \"\"\"要素数nのダブリングテーブルを作成します。\"\"\"\n\n k_bits = k_max.bit_length()\n\n # dub[i][j] = 値jを2**i回操作した結果\n dub = [[0] * n for _ in range(k_bits)]\n\n # 1回(2**0回)操作した結果を作成\n for j in range(n):\n dub[0][j] = f(j)\n\n # 2**i回操作した結果を順に作成\n # 2**(i-1)回操作を2回すれば2**i回操作したことになる\n for i in range(1, k_bits):\n for j in range(n):\n dub[i][j] = dub[i - 1][dub[i - 1][j]]\n\n self.doubling_table = dub\n\n def get(self, x, k):\n \"\"\"xをk回操作した値を取得します。\"\"\"\n # kをビットごとに分解して、2**a + 2**b + 2**c + ... の形で考える。\n # xを2**a回操作した結果を2**b回操作した結果を2**c回操作… のように順に適用する\n now = x\n for i in range(k.bit_length()):\n if k>>i & 1:\n now = self.doubling_table[i][now]\n\n return now\n\ndef f(n):\n \"\"\"(n + nの桁ごとの和) mod 10万 を返します。\"\"\"\n s = 0\n x = n\n while x > 0:\n s += x % 10\n x //= 10\n\n return (n+s) % 100000\n\ndef main():\n n, k = INTS()\n dub = Doubling(100000, k, f)\n print(dub.get(n,k))\nmain()\n" }, { "id": 302, "name": "058", "Crystal": "MOD = 10**5\nn, k = read_line.split.try { |(n, k)| {n.to_i, k.to_i64} }\n\nnext_num = (0...MOD).map do |x|\n # 0.36.0 からは (x + x.digits.sum) % MOD とかける\n (x + x.to_s.chars.sum(&.to_i)) % MOD\nend\n\ntime = Array(Int32?).new(MOD, nil)\ncnt = 0\nwhile time[n].nil?\n time[n] = cnt\n n = next_num[n]\n cnt += 1\nend\n\nto_cycle = time[n].not_nil!\ncycle = cnt - to_cycle\nk = (k - to_cycle) % cycle + to_cycle if k >= to_cycle\nputs time.index(k)\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar map: dict :: #dict\n\tfor i(1, k)\n\t\tdo n :: f(n)\n\t\tvar prev: int :: map.get(n, &)\n\t\tif(prev <> 0)\n\t\t\tvar len: int :: i - prev\n\t\t\tdo k :- prev\n\t\t\tdo k :% len\n\t\t\tfor j(1, k)\n\t\t\t\tdo n :: f(n)\n\t\t\tend for\n\t\t\tbreak i\n\t\tend if\n\t\tdo map.add(n, i)\n\tend for\n\t\n\tvar ans: int :: n\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(n: int): int\n\t\tvar res: int :: n\n\t\twhile(n <> 0)\n\t\t\tdo res :+ n % 10\n\t\t\tdo n :/ 10\n\t\tend while\n\t\tret res % 10 ^ 5\n\tend func\nend func\n" }, { "id": 303, "name": "058", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint digit_sum(int x) {\n\n\tint ans = 0;\n\n\twhile (x > 0) {\n\n\t\tans += x % 10;\n\n\t\tx /= 10;\n\n\t}\n\n\treturn ans;\n\n}\n\nint main() {\n\n\tconst int mod = 100000;\n\n\tint N; long long K;\n\n\tcin >> N >> K;\n\n\tvector nxt(mod);\n\n\tfor (int i = 0; i < mod; ++i) {\n\n\t\tnxt[i] = (i + digit_sum(i)) % mod;\n\n\t}\n\n\tvector time_stamp(mod, -1);\n\n\tint pos = N, cnt = 0;\n\n\twhile (time_stamp[pos] == -1) {\n\n\t\ttime_stamp[pos] = cnt;\n\n\t\tpos = nxt[pos];\n\n\t\t++cnt;\n\n\t}\n\n\tint cycle = cnt - time_stamp[pos];\n\n\tif (K >= time_stamp[pos]) {\n\n\t\tK = (K - time_stamp[pos]) % cycle + time_stamp[pos];\n\n\t}\n\n\tint answer = -1;\n\n\tfor (int i = 0; i < mod; ++i) {\n\n\t\tif (time_stamp[i] == K) {\n\n\t\t\tanswer = i;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Python": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef INTS(): return [ int(s) for s in input().split(\" \")]\ndef log(*args, **kwargs): print(\"DEBUG:\", *args, **kwargs, file=sys.stderr)\n\nclass Doubling():\n def __init__(self, n, k_max, f) -> None:\n \"\"\"要素数nのダブリングテーブルを作成します。\"\"\"\n\n k_bits = k_max.bit_length()\n\n # dub[i][j] = 値jを2**i回操作した結果\n dub = [[0] * n for _ in range(k_bits)]\n\n # 1回(2**0回)操作した結果を作成\n for j in range(n):\n dub[0][j] = f(j)\n\n # 2**i回操作した結果を順に作成\n # 2**(i-1)回操作を2回すれば2**i回操作したことになる\n for i in range(1, k_bits):\n for j in range(n):\n dub[i][j] = dub[i - 1][dub[i - 1][j]]\n\n self.doubling_table = dub\n\n def get(self, x, k):\n \"\"\"xをk回操作した値を取得します。\"\"\"\n # kをビットごとに分解して、2**a + 2**b + 2**c + ... の形で考える。\n # xを2**a回操作した結果を2**b回操作した結果を2**c回操作… のように順に適用する\n now = x\n for i in range(k.bit_length()):\n if k>>i & 1:\n now = self.doubling_table[i][now]\n\n return now\n\ndef f(n):\n \"\"\"(n + nの桁ごとの和) mod 10万 を返します。\"\"\"\n s = 0\n x = n\n while x > 0:\n s += x % 10\n x //= 10\n\n return (n+s) % 100000\n\ndef main():\n n, k = INTS()\n dub = Doubling(100000, k, f)\n print(dub.get(n,k))\nmain()\n" }, { "id": 304, "name": "058", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint digit_sum(int x) {\n\n\tint ans = 0;\n\n\twhile (x > 0) {\n\n\t\tans += x % 10;\n\n\t\tx /= 10;\n\n\t}\n\n\treturn ans;\n\n}\n\nint main() {\n\n\tconst int mod = 100000;\n\n\tint N; long long K;\n\n\tcin >> N >> K;\n\n\tvector nxt(mod);\n\n\tfor (int i = 0; i < mod; ++i) {\n\n\t\tnxt[i] = (i + digit_sum(i)) % mod;\n\n\t}\n\n\tvector time_stamp(mod, -1);\n\n\tint pos = N, cnt = 0;\n\n\twhile (time_stamp[pos] == -1) {\n\n\t\ttime_stamp[pos] = cnt;\n\n\t\tpos = nxt[pos];\n\n\t\t++cnt;\n\n\t}\n\n\tint cycle = cnt - time_stamp[pos];\n\n\tif (K >= time_stamp[pos]) {\n\n\t\tK = (K - time_stamp[pos]) % cycle + time_stamp[pos];\n\n\t}\n\n\tint answer = -1;\n\n\tfor (int i = 0; i < mod; ++i) {\n\n\t\tif (time_stamp[i] == K) {\n\n\t\t\tanswer = i;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar map: dict :: #dict\n\tfor i(1, k)\n\t\tdo n :: f(n)\n\t\tvar prev: int :: map.get(n, &)\n\t\tif(prev <> 0)\n\t\t\tvar len: int :: i - prev\n\t\t\tdo k :- prev\n\t\t\tdo k :% len\n\t\t\tfor j(1, k)\n\t\t\t\tdo n :: f(n)\n\t\t\tend for\n\t\t\tbreak i\n\t\tend if\n\t\tdo map.add(n, i)\n\tend for\n\t\n\tvar ans: int :: n\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(n: int): int\n\t\tvar res: int :: n\n\t\twhile(n <> 0)\n\t\t\tdo res :+ n % 10\n\t\t\tdo n :/ 10\n\t\tend while\n\t\tret res % 10 ^ 5\n\tend func\nend func\n" }, { "id": 305, "name": "058", "Python": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef INTS(): return [ int(s) for s in input().split(\" \")]\ndef log(*args, **kwargs): print(\"DEBUG:\", *args, **kwargs, file=sys.stderr)\n\nclass Doubling():\n def __init__(self, n, k_max, f) -> None:\n \"\"\"要素数nのダブリングテーブルを作成します。\"\"\"\n\n k_bits = k_max.bit_length()\n\n # dub[i][j] = 値jを2**i回操作した結果\n dub = [[0] * n for _ in range(k_bits)]\n\n # 1回(2**0回)操作した結果を作成\n for j in range(n):\n dub[0][j] = f(j)\n\n # 2**i回操作した結果を順に作成\n # 2**(i-1)回操作を2回すれば2**i回操作したことになる\n for i in range(1, k_bits):\n for j in range(n):\n dub[i][j] = dub[i - 1][dub[i - 1][j]]\n\n self.doubling_table = dub\n\n def get(self, x, k):\n \"\"\"xをk回操作した値を取得します。\"\"\"\n # kをビットごとに分解して、2**a + 2**b + 2**c + ... の形で考える。\n # xを2**a回操作した結果を2**b回操作した結果を2**c回操作… のように順に適用する\n now = x\n for i in range(k.bit_length()):\n if k>>i & 1:\n now = self.doubling_table[i][now]\n\n return now\n\ndef f(n):\n \"\"\"(n + nの桁ごとの和) mod 10万 を返します。\"\"\"\n s = 0\n x = n\n while x > 0:\n s += x % 10\n x //= 10\n\n return (n+s) % 100000\n\ndef main():\n n, k = INTS()\n dub = Doubling(100000, k, f)\n print(dub.get(n,k))\nmain()\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tvar map: dict :: #dict\n\tfor i(1, k)\n\t\tdo n :: f(n)\n\t\tvar prev: int :: map.get(n, &)\n\t\tif(prev <> 0)\n\t\t\tvar len: int :: i - prev\n\t\t\tdo k :- prev\n\t\t\tdo k :% len\n\t\t\tfor j(1, k)\n\t\t\t\tdo n :: f(n)\n\t\t\tend for\n\t\t\tbreak i\n\t\tend if\n\t\tdo map.add(n, i)\n\tend for\n\t\n\tvar ans: int :: n\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(n: int): int\n\t\tvar res: int :: n\n\t\twhile(n <> 0)\n\t\t\tdo res :+ n % 10\n\t\t\tdo n :/ 10\n\t\tend while\n\t\tret res % 10 ^ 5\n\tend func\nend func\n" }, { "id": 306, "name": "059", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, M, Q;\n\n\tcin >> N >> M >> Q;\n\n\tvector X(M), Y(M);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tcin >> X[i] >> Y[i];\n\n\t\t--X[i], --Y[i];\n\n\t}\n\n\tvector g(M);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tg[i] = 1LL * Y[i] * N + X[i];\n\n\t}\n\n\tsort(g.begin(), g.end());\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tX[i] = g[i] % N;\n\n\t\tY[i] = g[i] / N;\n\n\t}\n\n\tvector A(Q), B(Q);\n\n\tfor (int i = 0; i < Q; ++i) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\t--A[i], --B[i];\n\n\t}\n\n\tfor (int i = 0; i * 64 < Q; ++i) {\n\n\t\tvector dp(N, 0);\n\n\t\tfor (int j = i * 64; j < (i + 1) * 64 && j < Q; ++j) {\n\n\t\t\tdp[A[j]] |= 1ULL << (j - i * 64);\n\n\t\t}\n\n\t\tfor (int j = 0; j < M; ++j) {\n\n\t\t\tdp[Y[j]] |= dp[X[j]];\n\n\t\t}\n\n\t\tfor (int j = i * 64; j < (i + 1) * 64 && j < Q; ++j) {\n\n\t\t\tcout << (((dp[B[j]] >> (j - i * 64)) & 1) == 1 ? \"Yes\\n\" : \"No\\n\");\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n, m, q = read_line.split.map(&.to_i)\nedges = (1..m).map {\n {Int32, Int32}.from read_line.split.map(&.to_i.pred)\n}.sort_by { |x, y| {y, x} }\nab = (1..q).map {\n {Int32, Int32}.from read_line.split.map(&.to_i.pred)\n}\n\nab.each_slice(128) do |ab|\n flag = [UInt128.zero] * n\n ab.each_with_index { |(a, b), i| flag[a] |= 1.to_u128 << i }\n edges.each { |(x, y)| flag[y] |= flag[x] }\n ab.each_with_index { |(a, b), i| puts flag[b].bit(i) == 1 ? \"Yes\" : \"No\" }\nend\n" }, { "id": 307, "name": "059", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, M, Q;\n\n\tcin >> N >> M >> Q;\n\n\tvector X(M), Y(M);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tcin >> X[i] >> Y[i];\n\n\t\t--X[i], --Y[i];\n\n\t}\n\n\tvector g(M);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tg[i] = 1LL * Y[i] * N + X[i];\n\n\t}\n\n\tsort(g.begin(), g.end());\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tX[i] = g[i] % N;\n\n\t\tY[i] = g[i] / N;\n\n\t}\n\n\tvector A(Q), B(Q);\n\n\tfor (int i = 0; i < Q; ++i) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\t--A[i], --B[i];\n\n\t}\n\n\tfor (int i = 0; i * 64 < Q; ++i) {\n\n\t\tvector dp(N, 0);\n\n\t\tfor (int j = i * 64; j < (i + 1) * 64 && j < Q; ++j) {\n\n\t\t\tdp[A[j]] |= 1ULL << (j - i * 64);\n\n\t\t}\n\n\t\tfor (int j = 0; j < M; ++j) {\n\n\t\t\tdp[Y[j]] |= dp[X[j]];\n\n\t\t}\n\n\t\tfor (int j = i * 64; j < (i + 1) * 64 && j < Q; ++j) {\n\n\t\t\tcout << (((dp[B[j]] >> (j - i * 64)) & 1) == 1 ? \"Yes\\n\" : \"No\\n\");\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Python": "from sys import stdin\npin=stdin.readline\ndef main():\n N,M,Q=map(int,pin().split())\n G=[[]for _ in[0]*N]\n for _ in[0]*M:\n X,Y=map(int,pin().split())\n G[X-1].append(Y-1)\n d=[]\n c=1\n for _ in[0]*N:\n d.append(c)\n c<<=1\n for i in range(N):\n for j in G[i]:\n d[j]|=d[i]\n for _ in [0]*Q:\n A,B=map(int,pin().split())\n if (d[B-1]>>(A-1))&1:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n \nmain()\n" }, { "id": 308, "name": "059", "Crystal": "n, m, q = read_line.split.map(&.to_i)\nedges = (1..m).map {\n {Int32, Int32}.from read_line.split.map(&.to_i.pred)\n}.sort_by { |x, y| {y, x} }\nab = (1..q).map {\n {Int32, Int32}.from read_line.split.map(&.to_i.pred)\n}\n\nab.each_slice(128) do |ab|\n flag = [UInt128.zero] * n\n ab.each_with_index { |(a, b), i| flag[a] |= 1.to_u128 << i }\n edges.each { |(x, y)| flag[y] |= flag[x] }\n ab.each_with_index { |(a, b), i| puts flag[b].bit(i) == 1 ? \"Yes\" : \"No\" }\nend\n", "Python": "from sys import stdin\npin=stdin.readline\ndef main():\n N,M,Q=map(int,pin().split())\n G=[[]for _ in[0]*N]\n for _ in[0]*M:\n X,Y=map(int,pin().split())\n G[X-1].append(Y-1)\n d=[]\n c=1\n for _ in[0]*N:\n d.append(c)\n c<<=1\n for i in range(N):\n for j in G[i]:\n d[j]|=d[i]\n for _ in [0]*Q:\n A,B=map(int,pin().split())\n if (d[B-1]>>(A-1))&1:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n \nmain()\n" }, { "id": 309, "name": "060", "C++": "#include \nusing namespace std;\nint INF = 1 << 30;\n\nint main()\n{\n int N;\n cin >> N;\n vector A(N);\n for (int i = 0; i < N; i++)\n {\n cin >> A.at(i);\n A.at(i) = N + 1 - A.at(i); // 単調減少 → 単調増加 を作る問題にする\n }\n\n vector dp(N + 2, INF);\n dp.at(0) = -INF;\n\n for (auto a : A)\n {\n // 通常の LIS で選べる ｢a を使う｣ ｢何もしない｣ に加え ｢-a を使う｣ も選べる, これで単調増加を作る問題になった\n \n auto itmi = lower_bound(dp.begin(), dp.end(), -a);\n auto itpl = lower_bound(dp.begin(), dp.end(), a);\n\n int imi = itmi - dp.begin(), ipl = itpl - dp.begin();\n\n if (dp.at(ipl - 1) != -a) dp.at(ipl) = a; // ただし -2, 2 みたいになるとやばいのでそれだけ除外\n dp.at(imi) = -a;\n }\n\n for (int i = 1; i < N + 2; i++)\n {\n if (dp.at(i) == INF)\n {\n cout << i - 1 << endl;\n return 0;\n }\n }\n}\n", "Crystal": "def lis(a)\n dp = [] of Int32\n a.map do |x|\n if pos = dp.bsearch_index { |y| y >= x }\n dp[pos] = x\n pos + 1\n else\n dp << x\n dp.size\n end\n end\nend\n\nread_line\na = read_line.split.map(&.to_i)\nlis1, lis2 = lis(a), lis(a.reverse).reverse\nputs lis1.zip(lis2).max_of { |x, y| x + y - 1 }\n" }, { "id": 310, "name": "060", "C++": "#include \nusing namespace std;\nint INF = 1 << 30;\n\nint main()\n{\n int N;\n cin >> N;\n vector A(N);\n for (int i = 0; i < N; i++)\n {\n cin >> A.at(i);\n A.at(i) = N + 1 - A.at(i); // 単調減少 → 単調増加 を作る問題にする\n }\n\n vector dp(N + 2, INF);\n dp.at(0) = -INF;\n\n for (auto a : A)\n {\n // 通常の LIS で選べる ｢a を使う｣ ｢何もしない｣ に加え ｢-a を使う｣ も選べる, これで単調増加を作る問題になった\n \n auto itmi = lower_bound(dp.begin(), dp.end(), -a);\n auto itpl = lower_bound(dp.begin(), dp.end(), a);\n\n int imi = itmi - dp.begin(), ipl = itpl - dp.begin();\n\n if (dp.at(ipl - 1) != -a) dp.at(ipl) = a; // ただし -2, 2 みたいになるとやばいのでそれだけ除外\n dp.at(imi) = -a;\n }\n\n for (int i = 1; i < N + 2; i++)\n {\n if (dp.at(i) == INF)\n {\n cout << i - 1 << endl;\n return 0;\n }\n }\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: solve(a)\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc solve(a: []int): int\n\t\tvar lis: []int :: getLisArr(a)\n\t\tdo a.reverse()\n\t\tvar revLis: []int :: getLisArr(a)\n\t\tdo revLis.reverse()\n\t\tdo a.reverse()\n\t\tvar res: int :: 0\n\t\tfor i(0, ^a - 1)\n\t\t\tdo res :: [res, lis[i] + revLis[i] - 1].max()\n\t\tend for\n\t\tret res\n\t\t\n\t\tfunc getLisArr(a: []int): []int\n\t\t\tconst infInt: int :: lib@intMax\n\t\t\tvar n: int :: ^a\n\t\t\tvar buff: []int :: [infInt].repeat(n + 1)\n\t\t\tvar lisArr: []int :: #[n]int\n\t\t\tfor i(0, n - 1)\n\t\t\t\tvar idx: int :: f(buff, a[i])\n\t\t\t\tdo buff[idx] :: a[i]\n\t\t\t\tdo lisArr[i] :: f(buff, infInt)\n\t\t\t\t\n\t\t\t\tfunc f(arr: []int, val: int): int\n\t\t\t\t\tvar ok: int :: -1\n\t\t\t\t\tvar ng: int :: ^arr - 1\n\t\t\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\t\t\tif(val > arr[mid])\n\t\t\t\t\t\t\tdo ok :: mid\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tdo ng :: mid\n\t\t\t\t\t\tend if\n\t\t\t\t\tend while\n\t\t\t\t\tret ok + 1\n\t\t\t\tend func\n\t\t\tend for\n\t\t\tret lisArr\n\t\tend func\n\tend func\nend func\n" }, { "id": 311, "name": "060", "Crystal": "def lis(a)\n dp = [] of Int32\n a.map do |x|\n if pos = dp.bsearch_index { |y| y >= x }\n dp[pos] = x\n pos + 1\n else\n dp << x\n dp.size\n end\n end\nend\n\nread_line\na = read_line.split.map(&.to_i)\nlis1, lis2 = lis(a), lis(a.reverse).reverse\nputs lis1.zip(lis2).max_of { |x, y| x + y - 1 }\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: solve(a)\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc solve(a: []int): int\n\t\tvar lis: []int :: getLisArr(a)\n\t\tdo a.reverse()\n\t\tvar revLis: []int :: getLisArr(a)\n\t\tdo revLis.reverse()\n\t\tdo a.reverse()\n\t\tvar res: int :: 0\n\t\tfor i(0, ^a - 1)\n\t\t\tdo res :: [res, lis[i] + revLis[i] - 1].max()\n\t\tend for\n\t\tret res\n\t\t\n\t\tfunc getLisArr(a: []int): []int\n\t\t\tconst infInt: int :: lib@intMax\n\t\t\tvar n: int :: ^a\n\t\t\tvar buff: []int :: [infInt].repeat(n + 1)\n\t\t\tvar lisArr: []int :: #[n]int\n\t\t\tfor i(0, n - 1)\n\t\t\t\tvar idx: int :: f(buff, a[i])\n\t\t\t\tdo buff[idx] :: a[i]\n\t\t\t\tdo lisArr[i] :: f(buff, infInt)\n\t\t\t\t\n\t\t\t\tfunc f(arr: []int, val: int): int\n\t\t\t\t\tvar ok: int :: -1\n\t\t\t\t\tvar ng: int :: ^arr - 1\n\t\t\t\t\twhile((ok - ng).abs() > 1)\n\t\t\t\t\t\tvar mid: int :: (ok + ng) / 2\n\t\t\t\t\t\tif(val > arr[mid])\n\t\t\t\t\t\t\tdo ok :: mid\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tdo ng :: mid\n\t\t\t\t\t\tend if\n\t\t\t\t\tend while\n\t\t\t\t\tret ok + 1\n\t\t\t\tend func\n\t\t\tend for\n\t\t\tret lisArr\n\t\tend func\n\tend func\nend func\n" }, { "id": 312, "name": "061", "C++": "#include \n\nusing namespace std;\n\n\n\nint Q, T[1 << 20], X[1 << 20];\n\nint A[1 << 20];\n\nint cl = 500000, cr = 500000;\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> T[i] >> X[i];\n\n\n\n\t// Step #2. シミュレーション\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tif (T[i] == 1) {\n\n\t\t\tcl--;\n\n\t\t\tA[cl] = X[i];\n\n\t\t}\n\n\t\tif (T[i] == 2) {\n\n\t\t\tA[cr] = X[i];\n\n\t\t\tcr++;\n\n\t\t}\n\n\t\tif (T[i] == 3) {\n\n\t\t\tcout << A[cl + X[i] - 1] << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "a = Deque(Int32).new\nread_line.to_i.times do\n t, x = read_line.split.map(&.to_i)\n case t\n when 2\n a.push x\n when 1\n a.unshift x\n when 3\n puts a[x - 1]\n end\nend\n" }, { "id": 313, "name": "061", "C++": "#include \n\nusing namespace std;\n\n\n\nint Q, T[1 << 20], X[1 << 20];\n\nint A[1 << 20];\n\nint cl = 500000, cr = 500000;\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> T[i] >> X[i];\n\n\n\n\t// Step #2. シミュレーション\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tif (T[i] == 1) {\n\n\t\t\tcl--;\n\n\t\t\tA[cl] = X[i];\n\n\t\t}\n\n\t\tif (T[i] == 2) {\n\n\t\t\tA[cr] = X[i];\n\n\t\t\tcr++;\n\n\t\t}\n\n\t\tif (T[i] == 3) {\n\n\t\t\tcout << A[cl + X[i] - 1] << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Python": "\"\"\"\nt = 1 ... xを上に入れる\nt = 2 ... xを下に入れる\nt = 3 ... 上からx番目のカードを出力\n\"\"\"\nQ = int(input())\nfrom collections import deque\nq = deque()\nfor i in range(Q):\n t, x = map(int,input().split())\n if t == 1:\n q.appendleft(x)\n elif t == 2:\n q.append(x)\n elif t == 3:\n print(q[x - 1])" }, { "id": 314, "name": "061", "C++": "#include \n\nusing namespace std;\n\n\n\nint Q, T[1 << 20], X[1 << 20];\n\nint A[1 << 20];\n\nint cl = 500000, cr = 500000;\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> Q;\n\n\tfor (int i = 1; i <= Q; i++) cin >> T[i] >> X[i];\n\n\n\n\t// Step #2. シミュレーション\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tif (T[i] == 1) {\n\n\t\t\tcl--;\n\n\t\t\tA[cl] = X[i];\n\n\t\t}\n\n\t\tif (T[i] == 2) {\n\n\t\t\tA[cr] = X[i];\n\n\t\t\tcr++;\n\n\t\t}\n\n\t\tif (T[i] == 3) {\n\n\t\t\tcout << A[cl + X[i] - 1] << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[2 * 10 ^ 5]int\n\tvar l: int :: 10 ^ 5\n\tvar r: int :: l\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tvar x: int :: cui@inputInt()\n\t\tswitch(t)\n\t\tcase 1\n\t\t\tdo l :- 1\n\t\t\tdo a[l] :: x\n\t\tcase 2\n\t\t\tdo a[r] :: x\n\t\t\tdo r :+ 1\n\t\tcase 3\n\t\t\tdo cui@print(\"\\{a[l + x - 1]}\\n\")\n\t\tend switch\n\tend for\nend func\n" }, { "id": 315, "name": "061", "Crystal": "a = Deque(Int32).new\nread_line.to_i.times do\n t, x = read_line.split.map(&.to_i)\n case t\n when 2\n a.push x\n when 1\n a.unshift x\n when 3\n puts a[x - 1]\n end\nend\n", "Python": "\"\"\"\nt = 1 ... xを上に入れる\nt = 2 ... xを下に入れる\nt = 3 ... 上からx番目のカードを出力\n\"\"\"\nQ = int(input())\nfrom collections import deque\nq = deque()\nfor i in range(Q):\n t, x = map(int,input().split())\n if t == 1:\n q.appendleft(x)\n elif t == 2:\n q.append(x)\n elif t == 3:\n print(q[x - 1])" }, { "id": 316, "name": "061", "Crystal": "a = Deque(Int32).new\nread_line.to_i.times do\n t, x = read_line.split.map(&.to_i)\n case t\n when 2\n a.push x\n when 1\n a.unshift x\n when 3\n puts a[x - 1]\n end\nend\n", "Kuin": "func main()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[2 * 10 ^ 5]int\n\tvar l: int :: 10 ^ 5\n\tvar r: int :: l\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tvar x: int :: cui@inputInt()\n\t\tswitch(t)\n\t\tcase 1\n\t\t\tdo l :- 1\n\t\t\tdo a[l] :: x\n\t\tcase 2\n\t\t\tdo a[r] :: x\n\t\t\tdo r :+ 1\n\t\tcase 3\n\t\t\tdo cui@print(\"\\{a[l + x - 1]}\\n\")\n\t\tend switch\n\tend for\nend func\n" }, { "id": 317, "name": "061", "Python": "\"\"\"\nt = 1 ... xを上に入れる\nt = 2 ... xを下に入れる\nt = 3 ... 上からx番目のカードを出力\n\"\"\"\nQ = int(input())\nfrom collections import deque\nq = deque()\nfor i in range(Q):\n t, x = map(int,input().split())\n if t == 1:\n q.appendleft(x)\n elif t == 2:\n q.append(x)\n elif t == 3:\n print(q[x - 1])", "Kuin": "func main()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[2 * 10 ^ 5]int\n\tvar l: int :: 10 ^ 5\n\tvar r: int :: l\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tvar x: int :: cui@inputInt()\n\t\tswitch(t)\n\t\tcase 1\n\t\t\tdo l :- 1\n\t\t\tdo a[l] :: x\n\t\tcase 2\n\t\t\tdo a[r] :: x\n\t\t\tdo r :+ 1\n\t\tcase 3\n\t\t\tdo cui@print(\"\\{a[l + x - 1]}\\n\")\n\t\tend switch\n\tend for\nend func\n" }, { "id": 318, "name": "062", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint N;\n\nint A[1 << 18], B[1 << 18];\n\nbool usable[1 << 18];\n\nvector G[1 << 18];\n\nqueue Q;\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(i);\n\n\t\tG[B[i]].push_back(i);\n\n\t\tif (A[i] == i || B[i] == i) {\n\n\t\t\tusable[i] = true;\n\n\t\t\tQ.push(i);\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #2. 後ろからシミュレーション\n\n\tvector vec;\n\n\twhile (!Q.empty()) {\n\n\t\tint pos = Q.front(); Q.pop();\n\n\t\tvec.push_back(pos);\n\n\t\tfor (int i : G[pos]) {\n\n\t\t\tif (usable[i] == true) continue;\n\n\t\t\tusable[i] = true;\n\n\t\t\tQ.push(i);\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #3. 答えを求める\n\n\treverse(vec.begin(), vec.end());\n\n\tif (vec.size() != N) {\n\n\t\tcout << \"-1\" << endl;\n\n\t}\n\n\telse {\n\n\t\tfor (int i = 0; i < vec.size(); i++) cout << vec[i] << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n = read_line.to_i\n\ngraph = Array.new(n) { [] of Int32 }\nstack = Deque(Int32).new\ndone = [false] * n\nn.times do |i|\n a, b = read_line.split.map(&.to_i.pred)\n if a == i || b == i\n stack << i\n done[i] = true\n else\n graph[a] << i\n graph[b] << i\n end\nend\n\nans = [] of Int32\nwhile v = stack.pop?\n ans << v\n graph[v].each do |u|\n unless done[u]\n stack << u\n done[u] = true\n end\n end\nend\nputs done.all? ? ans.reverse.join('\\n', &.succ) : -1\n" }, { "id": 319, "name": "063", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nint P[19][10009];\n\n\n\nint maximum_same(vector R) {\n\n\tmap Map; int ret = 0;\n\n\tfor (int i = 0; i < R.size(); i++) {\n\n\t\tMap[R[i]] += 1;\n\n\t\tret = max(ret, Map[R[i]]);\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 0; i < H; i++) {\n\n\t\tfor (int j = 0; j < W; j++) cin >> P[i][j];\n\n\t}\n\n\n\n\t// Step #2. ‘S’T�õ\n\n\tint Answer = 0;\n\n\tfor (int i = 1; i < (1 << H); i++) {\n\n\t\tvector R;\n\n\t\tfor (int j = 0; j < W; j++) {\n\n\t\t\tint idx = -1; bool flag = false;\n\n\t\t\tfor (int k = 0; k < H; k++) {\n\n\t\t\t\tif ((i & (1 << k)) == 0) continue;\n\n\t\t\t\tif (idx == -1) idx = P[k][j];\n\n\t\t\t\telse if (idx != P[k][j]) flag = true;\n\n\t\t\t}\n\n\t\t\tif (flag == false) R.push_back(idx);\n\n\t\t}\n\n\n\n\t\tint cntH = 0, cntW = maximum_same(R);\n\n\t\tfor (int j = 0; j < H; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) cntH += 1;\n\n\t\t}\n\n\t\tAnswer = max(Answer, cntH * cntW);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nputs (1...1 << h).max_of { |bit|\n ind = (0...h).select { |i| bit.bit(i) == 1 }\n ((0...w).select { |j|\n ind.all? { |i| a[i][j] == a[ind[0]][j] }\n }.map { |j| a[ind[0]][j] }.tally.max_of?(&.[1]) || 0) * ind.size\n}\n" }, { "id": 320, "name": "063", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nint P[19][10009];\n\n\n\nint maximum_same(vector R) {\n\n\tmap Map; int ret = 0;\n\n\tfor (int i = 0; i < R.size(); i++) {\n\n\t\tMap[R[i]] += 1;\n\n\t\tret = max(ret, Map[R[i]]);\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 0; i < H; i++) {\n\n\t\tfor (int j = 0; j < W; j++) cin >> P[i][j];\n\n\t}\n\n\n\n\t// Step #2. ‘S’T�õ\n\n\tint Answer = 0;\n\n\tfor (int i = 1; i < (1 << H); i++) {\n\n\t\tvector R;\n\n\t\tfor (int j = 0; j < W; j++) {\n\n\t\t\tint idx = -1; bool flag = false;\n\n\t\t\tfor (int k = 0; k < H; k++) {\n\n\t\t\t\tif ((i & (1 << k)) == 0) continue;\n\n\t\t\t\tif (idx == -1) idx = P[k][j];\n\n\t\t\t\telse if (idx != P[k][j]) flag = true;\n\n\t\t\t}\n\n\t\t\tif (flag == false) R.push_back(idx);\n\n\t\t}\n\n\n\n\t\tint cntH = 0, cntW = maximum_same(R);\n\n\t\tfor (int j = 0; j < H; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) cntH += 1;\n\n\t\t}\n\n\t\tAnswer = max(Answer, cntH * cntW);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Python": "from itertools import product\nfrom collections import Counter\n\ndef calc(A: list) -> int:\n \"良いグリッドを求める\"\n\n # bitの立っている行数を求める\n colum = 0\n for i in range(len(A)):\n if A[i] == 1:\n colum += 1\n \n cnt = Counter()\n for i in range(w):\n num = [] \n for j in range(h):\n if A[j] == 1:\n num.append(p[j][i])\n # 列に入っている数字が全て同じである時\n if len(set(num)) == 1:\n cnt[num[0]] += 1\n \n return max(cnt.values()) * colum if len(cnt) > 0 else 0\n\nh, w = map(int,input().split())\np = [list(map(int,input().split())) for _ in range(h)]\n\nans = 0\nfor bit in product([0, 1], repeat = h):\n ans = max(ans, calc(bit))\n\nprint(ans)" }, { "id": 321, "name": "063", "C++": "#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nint P[19][10009];\n\n\n\nint maximum_same(vector R) {\n\n\tmap Map; int ret = 0;\n\n\tfor (int i = 0; i < R.size(); i++) {\n\n\t\tMap[R[i]] += 1;\n\n\t\tret = max(ret, Map[R[i]]);\n\n\t}\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. “ü—Í\n\n\tcin >> H >> W;\n\n\tfor (int i = 0; i < H; i++) {\n\n\t\tfor (int j = 0; j < W; j++) cin >> P[i][j];\n\n\t}\n\n\n\n\t// Step #2. ‘S’T�õ\n\n\tint Answer = 0;\n\n\tfor (int i = 1; i < (1 << H); i++) {\n\n\t\tvector R;\n\n\t\tfor (int j = 0; j < W; j++) {\n\n\t\t\tint idx = -1; bool flag = false;\n\n\t\t\tfor (int k = 0; k < H; k++) {\n\n\t\t\t\tif ((i & (1 << k)) == 0) continue;\n\n\t\t\t\tif (idx == -1) idx = P[k][j];\n\n\t\t\t\telse if (idx != P[k][j]) flag = true;\n\n\t\t\t}\n\n\t\t\tif (flag == false) R.push_back(idx);\n\n\t\t}\n\n\n\n\t\tint cntH = 0, cntW = maximum_same(R);\n\n\t\tfor (int j = 0; j < H; j++) {\n\n\t\t\tif ((i & (1 << j)) != 0) cntH += 1;\n\n\t\t}\n\n\t\tAnswer = max(Answer, cntH * cntW);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar p: [][]int :: #[h, w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo p[y][x] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor id(0, 2 ^ h - 1)\n\t\tvar i: int :: id\n\t\tvar f: []bool :: #[h]bool\n\t\tfor j(0, h - 1)\n\t\t\tdo f[j] :: i % 2 = 1\n\t\t\tdo i :/ 2\n\t\tend for\n\t\t\n\t\tvar map: dict :: #dict\n\t\tfor x(0, w - 1)\n\t\t\tvar prev: int :: -1\n\t\t\tvar cnt: int :: 0\n\t\t\tfor y(0, h - 1)\n\t\t\t\tif(f[y])\n\t\t\t\t\tif(prev <> -1 & prev <> p[y][x])\n\t\t\t\t\t\tskip x\n\t\t\t\t\tend if\n\t\t\t\t\tdo prev :: p[y][x]\n\t\t\t\t\tdo cnt :+ 1\n\t\t\t\tend if\n\t\t\tend for\n\t\t\tvar val: int :: map.get(prev, &) + cnt\n\t\t\tdo map.add(prev, val)\n\t\t\tdo ans :: [ans, val].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 322, "name": "063", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nputs (1...1 << h).max_of { |bit|\n ind = (0...h).select { |i| bit.bit(i) == 1 }\n ((0...w).select { |j|\n ind.all? { |i| a[i][j] == a[ind[0]][j] }\n }.map { |j| a[ind[0]][j] }.tally.max_of?(&.[1]) || 0) * ind.size\n}\n", "Python": "from itertools import product\nfrom collections import Counter\n\ndef calc(A: list) -> int:\n \"良いグリッドを求める\"\n\n # bitの立っている行数を求める\n colum = 0\n for i in range(len(A)):\n if A[i] == 1:\n colum += 1\n \n cnt = Counter()\n for i in range(w):\n num = [] \n for j in range(h):\n if A[j] == 1:\n num.append(p[j][i])\n # 列に入っている数字が全て同じである時\n if len(set(num)) == 1:\n cnt[num[0]] += 1\n \n return max(cnt.values()) * colum if len(cnt) > 0 else 0\n\nh, w = map(int,input().split())\np = [list(map(int,input().split())) for _ in range(h)]\n\nans = 0\nfor bit in product([0, 1], repeat = h):\n ans = max(ans, calc(bit))\n\nprint(ans)" }, { "id": 323, "name": "063", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i) }\nputs (1...1 << h).max_of { |bit|\n ind = (0...h).select { |i| bit.bit(i) == 1 }\n ((0...w).select { |j|\n ind.all? { |i| a[i][j] == a[ind[0]][j] }\n }.map { |j| a[ind[0]][j] }.tally.max_of?(&.[1]) || 0) * ind.size\n}\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar p: [][]int :: #[h, w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo p[y][x] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor id(0, 2 ^ h - 1)\n\t\tvar i: int :: id\n\t\tvar f: []bool :: #[h]bool\n\t\tfor j(0, h - 1)\n\t\t\tdo f[j] :: i % 2 = 1\n\t\t\tdo i :/ 2\n\t\tend for\n\t\t\n\t\tvar map: dict :: #dict\n\t\tfor x(0, w - 1)\n\t\t\tvar prev: int :: -1\n\t\t\tvar cnt: int :: 0\n\t\t\tfor y(0, h - 1)\n\t\t\t\tif(f[y])\n\t\t\t\t\tif(prev <> -1 & prev <> p[y][x])\n\t\t\t\t\t\tskip x\n\t\t\t\t\tend if\n\t\t\t\t\tdo prev :: p[y][x]\n\t\t\t\t\tdo cnt :+ 1\n\t\t\t\tend if\n\t\t\tend for\n\t\t\tvar val: int :: map.get(prev, &) + cnt\n\t\t\tdo map.add(prev, val)\n\t\t\tdo ans :: [ans, val].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 324, "name": "063", "Python": "from itertools import product\nfrom collections import Counter\n\ndef calc(A: list) -> int:\n \"良いグリッドを求める\"\n\n # bitの立っている行数を求める\n colum = 0\n for i in range(len(A)):\n if A[i] == 1:\n colum += 1\n \n cnt = Counter()\n for i in range(w):\n num = [] \n for j in range(h):\n if A[j] == 1:\n num.append(p[j][i])\n # 列に入っている数字が全て同じである時\n if len(set(num)) == 1:\n cnt[num[0]] += 1\n \n return max(cnt.values()) * colum if len(cnt) > 0 else 0\n\nh, w = map(int,input().split())\np = [list(map(int,input().split())) for _ in range(h)]\n\nans = 0\nfor bit in product([0, 1], repeat = h):\n ans = max(ans, calc(bit))\n\nprint(ans)", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar p: [][]int :: #[h, w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo p[y][x] :: cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor id(0, 2 ^ h - 1)\n\t\tvar i: int :: id\n\t\tvar f: []bool :: #[h]bool\n\t\tfor j(0, h - 1)\n\t\t\tdo f[j] :: i % 2 = 1\n\t\t\tdo i :/ 2\n\t\tend for\n\t\t\n\t\tvar map: dict :: #dict\n\t\tfor x(0, w - 1)\n\t\t\tvar prev: int :: -1\n\t\t\tvar cnt: int :: 0\n\t\t\tfor y(0, h - 1)\n\t\t\t\tif(f[y])\n\t\t\t\t\tif(prev <> -1 & prev <> p[y][x])\n\t\t\t\t\t\tskip x\n\t\t\t\t\tend if\n\t\t\t\t\tdo prev :: p[y][x]\n\t\t\t\t\tdo cnt :+ 1\n\t\t\t\tend if\n\t\t\tend for\n\t\t\tvar val: int :: map.get(prev, &) + cnt\n\t\t\tdo map.add(prev, val)\n\t\t\tdo ans :: [ans, val].max()\n\t\tend for\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 325, "name": "064", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, A[1 << 18], B[1 << 18];\n\nlong long Q, L[1 << 18], R[1 << 18], V[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> Q;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tfor (int i = 1; i <= Q; i++) cin >> L[i] >> R[i] >> V[i];\n\n\n\n\t// Step #2. 最初の答え\n\n\tlong long Answer = 0;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tB[i] = A[i + 1] - A[i];\n\n\t\tAnswer += abs(B[i]);\n\n\t}\n\n\t\n\n\t// Step #3. シミュレーション\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tlong long mae = abs(B[L[i] - 1]) + abs(B[R[i]]);\n\n\t\tif (L[i] >= 2) B[L[i] - 1] += V[i];\n\n\t\tif (R[i] <= N - 1) B[R[i]] -= V[i];\n\n\t\tlong long ato = abs(B[L[i] - 1]) + abs(B[R[i]]);\n\n\t\tAnswer += (ato - mae);\n\n\t\tcout << Answer << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "n, q = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i64)\nd = a.each_cons(2).map { |(x, y)| x - y }.to_a\nans = d.sum(&.abs)\nq.times do\n l, r, v = read_line.split.map(&.to_i)\n if l != 1\n ans -= d[l - 2].abs\n d[l - 1] -= v\n ans += d[l - 2].abs\n end\n if r != n\n ans -= d[r - 1].abs\n d[r - 1] += v\n ans += d[r - 1].abs\n end\n puts ans\nend\n" }, { "id": 326, "name": "064", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, A[1 << 18], B[1 << 18];\n\nlong long Q, L[1 << 18], R[1 << 18], V[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> Q;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tfor (int i = 1; i <= Q; i++) cin >> L[i] >> R[i] >> V[i];\n\n\n\n\t// Step #2. 最初の答え\n\n\tlong long Answer = 0;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tB[i] = A[i + 1] - A[i];\n\n\t\tAnswer += abs(B[i]);\n\n\t}\n\n\t\n\n\t// Step #3. シミュレーション\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tlong long mae = abs(B[L[i] - 1]) + abs(B[R[i]]);\n\n\t\tif (L[i] >= 2) B[L[i] - 1] += V[i];\n\n\t\tif (R[i] <= N - 1) B[R[i]] -= V[i];\n\n\t\tlong long ato = abs(B[L[i] - 1]) + abs(B[R[i]]);\n\n\t\tAnswer += (ato - mae);\n\n\t\tcout << Answer << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * (@n + 1)\n end\n\n def add(i, val)\n while i <= @n\n @data[i] += val\n i += i & -i\n end\n end\n\n def sum(i)\n acc = 0\n while i > 0\n acc += @data[i]\n i -= i & -i\n end\n acc\n end\nend\n\ndef main\n n, q = readline.split.map!(&:to_i)\n\n a = ['0']\n a.concat(readline.split)\n a.map!(&:to_i)\n\n ans = (2..n).inject(0) do |sum, i|\n sum + (a[i-1] - a[i]).abs\n end\n\n os = OnlineSum.new(n)\n q.times do\n l, r, v = readline.split.map(&:to_i)\n\n if l > 1 then\n lo = a[l - 1] + os.sum(l - 1)\n hi = a[l - 0] + os.sum(l - 0)\n ans -= (lo - hi).abs\n end\n if r < n then\n lo = a[r + 0] + os.sum(r + 0)\n hi = a[r + 1] + os.sum(r + 1)\n ans -= (lo - hi).abs\n end\n\n os.add(l, v)\n os.add(r + 1, -v) if r < n\n\n if l > 1 then\n lo = a[l - 1] + os.sum(l - 1)\n hi = a[l - 0] + os.sum(l - 0)\n ans += (lo - hi).abs\n end\n if r < n then\n lo = a[r + 0] + os.sum(r + 0)\n hi = a[r + 1] + os.sum(r + 1)\n ans += (lo - hi).abs\n end\n\n puts ans\n end\nend\n\nmain if __FILE__ == $0\n" }, { "id": 327, "name": "064", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, A[1 << 18], B[1 << 18];\n\nlong long Q, L[1 << 18], R[1 << 18], V[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. 入力\n\n\tcin >> N >> Q;\n\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\n\tfor (int i = 1; i <= Q; i++) cin >> L[i] >> R[i] >> V[i];\n\n\n\n\t// Step #2. 最初の答え\n\n\tlong long Answer = 0;\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tB[i] = A[i + 1] - A[i];\n\n\t\tAnswer += abs(B[i]);\n\n\t}\n\n\t\n\n\t// Step #3. シミュレーション\n\n\tfor (int i = 1; i <= Q; i++) {\n\n\t\tlong long mae = abs(B[L[i] - 1]) + abs(B[R[i]]);\n\n\t\tif (L[i] >= 2) B[L[i] - 1] += V[i];\n\n\t\tif (R[i] <= N - 1) B[R[i]] -= V[i];\n\n\t\tlong long ato = abs(B[L[i] - 1]) + abs(B[R[i]]);\n\n\t\tAnswer += (ato - mae);\n\n\t\tcout << Answer << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: 0\n\tvar diff: []int :: #[n - 1]int\n\tfor i(0, n - 2)\n\t\tdo diff[i] :: a[i + 1] - a[i]\n\t\tdo ans :+ diff[i].abs()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tvar v: int :: cui@inputInt()\n\t\tif(l <> 0)\n\t\t\tdo ans :- diff[l - 1].abs()\n\t\t\tdo diff[l - 1] :+ v\n\t\t\tdo ans :+ diff[l - 1].abs()\n\t\tend if\n\t\tif(r <> n - 1)\n\t\t\tdo ans :- diff[r].abs()\n\t\t\tdo diff[r] :- v\n\t\t\tdo ans :+ diff[r].abs()\n\t\tend if\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 328, "name": "064", "Crystal": "n, q = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i64)\nd = a.each_cons(2).map { |(x, y)| x - y }.to_a\nans = d.sum(&.abs)\nq.times do\n l, r, v = read_line.split.map(&.to_i)\n if l != 1\n ans -= d[l - 2].abs\n d[l - 1] -= v\n ans += d[l - 2].abs\n end\n if r != n\n ans -= d[r - 1].abs\n d[r - 1] += v\n ans += d[r - 1].abs\n end\n puts ans\nend\n", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * (@n + 1)\n end\n\n def add(i, val)\n while i <= @n\n @data[i] += val\n i += i & -i\n end\n end\n\n def sum(i)\n acc = 0\n while i > 0\n acc += @data[i]\n i -= i & -i\n end\n acc\n end\nend\n\ndef main\n n, q = readline.split.map!(&:to_i)\n\n a = ['0']\n a.concat(readline.split)\n a.map!(&:to_i)\n\n ans = (2..n).inject(0) do |sum, i|\n sum + (a[i-1] - a[i]).abs\n end\n\n os = OnlineSum.new(n)\n q.times do\n l, r, v = readline.split.map(&:to_i)\n\n if l > 1 then\n lo = a[l - 1] + os.sum(l - 1)\n hi = a[l - 0] + os.sum(l - 0)\n ans -= (lo - hi).abs\n end\n if r < n then\n lo = a[r + 0] + os.sum(r + 0)\n hi = a[r + 1] + os.sum(r + 1)\n ans -= (lo - hi).abs\n end\n\n os.add(l, v)\n os.add(r + 1, -v) if r < n\n\n if l > 1 then\n lo = a[l - 1] + os.sum(l - 1)\n hi = a[l - 0] + os.sum(l - 0)\n ans += (lo - hi).abs\n end\n if r < n then\n lo = a[r + 0] + os.sum(r + 0)\n hi = a[r + 1] + os.sum(r + 1)\n ans += (lo - hi).abs\n end\n\n puts ans\n end\nend\n\nmain if __FILE__ == $0\n" }, { "id": 329, "name": "064", "Crystal": "n, q = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i64)\nd = a.each_cons(2).map { |(x, y)| x - y }.to_a\nans = d.sum(&.abs)\nq.times do\n l, r, v = read_line.split.map(&.to_i)\n if l != 1\n ans -= d[l - 2].abs\n d[l - 1] -= v\n ans += d[l - 2].abs\n end\n if r != n\n ans -= d[r - 1].abs\n d[r - 1] += v\n ans += d[r - 1].abs\n end\n puts ans\nend\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: 0\n\tvar diff: []int :: #[n - 1]int\n\tfor i(0, n - 2)\n\t\tdo diff[i] :: a[i + 1] - a[i]\n\t\tdo ans :+ diff[i].abs()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tvar v: int :: cui@inputInt()\n\t\tif(l <> 0)\n\t\t\tdo ans :- diff[l - 1].abs()\n\t\t\tdo diff[l - 1] :+ v\n\t\t\tdo ans :+ diff[l - 1].abs()\n\t\tend if\n\t\tif(r <> n - 1)\n\t\t\tdo ans :- diff[r].abs()\n\t\t\tdo diff[r] :- v\n\t\t\tdo ans :+ diff[r].abs()\n\t\tend if\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 330, "name": "064", "Ruby": "class OnlineSum\n def initialize(n)\n @n = 2 ** Math.log2(n).ceil\n @data = [0] * (@n + 1)\n end\n\n def add(i, val)\n while i <= @n\n @data[i] += val\n i += i & -i\n end\n end\n\n def sum(i)\n acc = 0\n while i > 0\n acc += @data[i]\n i -= i & -i\n end\n acc\n end\nend\n\ndef main\n n, q = readline.split.map!(&:to_i)\n\n a = ['0']\n a.concat(readline.split)\n a.map!(&:to_i)\n\n ans = (2..n).inject(0) do |sum, i|\n sum + (a[i-1] - a[i]).abs\n end\n\n os = OnlineSum.new(n)\n q.times do\n l, r, v = readline.split.map(&:to_i)\n\n if l > 1 then\n lo = a[l - 1] + os.sum(l - 1)\n hi = a[l - 0] + os.sum(l - 0)\n ans -= (lo - hi).abs\n end\n if r < n then\n lo = a[r + 0] + os.sum(r + 0)\n hi = a[r + 1] + os.sum(r + 1)\n ans -= (lo - hi).abs\n end\n\n os.add(l, v)\n os.add(r + 1, -v) if r < n\n\n if l > 1 then\n lo = a[l - 1] + os.sum(l - 1)\n hi = a[l - 0] + os.sum(l - 0)\n ans += (lo - hi).abs\n end\n if r < n then\n lo = a[r + 0] + os.sum(r + 0)\n hi = a[r + 1] + os.sum(r + 1)\n ans += (lo - hi).abs\n end\n\n puts ans\n end\nend\n\nmain if __FILE__ == $0\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar a: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo a[i] :: cui@inputInt()\n\tend for\n\t\n\tvar ans: int :: 0\n\tvar diff: []int :: #[n - 1]int\n\tfor i(0, n - 2)\n\t\tdo diff[i] :: a[i + 1] - a[i]\n\t\tdo ans :+ diff[i].abs()\n\tend for\n\t\n\tfor(1, q)\n\t\tvar l: int :: cui@inputInt() - 1\n\t\tvar r: int :: cui@inputInt() - 1\n\t\tvar v: int :: cui@inputInt()\n\t\tif(l <> 0)\n\t\t\tdo ans :- diff[l - 1].abs()\n\t\t\tdo diff[l - 1] :+ v\n\t\t\tdo ans :+ diff[l - 1].abs()\n\t\tend if\n\t\tif(r <> n - 1)\n\t\t\tdo ans :- diff[r].abs()\n\t\t\tdo diff[r] :- v\n\t\t\tdo ans :+ diff[r].abs()\n\t\tend if\n\t\tdo cui@print(\"\\{ans}\\n\")\n\tend for\nend func\n" }, { "id": 331, "name": "065", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long mod = 998244353;\n\nlong long fact[1 << 19], inv[1 << 19];\n\n\n\nlong long modpow(long long a, long long b, long long m) {\n\n\tlong long p = 1, q = a;\n\n\tfor (int i = 0; i < 32; i++) {\n\n\t\tif ((b & (1LL << i)) != 0LL) {\n\n\t\t\tp *= q; p %= m;\n\n\t\t}\n\n\t\tq *= q; q %= m;\n\n\t}\n\n\treturn p;\n\n}\n\n\n\nlong long Div(long long a, long long b, long long m) {\n\n\treturn (a * modpow(b, m - 2, m)) % m;\n\n}\n\n\n\nlong long ncr(long long n, long long r) {\n\n\tif (n < r || r < 0) return 0;\n\n\treturn (fact[n] * inv[r] % mod) * inv[n - r] % mod;\n\n}\n\n\n\nvoid init() {\n\n\tfact[0] = 1LL;\n\n\tfor (int i = 1; i <= 500000; i++) fact[i] = (1LL * i * fact[i - 1]) % mod;\n\n\tfor (int i = 0; i <= 500000; i++) inv[i] = Div(1, fact[i], mod);\n\n}\n\n\n\nlong long R, G, B, K;\n\nlong long X, Y, Z;\n\nlong long ar[1 << 19], ag[1 << 19], ab[1 << 19];\n\n\n\nint main() {\n\n\tinit();\n\n\n\n\t// Step #1. “ü—Í\n\n\tcin >> R >> G >> B >> K;\n\n\tcin >> X >> Y >> Z;\n\n\n\n\t// Step #2. ‘O�ˆ—�\n\n\tlong long R_left = K - Y, R_right = R;\n\n\tlong long G_left = K - Z, G_right = G;\n\n\tlong long B_left = K - X, B_right = B;\n\n\tfor (int i = 0; i <= R; i++) ar[i] = ncr(R, i);\n\n\tfor (int i = 0; i <= G; i++) ag[i] = ncr(G, i);\n\n\tfor (int i = 0; i <= B; i++) ab[i] = ncr(B, i);\n\n\n\n\t// Step #3. FFT\n\n\tvector p1(R + 1, 0), p2(G + 1, 0), p3;\n\n\tfor (int i = R_left; i <= R_right; i++) p1[i] = ar[i];\n\n\tfor (int i = G_left; i <= G_right; i++) p2[i] = ag[i];\n\n\tp3 = atcoder::convolution(p1, p2);\n\n\n\n\t// Step #4. “š‚¦‚ğ‹�‚ß‚é\n\n\tlong long Answer = 0;\n\n\tfor (int i = B_left; i <= B_right; i++) {\n\n\t\tlong long ret1 = 0, ret2 = ab[i];\n\n\t\tif (0 <= K - i && K - i <= (int)p3.size()) ret1 = p3[K - i];\n\n\t\tAnswer += ret1 * ret2;\n\n\t\tAnswer %= mod;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "struct Mint\n MOD = 998244353i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n getter value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m)\n value == m\n end\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD - value : 0i64)\n end\n\n def +(v)\n self + Mint.new(v)\n end\n\n def +(m : self)\n x = value + m.value\n x -= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - Mint.new(v)\n end\n\n def -(m : self)\n x = value - m.value\n x += MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * Mint.new(v)\n end\n\n def *(m : self)\n Mint.new(value * m.value)\n end\n\n def /(v)\n self / Mint.new(v)\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.value, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a -= t * b\n a, b = b, a\n u -= t * v\n u, v = v, u\n end\n Mint.new(value * u)\n end\n\n def **(exponent : Int)\n t, x = self, Mint.raw(1i64)\n while exponent > 0\n x *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n x\n end\n\n def inv\n Mint.raw(1) / self\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nclass Combination(T)\n def initialize(initial_capacity : Int = 1)\n initial_capacity += 1\n @size = 2\n @factorial = Array(T).new(initial_capacity)\n @factorial << T.new(1) << T.new(1)\n @inv = Array(T).new(initial_capacity)\n @inv << T.zero << T.new(1)\n @finv = Array(T).new(initial_capacity)\n @finv << T.new(1) << T.new(1)\n expand_until(initial_capacity)\n end\n\n private def expand_until(n : Int)\n while @size <= n\n @factorial << @factorial[-1] * @size\n @inv << -@inv[T::MOD % @size] * (T::MOD // @size)\n @finv << @finv[-1] * @inv[@size]\n @size += 1\n end\n end\n\n def factorial(n : Int)\n expand_until(n)\n @factorial[n]\n end\n\n def inv(n : Int)\n expand_until(n)\n @inv[n]\n end\n\n def finv(n : Int)\n expand_until(n)\n @finv[n]\n end\n\n def permutation(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(n - r)\n end\n\n def combination(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(r) * finv(n - r)\n end\n\n def repeated_combination(n : Int, r : Int)\n (n < 0 || r < 0) ? T.zero : r == 0 ? T.new(1) : combination(n + r - 1, r)\n end\nend\n\n# reference : https://kopricky.github.io/code/FFTs/ntt.html\nclass NTT\n ROOT = 3\n\n private def self.ntt(a : Array(T), rev = false) forall T\n return a if a.size == 1\n b = Array.new(a.size, T.zero)\n r = T::MOD.pred // a.size\n r = T::MOD.pred - r if rev\n s = T.new(ROOT) ** r\n kp = Array.new(a.size // 2 + 1, T.new(1))\n (1...kp.size).each { |i| kp[i] = kp[i - 1] * s }\n\n i, l = 1, a.size // 2\n while i < a.size\n r = 0\n (0...l).each do |j|\n s = kp[i * j]\n (0...i).each do |k|\n p, q = a[k + r], a[k + r + a.size // 2]\n b[k + 2 * r] = p + q\n b[k + 2 * r + i] = (p - q) * s\n end\n r += i\n end\n a, b = b, a\n i <<= 1; l >>= 1\n end\n if rev\n s = T.new(a.size).inv\n a.map! { |x| x * s }\n end\n a\n end\n\n def self.convolution(a : Array(T), b : Array(T)) forall T\n size = a.size + b.size - 1\n t = Math.pw2ceil(size)\n aa = a + Array.new(t - a.size, T.zero)\n bb = b + Array.new(t - b.size, T.zero)\n c = ntt(aa).zip(ntt(bb)).map { |x, y| x * y }\n ntt(c, true).first(size)\n end\nend\n\nC = Combination(Mint).new(200000)\na, b, c, n = read_line.split.map(&.to_i)\nx, y, z = read_line.split.map(&.to_i)\n\nca = Array.new(a + 1, Mint.zero)\ncb = Array.new(b + 1, Mint.zero)\ncc = Array.new(c + 1, Mint.zero)\n(n - y..a).each { |i| ca[i] = C.combination(a, i) }\n(n - z..b).each { |i| cb[i] = C.combination(b, i) }\n(n - x..c).each { |i| cc[i] = C.combination(c, i) }\n\nab = NTT.convolution(ca, cb)\nputs (0..n).sum { |i|\n ab.fetch(i, Mint.zero) * cc.fetch(n - i, Mint.zero)\n}\n" }, { "id": 332, "name": "065", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long mod = 998244353;\n\nlong long fact[1 << 19], inv[1 << 19];\n\n\n\nlong long modpow(long long a, long long b, long long m) {\n\n\tlong long p = 1, q = a;\n\n\tfor (int i = 0; i < 32; i++) {\n\n\t\tif ((b & (1LL << i)) != 0LL) {\n\n\t\t\tp *= q; p %= m;\n\n\t\t}\n\n\t\tq *= q; q %= m;\n\n\t}\n\n\treturn p;\n\n}\n\n\n\nlong long Div(long long a, long long b, long long m) {\n\n\treturn (a * modpow(b, m - 2, m)) % m;\n\n}\n\n\n\nlong long ncr(long long n, long long r) {\n\n\tif (n < r || r < 0) return 0;\n\n\treturn (fact[n] * inv[r] % mod) * inv[n - r] % mod;\n\n}\n\n\n\nvoid init() {\n\n\tfact[0] = 1LL;\n\n\tfor (int i = 1; i <= 500000; i++) fact[i] = (1LL * i * fact[i - 1]) % mod;\n\n\tfor (int i = 0; i <= 500000; i++) inv[i] = Div(1, fact[i], mod);\n\n}\n\n\n\nlong long R, G, B, K;\n\nlong long X, Y, Z;\n\nlong long ar[1 << 19], ag[1 << 19], ab[1 << 19];\n\n\n\nint main() {\n\n\tinit();\n\n\n\n\t// Step #1. “ü—Í\n\n\tcin >> R >> G >> B >> K;\n\n\tcin >> X >> Y >> Z;\n\n\n\n\t// Step #2. ‘O�ˆ—�\n\n\tlong long R_left = K - Y, R_right = R;\n\n\tlong long G_left = K - Z, G_right = G;\n\n\tlong long B_left = K - X, B_right = B;\n\n\tfor (int i = 0; i <= R; i++) ar[i] = ncr(R, i);\n\n\tfor (int i = 0; i <= G; i++) ag[i] = ncr(G, i);\n\n\tfor (int i = 0; i <= B; i++) ab[i] = ncr(B, i);\n\n\n\n\t// Step #3. FFT\n\n\tvector p1(R + 1, 0), p2(G + 1, 0), p3;\n\n\tfor (int i = R_left; i <= R_right; i++) p1[i] = ar[i];\n\n\tfor (int i = G_left; i <= G_right; i++) p2[i] = ag[i];\n\n\tp3 = atcoder::convolution(p1, p2);\n\n\n\n\t// Step #4. “š‚¦‚ğ‹�‚ß‚é\n\n\tlong long Answer = 0;\n\n\tfor (int i = B_left; i <= B_right; i++) {\n\n\t\tlong long ret1 = 0, ret2 = ab[i];\n\n\t\tif (0 <= K - i && K - i <= (int)p3.size()) ret1 = p3[K - i];\n\n\t\tAnswer += ret1 * ret2;\n\n\t\tAnswer %= mod;\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Python": "mod = 998244353\ng = 3\nginv = 332748118\nW = [pow(g, (mod-1)>>i, mod) for i in range(24)]\nWinv = [pow(ginv, (mod-1)>>i, mod) for i in range(24)]\n\ndef fft(k,f):\n for l in range(k,0,-1):\n d = 1 << l - 1\n U = [1]\n for i in range(d):\n U.append(U[-1]*W[l]%mod)\n for i in range(1< n:\n return 0\n else: \n return fact[n]*finv[r]%mod*finv[n-r]%mod\nR = [0]*(k+1)\nG = [0]*(k+1)\n\nfor i in range(k+1):\n if k-y <= i <= r:\n R[i] = nCr(r,i,mod)\n if k-z <= i <= g:\n G[i] = nCr(g,i,mod)\n\nRG = convolution(R,G)\nans = 0\nfor i in range(k-x,min(b,k)+1):\n ans += nCr(b,i,mod)*RG[k-i]%mod\n ans %= mod\nprint(ans)" }, { "id": 333, "name": "065", "Crystal": "struct Mint\n MOD = 998244353i64\n\n def self.zero\n new\n end\n\n def self.raw(value : Int64)\n result = new\n result.value = value\n result\n end\n\n getter value : Int64\n\n def initialize\n @value = 0i64\n end\n\n def initialize(value)\n @value = value.to_i64 % MOD\n end\n\n def initialize(m : self)\n @value = m.value\n end\n\n protected def value=(value : Int64)\n @value = value\n end\n\n def ==(m : self)\n value == m.value\n end\n\n def ==(m)\n value == m\n end\n\n def + : self\n self\n end\n\n def - : self\n Mint.raw(value != 0 ? MOD - value : 0i64)\n end\n\n def +(v)\n self + Mint.new(v)\n end\n\n def +(m : self)\n x = value + m.value\n x -= MOD if x >= MOD\n Mint.raw(x)\n end\n\n def -(v)\n self - Mint.new(v)\n end\n\n def -(m : self)\n x = value - m.value\n x += MOD if x < 0\n Mint.raw(x)\n end\n\n def *(v)\n self * Mint.new(v)\n end\n\n def *(m : self)\n Mint.new(value * m.value)\n end\n\n def /(v)\n self / Mint.new(v)\n end\n\n def /(m : self)\n raise DivisionByZeroError.new if m.value == 0\n a, b, u, v = m.value, MOD, 1i64, 0i64\n while b != 0\n t = a // b\n a -= t * b\n a, b = b, a\n u -= t * v\n u, v = v, u\n end\n Mint.new(value * u)\n end\n\n def **(exponent : Int)\n t, x = self, Mint.raw(1i64)\n while exponent > 0\n x *= t if exponent & 1 == 1\n t *= t\n exponent >>= 1\n end\n x\n end\n\n def inv\n Mint.raw(1) / self\n end\n\n delegate to_s, to: @value\n delegate inspect, to: @value\nend\n\nclass Combination(T)\n def initialize(initial_capacity : Int = 1)\n initial_capacity += 1\n @size = 2\n @factorial = Array(T).new(initial_capacity)\n @factorial << T.new(1) << T.new(1)\n @inv = Array(T).new(initial_capacity)\n @inv << T.zero << T.new(1)\n @finv = Array(T).new(initial_capacity)\n @finv << T.new(1) << T.new(1)\n expand_until(initial_capacity)\n end\n\n private def expand_until(n : Int)\n while @size <= n\n @factorial << @factorial[-1] * @size\n @inv << -@inv[T::MOD % @size] * (T::MOD // @size)\n @finv << @finv[-1] * @inv[@size]\n @size += 1\n end\n end\n\n def factorial(n : Int)\n expand_until(n)\n @factorial[n]\n end\n\n def inv(n : Int)\n expand_until(n)\n @inv[n]\n end\n\n def finv(n : Int)\n expand_until(n)\n @finv[n]\n end\n\n def permutation(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(n - r)\n end\n\n def combination(n : Int, r : Int)\n (n < r || n < 0 || r < 0) ? T.zero : factorial(n) * finv(r) * finv(n - r)\n end\n\n def repeated_combination(n : Int, r : Int)\n (n < 0 || r < 0) ? T.zero : r == 0 ? T.new(1) : combination(n + r - 1, r)\n end\nend\n\n# reference : https://kopricky.github.io/code/FFTs/ntt.html\nclass NTT\n ROOT = 3\n\n private def self.ntt(a : Array(T), rev = false) forall T\n return a if a.size == 1\n b = Array.new(a.size, T.zero)\n r = T::MOD.pred // a.size\n r = T::MOD.pred - r if rev\n s = T.new(ROOT) ** r\n kp = Array.new(a.size // 2 + 1, T.new(1))\n (1...kp.size).each { |i| kp[i] = kp[i - 1] * s }\n\n i, l = 1, a.size // 2\n while i < a.size\n r = 0\n (0...l).each do |j|\n s = kp[i * j]\n (0...i).each do |k|\n p, q = a[k + r], a[k + r + a.size // 2]\n b[k + 2 * r] = p + q\n b[k + 2 * r + i] = (p - q) * s\n end\n r += i\n end\n a, b = b, a\n i <<= 1; l >>= 1\n end\n if rev\n s = T.new(a.size).inv\n a.map! { |x| x * s }\n end\n a\n end\n\n def self.convolution(a : Array(T), b : Array(T)) forall T\n size = a.size + b.size - 1\n t = Math.pw2ceil(size)\n aa = a + Array.new(t - a.size, T.zero)\n bb = b + Array.new(t - b.size, T.zero)\n c = ntt(aa).zip(ntt(bb)).map { |x, y| x * y }\n ntt(c, true).first(size)\n end\nend\n\nC = Combination(Mint).new(200000)\na, b, c, n = read_line.split.map(&.to_i)\nx, y, z = read_line.split.map(&.to_i)\n\nca = Array.new(a + 1, Mint.zero)\ncb = Array.new(b + 1, Mint.zero)\ncc = Array.new(c + 1, Mint.zero)\n(n - y..a).each { |i| ca[i] = C.combination(a, i) }\n(n - z..b).each { |i| cb[i] = C.combination(b, i) }\n(n - x..c).each { |i| cc[i] = C.combination(c, i) }\n\nab = NTT.convolution(ca, cb)\nputs (0..n).sum { |i|\n ab.fetch(i, Mint.zero) * cc.fetch(n - i, Mint.zero)\n}\n", "Python": "mod = 998244353\ng = 3\nginv = 332748118\nW = [pow(g, (mod-1)>>i, mod) for i in range(24)]\nWinv = [pow(ginv, (mod-1)>>i, mod) for i in range(24)]\n\ndef fft(k,f):\n for l in range(k,0,-1):\n d = 1 << l - 1\n U = [1]\n for i in range(d):\n U.append(U[-1]*W[l]%mod)\n for i in range(1< n:\n return 0\n else: \n return fact[n]*finv[r]%mod*finv[n-r]%mod\nR = [0]*(k+1)\nG = [0]*(k+1)\n\nfor i in range(k+1):\n if k-y <= i <= r:\n R[i] = nCr(r,i,mod)\n if k-z <= i <= g:\n G[i] = nCr(g,i,mod)\n\nRG = convolution(R,G)\nans = 0\nfor i in range(k-x,min(b,k)+1):\n ans += nCr(b,i,mod)*RG[k-i]%mod\n ans %= mod\nprint(ans)" }, { "id": 334, "name": "066", "C++": "// マージソートをベースにした O(N log N) 解法\n// 期待値が次のように言い換えられることを利用した：\n// 0-based, 各区間は [L[i], R[i]) に変換済み, range[i] := R[i] - L[i] として、\n// sum_{ 0 <= i < j < N, L[i] <= x < R[i], L[j] <= y < R[j], x > y} ( 1.0 / (range[i] * range[j]) )\n#include \nusing namespace std;\n\nusing P = pair;\nusing T = double;\nconst T two_inv = 1.0 / 2.0;\n\nint N;\nvector L, R;\nvector

val;\nvector range_inv;\nT res;\n\n// mergesort(left_id, right_id) では、上記 sum の内、left_id <= i < center_id <= j < right_id を満たすものを計算する\n// 計算方法： L, R をまとめたもの (val) を小さい順に見て、( val による区間内の y ) * ( ありうる x ) を計算している\nvoid mergesort(int left_id, int right_id){\n if(right_id - left_id == 1) return;\n int center_id = left_id + (right_id - left_id) / 2;\n mergesort(left_id, center_id);\n mergesort(center_id, right_id);\n vector

lval((center_id - left_id) * 2), rval((right_id - center_id) * 2);\n\n copy(val.begin() + left_id * 2, val.begin() + center_id * 2, lval.begin());\n lval.emplace_back(1<<30, 1<<30);\n copy(val.begin() + center_id * 2, val.begin() + right_id * 2, rval.begin());\n rval.emplace_back(1<<30, 1<<30);\n\n int i{}, j{}, k = left_id * 2, last = -1;\n T left_seg{}, right_seg{}, left_sum = center_id - left_id;\n while(k < right_id * 2){\n bool use_left = lval[i] < rval[j];\n val[k] = use_left ? lval[i] : rval[j];\n int d = val[k].first - last, id = val[k].second;\n if(d > 0) {\n // 幅 d の区間内に x, y があるパターン\n res += left_seg * right_seg * d * (d - 1) * two_inv;\n left_sum -= left_seg * d;\n // 幅 d の区間内に y, それより上に x があるパターン\n res += right_seg * d * left_sum;\n last += d;\n }\n (use_left ? left_seg : right_seg) += (id&1 ? - range_inv[id>>1] : range_inv[id>>1]);\n use_left ? ++i : ++j;\n ++k;\n }\n}\n\nint main() {\n cin>>N;\n L.resize(N); R.resize(N);\n range_inv.resize(N);\n for(int i = 0; i < N; ++i) {\n cin>>L[i]>>R[i];\n --L[i];\n range_inv[i] = (T)1 / (R[i] - L[i]);\n val.emplace_back(L[i], i * 2);\n val.emplace_back(R[i], i * 2 + 1);\n }\n mergesort(0, N);\n cout< y} ( 1.0 / (range[i] * range[j]) )\n#include \nusing namespace std;\n\nusing P = pair;\nusing T = double;\nconst T two_inv = 1.0 / 2.0;\n\nint N;\nvector L, R;\nvector

val;\nvector range_inv;\nT res;\n\n// mergesort(left_id, right_id) では、上記 sum の内、left_id <= i < center_id <= j < right_id を満たすものを計算する\n// 計算方法： L, R をまとめたもの (val) を小さい順に見て、( val による区間内の y ) * ( ありうる x ) を計算している\nvoid mergesort(int left_id, int right_id){\n if(right_id - left_id == 1) return;\n int center_id = left_id + (right_id - left_id) / 2;\n mergesort(left_id, center_id);\n mergesort(center_id, right_id);\n vector

lval((center_id - left_id) * 2), rval((right_id - center_id) * 2);\n\n copy(val.begin() + left_id * 2, val.begin() + center_id * 2, lval.begin());\n lval.emplace_back(1<<30, 1<<30);\n copy(val.begin() + center_id * 2, val.begin() + right_id * 2, rval.begin());\n rval.emplace_back(1<<30, 1<<30);\n\n int i{}, j{}, k = left_id * 2, last = -1;\n T left_seg{}, right_seg{}, left_sum = center_id - left_id;\n while(k < right_id * 2){\n bool use_left = lval[i] < rval[j];\n val[k] = use_left ? lval[i] : rval[j];\n int d = val[k].first - last, id = val[k].second;\n if(d > 0) {\n // 幅 d の区間内に x, y があるパターン\n res += left_seg * right_seg * d * (d - 1) * two_inv;\n left_sum -= left_seg * d;\n // 幅 d の区間内に y, それより上に x があるパターン\n res += right_seg * d * left_sum;\n last += d;\n }\n (use_left ? left_seg : right_seg) += (id&1 ? - range_inv[id>>1] : range_inv[id>>1]);\n use_left ? ++i : ++j;\n ++k;\n }\n}\n\nint main() {\n cin>>N;\n L.resize(N); R.resize(N);\n range_inv.resize(N);\n for(int i = 0; i < N; ++i) {\n cin>>L[i]>>R[i];\n --L[i];\n range_inv[i] = (T)1 / (R[i] - L[i]);\n val.emplace_back(L[i], i * 2);\n val.emplace_back(R[i], i * 2 + 1);\n }\n mergesort(0, N);\n cout< y} ( 1.0 / (range[i] * range[j]) )\n#include \nusing namespace std;\n\nusing P = pair;\nusing T = double;\nconst T two_inv = 1.0 / 2.0;\n\nint N;\nvector L, R;\nvector

val;\nvector range_inv;\nT res;\n\n// mergesort(left_id, right_id) では、上記 sum の内、left_id <= i < center_id <= j < right_id を満たすものを計算する\n// 計算方法： L, R をまとめたもの (val) を小さい順に見て、( val による区間内の y ) * ( ありうる x ) を計算している\nvoid mergesort(int left_id, int right_id){\n if(right_id - left_id == 1) return;\n int center_id = left_id + (right_id - left_id) / 2;\n mergesort(left_id, center_id);\n mergesort(center_id, right_id);\n vector

lval((center_id - left_id) * 2), rval((right_id - center_id) * 2);\n\n copy(val.begin() + left_id * 2, val.begin() + center_id * 2, lval.begin());\n lval.emplace_back(1<<30, 1<<30);\n copy(val.begin() + center_id * 2, val.begin() + right_id * 2, rval.begin());\n rval.emplace_back(1<<30, 1<<30);\n\n int i{}, j{}, k = left_id * 2, last = -1;\n T left_seg{}, right_seg{}, left_sum = center_id - left_id;\n while(k < right_id * 2){\n bool use_left = lval[i] < rval[j];\n val[k] = use_left ? lval[i] : rval[j];\n int d = val[k].first - last, id = val[k].second;\n if(d > 0) {\n // 幅 d の区間内に x, y があるパターン\n res += left_seg * right_seg * d * (d - 1) * two_inv;\n left_sum -= left_seg * d;\n // 幅 d の区間内に y, それより上に x があるパターン\n res += right_seg * d * left_sum;\n last += d;\n }\n (use_left ? left_seg : right_seg) += (id&1 ? - range_inv[id>>1] : range_inv[id>>1]);\n use_left ? ++i : ++j;\n ++k;\n }\n}\n\nint main() {\n cin>>N;\n L.resize(N); R.resize(N);\n range_inv.resize(N);\n for(int i = 0; i < N; ++i) {\n cin>>L[i]>>R[i];\n --L[i];\n range_inv[i] = (T)1 / (R[i] - L[i]);\n val.emplace_back(L[i], i * 2);\n val.emplace_back(R[i], i * 2 + 1);\n }\n mergesort(0, N);\n cout< y} ( 1.0 / (range[i] * range[j]) )\n#include \nusing namespace std;\n\nusing P = pair;\nusing T = double;\nconst T two_inv = 1.0 / 2.0;\n\nint N;\nvector L, R;\nvector

val;\nvector range_inv;\nT res;\n\n// mergesort(left_id, right_id) では、上記 sum の内、left_id <= i < center_id <= j < right_id を満たすものを計算する\n// 計算方法： L, R をまとめたもの (val) を小さい順に見て、( val による区間内の y ) * ( ありうる x ) を計算している\nvoid mergesort(int left_id, int right_id){\n if(right_id - left_id == 1) return;\n int center_id = left_id + (right_id - left_id) / 2;\n mergesort(left_id, center_id);\n mergesort(center_id, right_id);\n vector

lval((center_id - left_id) * 2), rval((right_id - center_id) * 2);\n\n copy(val.begin() + left_id * 2, val.begin() + center_id * 2, lval.begin());\n lval.emplace_back(1<<30, 1<<30);\n copy(val.begin() + center_id * 2, val.begin() + right_id * 2, rval.begin());\n rval.emplace_back(1<<30, 1<<30);\n\n int i{}, j{}, k = left_id * 2, last = -1;\n T left_seg{}, right_seg{}, left_sum = center_id - left_id;\n while(k < right_id * 2){\n bool use_left = lval[i] < rval[j];\n val[k] = use_left ? lval[i] : rval[j];\n int d = val[k].first - last, id = val[k].second;\n if(d > 0) {\n // 幅 d の区間内に x, y があるパターン\n res += left_seg * right_seg * d * (d - 1) * two_inv;\n left_sum -= left_seg * d;\n // 幅 d の区間内に y, それより上に x があるパターン\n res += right_seg * d * left_sum;\n last += d;\n }\n (use_left ? left_seg : right_seg) += (id&1 ? - range_inv[id>>1] : range_inv[id>>1]);\n use_left ? ++i : ++j;\n ++k;\n }\n}\n\nint main() {\n cin>>N;\n L.resize(N); R.resize(N);\n range_inv.resize(N);\n for(int i = 0; i < N; ++i) {\n cin>>L[i]>>R[i];\n --L[i];\n range_inv[i] = (T)1 / (R[i] - L[i]);\n val.emplace_back(L[i], i * 2);\n val.emplace_back(R[i], i * 2 + 1);\n }\n mergesort(0, N);\n cout< y} ( 1.0 / (range[i] * range[j]) )\n#include \nusing namespace std;\n\nusing P = pair;\nusing T = double;\nconst T two_inv = 1.0 / 2.0;\n\nint N;\nvector L, R;\nvector

val;\nvector range_inv;\nT res;\n\n// mergesort(left_id, right_id) では、上記 sum の内、left_id <= i < center_id <= j < right_id を満たすものを計算する\n// 計算方法： L, R をまとめたもの (val) を小さい順に見て、( val による区間内の y ) * ( ありうる x ) を計算している\nvoid mergesort(int left_id, int right_id){\n if(right_id - left_id == 1) return;\n int center_id = left_id + (right_id - left_id) / 2;\n mergesort(left_id, center_id);\n mergesort(center_id, right_id);\n vector

lval((center_id - left_id) * 2), rval((right_id - center_id) * 2);\n\n copy(val.begin() + left_id * 2, val.begin() + center_id * 2, lval.begin());\n lval.emplace_back(1<<30, 1<<30);\n copy(val.begin() + center_id * 2, val.begin() + right_id * 2, rval.begin());\n rval.emplace_back(1<<30, 1<<30);\n\n int i{}, j{}, k = left_id * 2, last = -1;\n T left_seg{}, right_seg{}, left_sum = center_id - left_id;\n while(k < right_id * 2){\n bool use_left = lval[i] < rval[j];\n val[k] = use_left ? lval[i] : rval[j];\n int d = val[k].first - last, id = val[k].second;\n if(d > 0) {\n // 幅 d の区間内に x, y があるパターン\n res += left_seg * right_seg * d * (d - 1) * two_inv;\n left_sum -= left_seg * d;\n // 幅 d の区間内に y, それより上に x があるパターン\n res += right_seg * d * left_sum;\n last += d;\n }\n (use_left ? left_seg : right_seg) += (id&1 ? - range_inv[id>>1] : range_inv[id>>1]);\n use_left ? ++i : ++j;\n ++k;\n }\n}\n\nint main() {\n cin>>N;\n L.resize(N); R.resize(N);\n range_inv.resize(N);\n for(int i = 0; i < N; ++i) {\n cin>>L[i]>>R[i];\n --L[i];\n range_inv[i] = (T)1 / (R[i] - L[i]);\n val.emplace_back(L[i], i * 2);\n val.emplace_back(R[i], i * 2 + 1);\n }\n mergesort(0, N);\n cout<\n\n#include \n\nusing namespace std;\n\nlong long base8_to_long(string N) {\n\n\tlong long res = 0;\n\n\tfor (int i = 0; i < N.size(); ++i) {\n\n\t\tres = res * 8 + int(N[i] - '0');\n\n\t}\n\n\treturn res;\n\n}\n\nstring long_to_base9(long long N) {\n\n\tif (N == 0) {\n\n\t\treturn \"0\";\n\n\t}\n\n\tstring res;\n\n\twhile (N > 0) {\n\n\t\tres = char(N % 9 + '0') + res;\n\n\t\tN /= 9;\n\n\t}\n\n\treturn res;\n\n}\n\nint main() {\n\n\tstring N; int K;\n\n\tcin >> N >> K;\n\n\tfor (int i = 0; i < K; ++i) {\n\n\t\tN = long_to_base9(base8_to_long(N));\n\n\t\tfor (int j = 0; j < N.size(); ++j) {\n\n\t\t\tif (N[j] == '8') {\n\n\t\t\t\tN[j] = '5';\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tcout << N << endl;\n\n\treturn 0;\n\n}", "Crystal": "n, k = read_line.split\nk.to_i.times do\n n = n.to_i64(8).to_s(9).gsub('8', '5')\nend\nputs n\n" }, { "id": 350, "name": "067", "C++": "#include \n\n#include \n\nusing namespace std;\n\nlong long base8_to_long(string N) {\n\n\tlong long res = 0;\n\n\tfor (int i = 0; i < N.size(); ++i) {\n\n\t\tres = res * 8 + int(N[i] - '0');\n\n\t}\n\n\treturn res;\n\n}\n\nstring long_to_base9(long long N) {\n\n\tif (N == 0) {\n\n\t\treturn \"0\";\n\n\t}\n\n\tstring res;\n\n\twhile (N > 0) {\n\n\t\tres = char(N % 9 + '0') + res;\n\n\t\tN /= 9;\n\n\t}\n\n\treturn res;\n\n}\n\nint main() {\n\n\tstring N; int K;\n\n\tcin >> N >> K;\n\n\tfor (int i = 0; i < K; ++i) {\n\n\t\tN = long_to_base9(base8_to_long(N));\n\n\t\tfor (int j = 0; j < N.size(); ++j) {\n\n\t\t\tif (N[j] == '8') {\n\n\t\t\t\tN[j] = '5';\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tcout << N << endl;\n\n\treturn 0;\n\n}", "Python": "def DeciamlToNine(num):\n \"10進数を9進数に変換する\"\n nine_number = \"\"\n while num > 0:\n nine_number += str(num % 9)\n num //= 9\n return int(nine_number[::-1])\n\nn, k = map(int,input().split()) # ８進数の数字と交換回数\nif n == 0:\n exit(print(0))\neight_number = n\nfor i in range(k):\n # 8進数を10進数に変換する\n a = int(str(eight_number), 8)\n\n # 10進数を9進数に変換する\n b = DeciamlToNine(a)\n\n # 変換した9進数の中に8があれば、5に直す\n c = \"\"\n for j in range(len(str(b))):\n if str(b)[j] == \"8\":\n c += \"5\"\n else:\n c += str(b)[j]\n \n # intに戻す\n c = int(c)\n eight_number = c\n\nprint(eight_number)" }, { "id": 351, "name": "067", "C++": "#include \n\n#include \n\nusing namespace std;\n\nlong long base8_to_long(string N) {\n\n\tlong long res = 0;\n\n\tfor (int i = 0; i < N.size(); ++i) {\n\n\t\tres = res * 8 + int(N[i] - '0');\n\n\t}\n\n\treturn res;\n\n}\n\nstring long_to_base9(long long N) {\n\n\tif (N == 0) {\n\n\t\treturn \"0\";\n\n\t}\n\n\tstring res;\n\n\twhile (N > 0) {\n\n\t\tres = char(N % 9 + '0') + res;\n\n\t\tN /= 9;\n\n\t}\n\n\treturn res;\n\n}\n\nint main() {\n\n\tstring N; int K;\n\n\tcin >> N >> K;\n\n\tfor (int i = 0; i < K; ++i) {\n\n\t\tN = long_to_base9(base8_to_long(N));\n\n\t\tfor (int j = 0; j < N.size(); ++j) {\n\n\t\t\tif (N[j] == '8') {\n\n\t\t\t\tN[j] = '5';\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tcout << N << endl;\n\n\treturn 0;\n\n}", "Ruby": "n, k = readline.chomp.split\nk.to_i.times do\n n = n.to_i(8).to_s(9).tr('8', '5')\nend\nputs n" }, { "id": 352, "name": "067", "C++": "#include \n\n#include \n\nusing namespace std;\n\nlong long base8_to_long(string N) {\n\n\tlong long res = 0;\n\n\tfor (int i = 0; i < N.size(); ++i) {\n\n\t\tres = res * 8 + int(N[i] - '0');\n\n\t}\n\n\treturn res;\n\n}\n\nstring long_to_base9(long long N) {\n\n\tif (N == 0) {\n\n\t\treturn \"0\";\n\n\t}\n\n\tstring res;\n\n\twhile (N > 0) {\n\n\t\tres = char(N % 9 + '0') + res;\n\n\t\tN /= 9;\n\n\t}\n\n\treturn res;\n\n}\n\nint main() {\n\n\tstring N; int K;\n\n\tcin >> N >> K;\n\n\tfor (int i = 0; i < K; ++i) {\n\n\t\tN = long_to_base9(base8_to_long(N));\n\n\t\tfor (int j = 0; j < N.size(); ++j) {\n\n\t\t\tif (N[j] == '8') {\n\n\t\t\t\tN[j] = '5';\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tcout << N << endl;\n\n\treturn 0;\n\n}", "Rust": "use proconio::{input,marker::Chars};\nfn main() {\n\tinput!{\n\t\t(n, k): (Chars, usize)\n\t}\n\tlet mut s = Vec::new();\n\tfor c in n.clone().into_iter().rev() {\n\t\ts.push(c.to_string().parse::().unwrap());\n\t}\n\tfor _ in 0..k {\n\t\tlet mut ans = 0;\n\t\tfor (i,d) in s.clone().into_iter().enumerate() {\n\t\t\tlet p:isize = 8_isize.pow(i as u32);\n\t\t\tans += d*p;\n\t\t}\n\t\ts = Vec::new();\n\t\twhile ans/9>0 {\n\t\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t\t\tans /= 9;\n\t\t}\n\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t}\n\ts.iter().rev().for_each(|i|print!(\"{}\",i));\n\tprintln!(\"\");\n}" }, { "id": 353, "name": "067", "Crystal": "n, k = read_line.split\nk.to_i.times do\n n = n.to_i64(8).to_s(9).gsub('8', '5')\nend\nputs n\n", "Python": "def DeciamlToNine(num):\n \"10進数を9進数に変換する\"\n nine_number = \"\"\n while num > 0:\n nine_number += str(num % 9)\n num //= 9\n return int(nine_number[::-1])\n\nn, k = map(int,input().split()) # ８進数の数字と交換回数\nif n == 0:\n exit(print(0))\neight_number = n\nfor i in range(k):\n # 8進数を10進数に変換する\n a = int(str(eight_number), 8)\n\n # 10進数を9進数に変換する\n b = DeciamlToNine(a)\n\n # 変換した9進数の中に8があれば、5に直す\n c = \"\"\n for j in range(len(str(b))):\n if str(b)[j] == \"8\":\n c += \"5\"\n else:\n c += str(b)[j]\n \n # intに戻す\n c = int(c)\n eight_number = c\n\nprint(eight_number)" }, { "id": 354, "name": "067", "Crystal": "n, k = read_line.split\nk.to_i.times do\n n = n.to_i64(8).to_s(9).gsub('8', '5')\nend\nputs n\n", "Ruby": "n, k = readline.chomp.split\nk.to_i.times do\n n = n.to_i(8).to_s(9).tr('8', '5')\nend\nputs n" }, { "id": 355, "name": "067", "Crystal": "n, k = read_line.split\nk.to_i.times do\n n = n.to_i64(8).to_s(9).gsub('8', '5')\nend\nputs n\n", "Rust": "use proconio::{input,marker::Chars};\nfn main() {\n\tinput!{\n\t\t(n, k): (Chars, usize)\n\t}\n\tlet mut s = Vec::new();\n\tfor c in n.clone().into_iter().rev() {\n\t\ts.push(c.to_string().parse::().unwrap());\n\t}\n\tfor _ in 0..k {\n\t\tlet mut ans = 0;\n\t\tfor (i,d) in s.clone().into_iter().enumerate() {\n\t\t\tlet p:isize = 8_isize.pow(i as u32);\n\t\t\tans += d*p;\n\t\t}\n\t\ts = Vec::new();\n\t\twhile ans/9>0 {\n\t\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t\t\tans /= 9;\n\t\t}\n\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t}\n\ts.iter().rev().for_each(|i|print!(\"{}\",i));\n\tprintln!(\"\");\n}" }, { "id": 356, "name": "067", "Python": "def DeciamlToNine(num):\n \"10進数を9進数に変換する\"\n nine_number = \"\"\n while num > 0:\n nine_number += str(num % 9)\n num //= 9\n return int(nine_number[::-1])\n\nn, k = map(int,input().split()) # ８進数の数字と交換回数\nif n == 0:\n exit(print(0))\neight_number = n\nfor i in range(k):\n # 8進数を10進数に変換する\n a = int(str(eight_number), 8)\n\n # 10進数を9進数に変換する\n b = DeciamlToNine(a)\n\n # 変換した9進数の中に8があれば、5に直す\n c = \"\"\n for j in range(len(str(b))):\n if str(b)[j] == \"8\":\n c += \"5\"\n else:\n c += str(b)[j]\n \n # intに戻す\n c = int(c)\n eight_number = c\n\nprint(eight_number)", "Ruby": "n, k = readline.chomp.split\nk.to_i.times do\n n = n.to_i(8).to_s(9).tr('8', '5')\nend\nputs n" }, { "id": 357, "name": "067", "Python": "def DeciamlToNine(num):\n \"10進数を9進数に変換する\"\n nine_number = \"\"\n while num > 0:\n nine_number += str(num % 9)\n num //= 9\n return int(nine_number[::-1])\n\nn, k = map(int,input().split()) # ８進数の数字と交換回数\nif n == 0:\n exit(print(0))\neight_number = n\nfor i in range(k):\n # 8進数を10進数に変換する\n a = int(str(eight_number), 8)\n\n # 10進数を9進数に変換する\n b = DeciamlToNine(a)\n\n # 変換した9進数の中に8があれば、5に直す\n c = \"\"\n for j in range(len(str(b))):\n if str(b)[j] == \"8\":\n c += \"5\"\n else:\n c += str(b)[j]\n \n # intに戻す\n c = int(c)\n eight_number = c\n\nprint(eight_number)", "Rust": "use proconio::{input,marker::Chars};\nfn main() {\n\tinput!{\n\t\t(n, k): (Chars, usize)\n\t}\n\tlet mut s = Vec::new();\n\tfor c in n.clone().into_iter().rev() {\n\t\ts.push(c.to_string().parse::().unwrap());\n\t}\n\tfor _ in 0..k {\n\t\tlet mut ans = 0;\n\t\tfor (i,d) in s.clone().into_iter().enumerate() {\n\t\t\tlet p:isize = 8_isize.pow(i as u32);\n\t\t\tans += d*p;\n\t\t}\n\t\ts = Vec::new();\n\t\twhile ans/9>0 {\n\t\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t\t\tans /= 9;\n\t\t}\n\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t}\n\ts.iter().rev().for_each(|i|print!(\"{}\",i));\n\tprintln!(\"\");\n}" }, { "id": 358, "name": "067", "Ruby": "n, k = readline.chomp.split\nk.to_i.times do\n n = n.to_i(8).to_s(9).tr('8', '5')\nend\nputs n", "Rust": "use proconio::{input,marker::Chars};\nfn main() {\n\tinput!{\n\t\t(n, k): (Chars, usize)\n\t}\n\tlet mut s = Vec::new();\n\tfor c in n.clone().into_iter().rev() {\n\t\ts.push(c.to_string().parse::().unwrap());\n\t}\n\tfor _ in 0..k {\n\t\tlet mut ans = 0;\n\t\tfor (i,d) in s.clone().into_iter().enumerate() {\n\t\t\tlet p:isize = 8_isize.pow(i as u32);\n\t\t\tans += d*p;\n\t\t}\n\t\ts = Vec::new();\n\t\twhile ans/9>0 {\n\t\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t\t\tans /= 9;\n\t\t}\n\t\ts.push(if ans%9==8 {5} else {ans%9});\n\t}\n\ts.iter().rev().for_each(|i|print!(\"{}\",i));\n\tprintln!(\"\");\n}" }, { "id": 359, "name": "068", "C++": "#include \nusing namespace std;\n#include \nusing namespace atcoder;\nusing ll=long long;\n#define MOD 998244353\nusing Graph=vector>;\n#define INF 1000000000\n#define MAX 300000\n\nvector parent;\nvector sign;\nvector V;\nint find(int x){\n int y=parent[x];\n if(y!=parent[y]){\n int pre_y=y;\n y=find(y);\n sign[x]=sign[pre_y]*sign[x]*(-1);\n V[x]=V[pre_y]+V[x]*(ll)sign[pre_y]*(-1);\n }\n return parent[x]=y;\n}\nvoid unite(int a,int b,ll v){\n int x=find(a);\n int y=find(b);\n if(x!=y){\n if(x==a&&b==y){\n sign[y]=1;\n V[y]=v;\n }else if(b==y){\n if(sign[a]==1){\n sign[b]=-1;\n V[b]=V[a]-v;\n }else{\n sign[b]=1;\n V[b]=V[a]+v;\n }\n }else if(x==a){\n if(sign[b]==1){\n sign[y]=-1;\n V[y]=v-V[b];\n }else{\n sign[y]=1;\n V[y]=v+V[b];\n }\n }else{\n if(sign[a]==1&&sign[b]==1){\n sign[y]=1;\n V[y]=V[a]-v+V[b];\n }else if(sign[a]==1&&sign[b]==-1){\n sign[y]=-1;\n V[y]=V[a]-v-V[b];\n }else if(sign[a]==-1&&sign[b]==1){\n sign[y]=-1;\n V[y]=V[a]+v-V[b];\n }else{\n sign[y]=1;\n V[y]=V[a]+v+V[b];\n }\n }\n parent[y]=x;\n }\n}\n\nint main(){\n int N,Q;\n cin>>N>>Q;\n parent.resize(N);\n sign.resize(N,0);\n V.resize(N);\n for(int i=0;i>t>>x>>y>>v;\n x--;y--;\n if(t==0){\n if(find(x)!=find(y)){\n if(x>y){\n swap(x,y);\n }\n unite(x,y,v);\n }\n }else{\n if(find(x)==find(y)){\n if(x==y){\n cout< true\n # dsu.size(4) # => 3\n # ```\n class DSU\n getter parents : Array(Int64)\n getter sizes : Array(Int64)\n getter size : Int64\n\n def initialize(@size)\n @parents = Array.new(size, &.to_i64)\n @sizes = Array.new(size, 1_i64)\n end\n\n # Implements atcoder::dsu.leader(node).\n def leader(node)\n until @parents[node] == node\n @parents[node] = @parents[@parents[node]]\n node = @parents[node]\n end\n node\n end\n\n # Implements atcoder::dsu.merge(a, b).\n def merge(a, b)\n leader_a = leader(a.to_i64)\n leader_b = leader(b.to_i64)\n unless leader_a == leader_b\n if @sizes[leader_a] < @sizes[leader_b]\n leader_a, leader_b = leader_b, leader_a\n end\n @parents[leader_b] = leader_a\n @sizes[leader_a] += @sizes[leader_b]\n end\n end\n\n # Implements atcoder::dsu.same(a, b).\n def same(a, b)\n leader(a) == leader(b)\n end\n\n # Implements atcoder::dsu.size().\n def size(node)\n @sizes[leader(node)]\n end\n\n # Implements atcoder::dsu.groups().\n # This method returns `Set` instead of list.\n def groups\n groups = Hash(Int64, Set(Int64)).new { |h, k| h[k] = Set(Int64).new }\n @size.times do |i|\n groups[leader(i)] << i\n end\n groups.values.to_set\n end\n end\nend\n\nn = read_line.to_i\nq = read_line.to_i\n\n# {x, y, v, ambiguous?}\nquery = [] of {Int32, Int32, Int64, Bool}\ndsu = AtCoder::DSU.new(n.to_i64)\nsum = Array(Int64?).new(n - 1, nil)\n\nq.times do\n t, x, y, v = read_line.split.map(&.to_i)\n x -= 1; y -= 1; v = v.to_i64\n if t == 0\n dsu.merge(x, y)\n sum[x] = v\n else\n query << {x, y, v, !dsu.same(x, y)}\n end\nend\n\na = [0i64] * n\n(0...n).each do |i|\n if i == 0 || sum[i - 1].nil?\n a[i] = 0i64\n else\n a[i] = sum[i - 1].not_nil! - a[i - 1]\n end\nend\n\nquery.each do |x, y, v, ambiguous|\n if ambiguous\n puts \"Ambiguous\"\n else\n diff = a[x] - v\n diff *= -1 if (y - x).odd?\n puts a[y] - diff\n end\nend\n" }, { "id": 360, "name": "068", "C++": "#include \nusing namespace std;\n#include \nusing namespace atcoder;\nusing ll=long long;\n#define MOD 998244353\nusing Graph=vector>;\n#define INF 1000000000\n#define MAX 300000\n\nvector parent;\nvector sign;\nvector V;\nint find(int x){\n int y=parent[x];\n if(y!=parent[y]){\n int pre_y=y;\n y=find(y);\n sign[x]=sign[pre_y]*sign[x]*(-1);\n V[x]=V[pre_y]+V[x]*(ll)sign[pre_y]*(-1);\n }\n return parent[x]=y;\n}\nvoid unite(int a,int b,ll v){\n int x=find(a);\n int y=find(b);\n if(x!=y){\n if(x==a&&b==y){\n sign[y]=1;\n V[y]=v;\n }else if(b==y){\n if(sign[a]==1){\n sign[b]=-1;\n V[b]=V[a]-v;\n }else{\n sign[b]=1;\n V[b]=V[a]+v;\n }\n }else if(x==a){\n if(sign[b]==1){\n sign[y]=-1;\n V[y]=v-V[b];\n }else{\n sign[y]=1;\n V[y]=v+V[b];\n }\n }else{\n if(sign[a]==1&&sign[b]==1){\n sign[y]=1;\n V[y]=V[a]-v+V[b];\n }else if(sign[a]==1&&sign[b]==-1){\n sign[y]=-1;\n V[y]=V[a]-v-V[b];\n }else if(sign[a]==-1&&sign[b]==1){\n sign[y]=-1;\n V[y]=V[a]+v-V[b];\n }else{\n sign[y]=1;\n V[y]=V[a]+v+V[b];\n }\n }\n parent[y]=x;\n }\n}\n\nint main(){\n int N,Q;\n cin>>N>>Q;\n parent.resize(N);\n sign.resize(N,0);\n V.resize(N);\n for(int i=0;i>t>>x>>y>>v;\n x--;y--;\n if(t==0){\n if(find(x)!=find(y)){\n if(x>y){\n swap(x,y);\n }\n unite(x,y,v);\n }\n }else{\n if(find(x)==find(y)){\n if(x==y){\n cout< 0)\n\t\t\tdo res :+ me.data[x]\n\t\t\tdo x :- (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\t\tret res\n\tend func\n\t\n\t; [l, r)\n\t+func query(l: int, r: int): int\n\t\tret me.sum(r - 1) - me.sum(l - 1)\n\tend func\nend class\n" }, { "id": 361, "name": "068", "Crystal": "# require \"atcoder/DSU\"\n# ac-library.cr by hakatashi https://github.com/google/ac-library.cr\n#\n# Copyright 2021 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# https://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nmodule AtCoder\n # Implements [atcoder::dsu](https://atcoder.github.io/ac-library/master/document_en/dsu.html).\n #\n # ```\n # dsu = AtCoder::DSU.new(10)\n # dsu.merge(0, 2)\n # dsu.merge(4, 2)\n # dsu.same(0, 4) # => true\n # dsu.size(4) # => 3\n # ```\n class DSU\n getter parents : Array(Int64)\n getter sizes : Array(Int64)\n getter size : Int64\n\n def initialize(@size)\n @parents = Array.new(size, &.to_i64)\n @sizes = Array.new(size, 1_i64)\n end\n\n # Implements atcoder::dsu.leader(node).\n def leader(node)\n until @parents[node] == node\n @parents[node] = @parents[@parents[node]]\n node = @parents[node]\n end\n node\n end\n\n # Implements atcoder::dsu.merge(a, b).\n def merge(a, b)\n leader_a = leader(a.to_i64)\n leader_b = leader(b.to_i64)\n unless leader_a == leader_b\n if @sizes[leader_a] < @sizes[leader_b]\n leader_a, leader_b = leader_b, leader_a\n end\n @parents[leader_b] = leader_a\n @sizes[leader_a] += @sizes[leader_b]\n end\n end\n\n # Implements atcoder::dsu.same(a, b).\n def same(a, b)\n leader(a) == leader(b)\n end\n\n # Implements atcoder::dsu.size().\n def size(node)\n @sizes[leader(node)]\n end\n\n # Implements atcoder::dsu.groups().\n # This method returns `Set` instead of list.\n def groups\n groups = Hash(Int64, Set(Int64)).new { |h, k| h[k] = Set(Int64).new }\n @size.times do |i|\n groups[leader(i)] << i\n end\n groups.values.to_set\n end\n end\nend\n\nn = read_line.to_i\nq = read_line.to_i\n\n# {x, y, v, ambiguous?}\nquery = [] of {Int32, Int32, Int64, Bool}\ndsu = AtCoder::DSU.new(n.to_i64)\nsum = Array(Int64?).new(n - 1, nil)\n\nq.times do\n t, x, y, v = read_line.split.map(&.to_i)\n x -= 1; y -= 1; v = v.to_i64\n if t == 0\n dsu.merge(x, y)\n sum[x] = v\n else\n query << {x, y, v, !dsu.same(x, y)}\n end\nend\n\na = [0i64] * n\n(0...n).each do |i|\n if i == 0 || sum[i - 1].nil?\n a[i] = 0i64\n else\n a[i] = sum[i - 1].not_nil! - a[i - 1]\n end\nend\n\nquery.each do |x, y, v, ambiguous|\n if ambiguous\n puts \"Ambiguous\"\n else\n diff = a[x] - v\n diff *= -1 if (y - x).odd?\n puts a[y] - diff\n end\nend\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar q: int :: cui@inputInt()\n\tvar f: []bool :: #[n]bool\n\tvar bitFlag: @Bit :: (#@Bit).init(n)\n\tvar bitEven: @Bit :: (#@Bit).init(n)\n\tvar bitOdd: @Bit :: (#@Bit).init(n)\n\tfor(1, q)\n\t\tvar t: int :: cui@inputInt()\n\t\tvar x: int :: cui@inputInt() - 1\n\t\tvar y: int :: cui@inputInt() - 1\n\t\tvar v: int :: cui@inputInt()\n\t\tif(t = 0)\n\t\t\tif(!f[x])\n\t\t\t\tdo f[x] :: true\n\t\t\t\tdo bitFlag.add(x, 1)\n\t\t\t\tif(x % 2 = 0)\n\t\t\t\t\tdo bitEven.add(x, v)\n\t\t\t\telse\n\t\t\t\t\tdo bitOdd.add(x, v)\n\t\t\t\tend if\n\t\t\tend if\n\t\telse\n\t\t\tif(x = y)\n\t\t\t\tdo cui@print(\"\\{v}\\n\")\n\t\t\telif(x < y)\n\t\t\t\tif(bitFlag.query(x, y) = y - x)\n\t\t\t\t\tvar ans: int :: 0\n\t\t\t\t\tif(y % 2 = 1)\n\t\t\t\t\t\tdo ans :+ bitEven.query(x, y) - bitOdd.query(x, y)\n\t\t\t\t\telse\n\t\t\t\t\t\tdo ans :- bitEven.query(x, y) - bitOdd.query(x, y)\n\t\t\t\t\tend if\n\t\t\t\t\tif((y - x) % 2 = 0)\n\t\t\t\t\t\tdo ans :+ v\n\t\t\t\t\telse\n\t\t\t\t\t\tdo ans :- v\n\t\t\t\t\tend if\n\t\t\t\t\tdo cui@print(\"\\{ans}\\n\")\n\t\t\t\telse\n\t\t\t\t\tdo cui@print(\"Ambiguous\\n\")\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tif(bitFlag.query(y, x) = x - y)\n\t\t\t\t\tvar ans: int :: 0\n\t\t\t\t\tif(y % 2 = 1)\n\t\t\t\t\t\tdo ans :+ bitEven.query(x, y) - bitOdd.query(x, y)\n\t\t\t\t\telse\n\t\t\t\t\t\tdo ans :- bitEven.query(x, y) - bitOdd.query(x, y)\n\t\t\t\t\tend if\n\t\t\t\t\tif((y - x) % 2 = 0)\n\t\t\t\t\t\tdo ans :+ v\n\t\t\t\t\telse\n\t\t\t\t\t\tdo ans :- v\n\t\t\t\t\tend if\n\t\t\t\t\tdo cui@print(\"\\{ans}\\n\")\n\t\t\t\telse\n\t\t\t\t\tdo cui@print(\"Ambiguous\\n\")\n\t\t\t\tend if\n\t\t\tend if\n\t\tend if\n\tend for\nend func\n\nclass Bit()\n\tvar n: int\n\tvar data: []int\n\t+func init(n: int): Bit\n\t\tdo me.n :: n\n\t\tdo me.data :: #[n + 1]int\n\t\tret me\n\tend func\n\t+func add(i: int, v: int)\n\t\tvar x: int :: i + 1\n\t\twhile(x <= me.n)\n\t\t\tdo me.data[x] :+ v\n\t\t\tdo x :+ (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\tend func\n\t+func sum(i: int): int\n\t\tvar x: int :: i + 1\n\t\tvar res: int :: 0\n\t\twhile(x > 0)\n\t\t\tdo res :+ me.data[x]\n\t\t\tdo x :- (x $ bit64).and(((-x) $ bit64)) $ int\n\t\tend while\n\t\tret res\n\tend func\n\t\n\t; [l, r)\n\t+func query(l: int, r: int): int\n\t\tret me.sum(r - 1) - me.sum(l - 1)\n\tend func\nend class\n" }, { "id": 362, "name": "069", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nint binpower(int a, long long b) {\n\n\tint ans = 1;\n\n\twhile (b != 0) {\n\n\t\tif (b % 2 == 1) {\n\n\t\t\tans = (long long)(ans)*a % mod;\n\n\t\t}\n\n\t\ta = (long long)(a)*a % mod;\n\n\t\tb /= 2;\n\n\t}\n\n\treturn ans;\n\n}\n\nint main() {\n\n\tlong long N; int K;\n\n\tcin >> N >> K;\n\n\tif (K == 1) {\n\n\t\tcout << (N == 1 ? 1 : 0) << endl;\n\n\t}\n\n\telse if (N == 1) {\n\n\t\tcout << K % mod << endl;\n\n\t}\n\n\telse if (N == 2) {\n\n\t\tcout << (long long)(K) * (K - 1) % mod << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << (long long)(K) * (K - 1) % mod * binpower(K - 2, N - 2) % mod << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "struct Int\n def pow(exp : Int, mod : Int)\n t, result = self, typeof(self).new(1)\n while exp > 0\n result = result * t % MOD if exp.odd?\n t = t * t % MOD\n exp >>= 1\n end\n result\n end\nend\n\nMOD = 10**9 + 7\nn, k = read_line.split.map(&.to_i64)\nans = k\nif n >= 2\n ans = ans * (k - 1) % MOD\n ans = ans * (k - 2).pow(n - 2, MOD) % MOD\nend\nputs ans\n" }, { "id": 363, "name": "069", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nint binpower(int a, long long b) {\n\n\tint ans = 1;\n\n\twhile (b != 0) {\n\n\t\tif (b % 2 == 1) {\n\n\t\t\tans = (long long)(ans)*a % mod;\n\n\t\t}\n\n\t\ta = (long long)(a)*a % mod;\n\n\t\tb /= 2;\n\n\t}\n\n\treturn ans;\n\n}\n\nint main() {\n\n\tlong long N; int K;\n\n\tcin >> N >> K;\n\n\tif (K == 1) {\n\n\t\tcout << (N == 1 ? 1 : 0) << endl;\n\n\t}\n\n\telse if (N == 1) {\n\n\t\tcout << K % mod << endl;\n\n\t}\n\n\telse if (N == 2) {\n\n\t\tcout << (long long)(K) * (K - 1) % mod << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << (long long)(K) * (K - 1) % mod * binpower(K - 2, N - 2) % mod << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tconst mod: int :: 1000000007\n\tvar ans: int :: 0\n\t\n\tswitch(n)\n\tcase 1\n\t\tdo ans :: k\n\tcase 2\n\t\tif(k < 2)\n\t\t\tdo ans :: 0\n\t\telse\n\t\t\tdo ans :: k * (k - 1) % mod\n\t\tend if\n\tdefault\n\t\tif(k < 3)\n\t\t\tdo ans :: 0\n\t\telse\n\t\t\tdo ans :: k * (k - 1) % mod * (math@modPow(k - 2, n - 2, mod) % mod) % mod\n\t\tend if\n\tend switch\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 364, "name": "069", "Crystal": "struct Int\n def pow(exp : Int, mod : Int)\n t, result = self, typeof(self).new(1)\n while exp > 0\n result = result * t % MOD if exp.odd?\n t = t * t % MOD\n exp >>= 1\n end\n result\n end\nend\n\nMOD = 10**9 + 7\nn, k = read_line.split.map(&.to_i64)\nans = k\nif n >= 2\n ans = ans * (k - 1) % MOD\n ans = ans * (k - 2).pow(n - 2, MOD) % MOD\nend\nputs ans\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar k: int :: cui@inputInt()\n\t\n\tconst mod: int :: 1000000007\n\tvar ans: int :: 0\n\t\n\tswitch(n)\n\tcase 1\n\t\tdo ans :: k\n\tcase 2\n\t\tif(k < 2)\n\t\t\tdo ans :: 0\n\t\telse\n\t\t\tdo ans :: k * (k - 1) % mod\n\t\tend if\n\tdefault\n\t\tif(k < 3)\n\t\t\tdo ans :: 0\n\t\telse\n\t\t\tdo ans :: k * (k - 1) % mod * (math@modPow(k - 2, n - 2, mod) % mod) % mod\n\t\tend if\n\tend switch\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 365, "name": "070", "C++": "#include \n\n#include \n\n#include \n\n\n\n#define rep(i,n) for(int i=0;i < (n);i++)\n\n#define rep2(i, s, n) for (int i = (s); i < (n); i++)\n\n#define rrep(i,n) for(int i=n-1;i>=0;i--)\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(),(a).end()\n\n\n\ntypedef long long ll;\n\n\n\nconst ll MOD=1000000007ll;\n\nconst int MAX=5100000;\n\n\n\nusing namespace std;\n\nusing namespace atcoder;\n\nusing mint = modint1000000007;\n\n\n\n// aよりもbが大きいならばaをbで更新する\n\n// (更新されたならばtrueを返す)\n\ntemplate \n\nbool chmax(T &a, const T& b) {\n\n if (a < b) {\n\n a = b; // aをbで更新\n\n return true;\n\n }\n\n return false;\n\n}\n\n// aよりもbが小さいならばaをbで更新する\n\n// (更新されたならばtrueを返す)\n\ntemplate \n\nbool chmin(T &a, const T& b) {\n\n if (a > b) {\n\n a = b; // aをbで更新\n\n return true;\n\n }\n\n return false;\n\n}\n\n\n\nll i,j,k;\n\n\n\nint main()\n\n{\n\n\tcin.tie(0);\tios::sync_with_stdio(false);\n\n\tll N; cin >> N;\n\n\tvector X(N), Y(N);\n\n\trep(i, N){cin >> X.at(i) >> Y.at(i);}\n\n\tsort(ALL(X));\n\n\tsort(ALL(Y));\n\n\n\n\t// xとyで個別に計算\n\n\t// x座標の候補：X[0]～X[N-1]のN通り\n\n\tll ansx, ansy, tmpx, tmpy;\n\n\ttmpx = 0; tmpy = 0;\n\n\t// a=X[0]としたときの不便さを計算\n\n\trep(i, N){tmpx += X[i] - X[0]; tmpy += Y[i] - Y[0];}\n\n\tansx = tmpx; ansy = tmpy;\n\n\t// i=1からN-1まで、差分更新しながら計算\n\n\tfor(i=1; i\n\n#include \n\n#include \n\n\n\n#define rep(i,n) for(int i=0;i < (n);i++)\n\n#define rep2(i, s, n) for (int i = (s); i < (n); i++)\n\n#define rrep(i,n) for(int i=n-1;i>=0;i--)\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(),(a).end()\n\n\n\ntypedef long long ll;\n\n\n\nconst ll MOD=1000000007ll;\n\nconst int MAX=5100000;\n\n\n\nusing namespace std;\n\nusing namespace atcoder;\n\nusing mint = modint1000000007;\n\n\n\n// aよりもbが大きいならばaをbで更新する\n\n// (更新されたならばtrueを返す)\n\ntemplate \n\nbool chmax(T &a, const T& b) {\n\n if (a < b) {\n\n a = b; // aをbで更新\n\n return true;\n\n }\n\n return false;\n\n}\n\n// aよりもbが小さいならばaをbで更新する\n\n// (更新されたならばtrueを返す)\n\ntemplate \n\nbool chmin(T &a, const T& b) {\n\n if (a > b) {\n\n a = b; // aをbで更新\n\n return true;\n\n }\n\n return false;\n\n}\n\n\n\nll i,j,k;\n\n\n\nint main()\n\n{\n\n\tcin.tie(0);\tios::sync_with_stdio(false);\n\n\tll N; cin >> N;\n\n\tvector X(N), Y(N);\n\n\trep(i, N){cin >> X.at(i) >> Y.at(i);}\n\n\tsort(ALL(X));\n\n\tsort(ALL(Y));\n\n\n\n\t// xとyで個別に計算\n\n\t// x座標の候補：X[0]～X[N-1]のN通り\n\n\tll ansx, ansy, tmpx, tmpy;\n\n\ttmpx = 0; tmpy = 0;\n\n\t// a=X[0]としたときの不便さを計算\n\n\trep(i, N){tmpx += X[i] - X[0]; tmpy += Y[i] - Y[0];}\n\n\tansx = tmpx; ansy = tmpy;\n\n\t// i=1からN-1まで、差分更新しながら計算\n\n\tfor(i=1; i return left all\nlistを変数で受け取るとき、必ずlistをTrueにすること。\n\"\"\"\n\ndef main():\n N=pin(1)\n X=[]\n Y=[]\n for _ in[0]*N:\n x,y=pin(2)\n X.append(x)\n Y.append(y)\n X.sort()\n Y.sort()\n ac=-10**9-10\n wa=10**9+10\n #3分探索\n ansx=float(\"inf\")\n searchX=lambda c:sum(abs(c-i)for i in X)\n for _ in[0]*100:\n #print(ac,wa)\n midx1=(2*ac+wa)//3\n midx2=(ac+2*wa)//3\n d1=searchX(midx1)\n d2=searchX(midx2)\n if d1searchX(wa):\n ansx=wa\n if searchX(wa)>searchX((ac+wa)//2):\n ansx=(wa+ac)//2\n #print(ansx)\n ac=-10**9-10\n wa=10**+10\n searchY=lambda c:sum(abs(c-i)for i in Y)\n for _ in[0]*100:\n #print(ac,wa)\n midy1=(2*ac+wa)//3\n midy2=(ac+2*wa)//3\n d1=searchY(midy1)\n d2=searchY(midy2)\n if d1searchY(wa):\n ansy=wa\n if searchY(wa)>searchY((ac+wa)//2):\n ansy=(wa+ac)//2\n #print(ansy)\n print(searchX(ansx)+searchY(ansy))\n return\n\nmain()\n\n " }, { "id": 367, "name": "070", "C++": "#include \n\n#include \n\n#include \n\n\n\n#define rep(i,n) for(int i=0;i < (n);i++)\n\n#define rep2(i, s, n) for (int i = (s); i < (n); i++)\n\n#define rrep(i,n) for(int i=n-1;i>=0;i--)\n\n#define ff first\n\n#define ss second\n\n#define pb push_back\n\n#define ALL(a) (a).begin(),(a).end()\n\n\n\ntypedef long long ll;\n\n\n\nconst ll MOD=1000000007ll;\n\nconst int MAX=5100000;\n\n\n\nusing namespace std;\n\nusing namespace atcoder;\n\nusing mint = modint1000000007;\n\n\n\n// aよりもbが大きいならばaをbで更新する\n\n// (更新されたならばtrueを返す)\n\ntemplate \n\nbool chmax(T &a, const T& b) {\n\n if (a < b) {\n\n a = b; // aをbで更新\n\n return true;\n\n }\n\n return false;\n\n}\n\n// aよりもbが小さいならばaをbで更新する\n\n// (更新されたならばtrueを返す)\n\ntemplate \n\nbool chmin(T &a, const T& b) {\n\n if (a > b) {\n\n a = b; // aをbで更新\n\n return true;\n\n }\n\n return false;\n\n}\n\n\n\nll i,j,k;\n\n\n\nint main()\n\n{\n\n\tcin.tie(0);\tios::sync_with_stdio(false);\n\n\tll N; cin >> N;\n\n\tvector X(N), Y(N);\n\n\trep(i, N){cin >> X.at(i) >> Y.at(i);}\n\n\tsort(ALL(X));\n\n\tsort(ALL(Y));\n\n\n\n\t// xとyで個別に計算\n\n\t// x座標の候補：X[0]～X[N-1]のN通り\n\n\tll ansx, ansy, tmpx, tmpy;\n\n\ttmpx = 0; tmpy = 0;\n\n\t// a=X[0]としたときの不便さを計算\n\n\trep(i, N){tmpx += X[i] - X[0]; tmpy += Y[i] - Y[0];}\n\n\tansx = tmpx; ansy = tmpy;\n\n\t// i=1からN-1まで、差分更新しながら計算\n\n\tfor(i=1; i return left all\nlistを変数で受け取るとき、必ずlistをTrueにすること。\n\"\"\"\n\ndef main():\n N=pin(1)\n X=[]\n Y=[]\n for _ in[0]*N:\n x,y=pin(2)\n X.append(x)\n Y.append(y)\n X.sort()\n Y.sort()\n ac=-10**9-10\n wa=10**9+10\n #3分探索\n ansx=float(\"inf\")\n searchX=lambda c:sum(abs(c-i)for i in X)\n for _ in[0]*100:\n #print(ac,wa)\n midx1=(2*ac+wa)//3\n midx2=(ac+2*wa)//3\n d1=searchX(midx1)\n d2=searchX(midx2)\n if d1searchX(wa):\n ansx=wa\n if searchX(wa)>searchX((ac+wa)//2):\n ansx=(wa+ac)//2\n #print(ansx)\n ac=-10**9-10\n wa=10**+10\n searchY=lambda c:sum(abs(c-i)for i in Y)\n for _ in[0]*100:\n #print(ac,wa)\n midy1=(2*ac+wa)//3\n midy2=(ac+2*wa)//3\n d1=searchY(midy1)\n d2=searchY(midy2)\n if d1searchY(wa):\n ansy=wa\n if searchY(wa)>searchY((ac+wa)//2):\n ansy=(wa+ac)//2\n #print(ansy)\n print(searchX(ansx)+searchY(ansy))\n return\n\nmain()\n\n " }, { "id": 369, "name": "070", "Crystal": "n = read_line.to_i\nputs (1..n).map {\n read_line.split.map(&.to_i64)\n}.transpose.sum { |a|\n x = a.sort[n // 2]\n a.sum { |y| (x - y).abs }\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar x: []int :: #[n]int\n\tvar y: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputInt()\n\t\tdo y[i] :: cui@inputInt()\n\tend for\n\tdo x.sort()\n\tdo y.sort()\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tdo ans :+ (x[i] - x[n / 2]).abs()\n\t\tdo ans :+ (y[i] - y[n / 2]).abs()\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 370, "name": "070", "Python": "class INPUT:\n def __init__(self):\n self._l=open(0).read().split()\n self._length=len(self._l)\n self._index=0\n return\n\n def stream(self,k=1,f=int,f2=False):\n assert(-1 return left all\nlistを変数で受け取るとき、必ずlistをTrueにすること。\n\"\"\"\n\ndef main():\n N=pin(1)\n X=[]\n Y=[]\n for _ in[0]*N:\n x,y=pin(2)\n X.append(x)\n Y.append(y)\n X.sort()\n Y.sort()\n ac=-10**9-10\n wa=10**9+10\n #3分探索\n ansx=float(\"inf\")\n searchX=lambda c:sum(abs(c-i)for i in X)\n for _ in[0]*100:\n #print(ac,wa)\n midx1=(2*ac+wa)//3\n midx2=(ac+2*wa)//3\n d1=searchX(midx1)\n d2=searchX(midx2)\n if d1searchX(wa):\n ansx=wa\n if searchX(wa)>searchX((ac+wa)//2):\n ansx=(wa+ac)//2\n #print(ansx)\n ac=-10**9-10\n wa=10**+10\n searchY=lambda c:sum(abs(c-i)for i in Y)\n for _ in[0]*100:\n #print(ac,wa)\n midy1=(2*ac+wa)//3\n midy2=(ac+2*wa)//3\n d1=searchY(midy1)\n d2=searchY(midy2)\n if d1searchY(wa):\n ansy=wa\n if searchY(wa)>searchY((ac+wa)//2):\n ansy=(wa+ac)//2\n #print(ansy)\n print(searchX(ansx)+searchY(ansy))\n return\n\nmain()\n\n ", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar x: []int :: #[n]int\n\tvar y: []int :: #[n]int\n\tfor i(0, n - 1)\n\t\tdo x[i] :: cui@inputInt()\n\t\tdo y[i] :: cui@inputInt()\n\tend for\n\tdo x.sort()\n\tdo y.sort()\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tdo ans :+ (x[i] - x[n / 2]).abs()\n\t\tdo ans :+ (y[i] - y[n / 2]).abs()\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 371, "name": "071", "Python": "N,M,K = map(int,input().split())\nE = [[] for i in range(N)]\ninIdx = [0] * N\nfor i in range(M):\n a,b = map(int,input().split())\n a -= 1\n b -= 1\n E[a].append(b)\n inIdx[b] += 1\n\ntopological_que = []\nrecursive_stack = []\nfor i in range(N):\n if inIdx[i] == 0:\n topological_que += [i]\nrecursive_stack.append([0,len(topological_que)])\ntopological_que += [0] * (N - len(topological_que))\n\nans = []\nwhile len(recursive_stack) != 0:\n i = len(recursive_stack) - 1\n st = recursive_stack[-1]\n if i == N:\n ans.append([x for x in topological_que])\n recursive_stack.pop()\n if len(recursive_stack) != 0:\n prei = i-1\n pres = recursive_stack[-1]\n for e in E[topological_que[prei]]: inIdx[e] += 1\n topological_que[prei],topological_que[pres[0]] = topological_que[pres[0]],topological_que[prei]\n recursive_stack[-1][0] += 1\n continue\n if st[1] == i:\n # no valid answer\n break\n if st[0] >= st[1]:\n recursive_stack.pop()\n if len(recursive_stack) != 0:\n prei = i-1\n pres = recursive_stack[-1]\n for e in E[topological_que[prei]]: inIdx[e] += 1\n topological_que[prei],topological_que[pres[0]] = topological_que[pres[0]],topological_que[prei]\n pres[0] += 1\n continue\n if len(ans) == K:\n break\n\n pres = recursive_stack[-1]\n que_back = pres[1]\n topological_que[i] , topological_que[pres[0]] = topological_que[pres[0]] , topological_que[i]\n p = topological_que[i]\n for e in E[p]:\n inIdx[e] -= 1\n if inIdx[e] == 0:\n topological_que[que_back] = e\n que_back += 1\n recursive_stack.append([ i+1,que_back ])\n\nif len(ans) != K:\n print(-1)\nelse:\n print(\"\\n\".join([\" \".join([str(x+1) for x in a]) for a in ans]))\n", "C++": "// Time Complexity: O((N + M + K) * K)\n\n\n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, M, K;\n\n\tcin >> N >> M >> K;\n\n\tvector > G(N);\n\n\tvector deg(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tint a, b;\n\n\t\tcin >> a >> b; --a, --b;\n\n\t\tG[a].push_back(b);\n\n\t\t++deg[b];\n\n\t}\n\n\tvector st;\n\n\tvector perm(N, -1);\n\n\tvector > answer_list;\n\n\tfunction dfs = [&](int depth) {\n\n\t\tif (depth == N) {\n\n\t\t\tanswer_list.push_back(perm);\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tif (st.empty()) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tfor (int i = int(st.size()) - 1; i >= 0; --i) {\n\n\t\t\tif (answer_list.size() == K) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t\tint x = st[i];\n\n\t\t\tst.erase(st.begin() + i);\n\n\t\t\tfor (int j : G[x]) {\n\n\t\t\t\t--deg[j];\n\n\t\t\t\tif (deg[j] == 0) {\n\n\t\t\t\t\tst.push_back(j);\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tperm[depth] = x;\n\n\t\t\tbool sign = dfs(depth + 1);\n\n\t\t\tif (!sign) {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t\tfor (int j : G[x]) {\n\n\t\t\t\tif (deg[j] == 0) {\n\n\t\t\t\t\tst.pop_back();\n\n\t\t\t\t}\n\n\t\t\t\t++deg[j];\n\n\t\t\t}\n\n\t\t\tst.insert(st.begin() + i, x);\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tif (deg[i] == 0) {\n\n\t\t\tst.push_back(i);\n\n\t\t}\n\n\t}\n\n\tdfs(0);\n\n\tif (answer_list.size() != K) {\n\n\t\tcout << -1 << endl;\n\n\t}\n\n\telse {\n\n\t\tfor (vector v : answer_list) {\n\n\t\t\tfor (int i = 0; i < N; ++i) {\n\n\t\t\t\tif (i != 0) cout << ' ';\n\n\t\t\t\tcout << v[i] + 1;\n\n\t\t\t}\n\n\t\t\tcout << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}" }, { "id": 372, "name": "071", "Python": "N,M,K = map(int,input().split())\nE = [[] for i in range(N)]\ninIdx = [0] * N\nfor i in range(M):\n a,b = map(int,input().split())\n a -= 1\n b -= 1\n E[a].append(b)\n inIdx[b] += 1\n\ntopological_que = []\nrecursive_stack = []\nfor i in range(N):\n if inIdx[i] == 0:\n topological_que += [i]\nrecursive_stack.append([0,len(topological_que)])\ntopological_que += [0] * (N - len(topological_que))\n\nans = []\nwhile len(recursive_stack) != 0:\n i = len(recursive_stack) - 1\n st = recursive_stack[-1]\n if i == N:\n ans.append([x for x in topological_que])\n recursive_stack.pop()\n if len(recursive_stack) != 0:\n prei = i-1\n pres = recursive_stack[-1]\n for e in E[topological_que[prei]]: inIdx[e] += 1\n topological_que[prei],topological_que[pres[0]] = topological_que[pres[0]],topological_que[prei]\n recursive_stack[-1][0] += 1\n continue\n if st[1] == i:\n # no valid answer\n break\n if st[0] >= st[1]:\n recursive_stack.pop()\n if len(recursive_stack) != 0:\n prei = i-1\n pres = recursive_stack[-1]\n for e in E[topological_que[prei]]: inIdx[e] += 1\n topological_que[prei],topological_que[pres[0]] = topological_que[pres[0]],topological_que[prei]\n pres[0] += 1\n continue\n if len(ans) == K:\n break\n\n pres = recursive_stack[-1]\n que_back = pres[1]\n topological_que[i] , topological_que[pres[0]] = topological_que[pres[0]] , topological_que[i]\n p = topological_que[i]\n for e in E[p]:\n inIdx[e] -= 1\n if inIdx[e] == 0:\n topological_que[que_back] = e\n que_back += 1\n recursive_stack.append([ i+1,que_back ])\n\nif len(ans) != K:\n print(-1)\nelse:\n print(\"\\n\".join([\" \".join([str(x+1) for x in a]) for a in ans]))\n", "Crystal": "class Solve\n getter n : Int32, m : Int32, k : Int32\n\n def initialize\n @n, @m, @k = read_line.split.map(&.to_i)\n @graph = Array(Array(Int32)).new(n) { [] of Int32 }\n @deg = Array(Int32).new(n, 0)\n m.times do\n a, b = read_line.split.map(&.to_i.pred)\n @graph[a] << b\n @deg[b] += 1\n end\n @ans = [] of Array(Int32)\n @perm = [] of Int32\n @stack = [] of Int32\n end\n\n def run\n @stack = (0...n).select { |i| @deg[i] == 0 }\n dfs\n puts -1\n end\n\n def dfs\n if @perm.size == n\n @ans << @perm.dup\n if @ans.size == k\n @ans.each { |t| puts t.join(' ', &.succ) }\n exit\n end\n return\n elsif @stack.size == 0\n puts -1\n exit\n end\n\n (0...@stack.size).reverse_each do |i|\n v = @stack.delete_at(i)\n @perm << v\n @graph[v].each do |u|\n @deg[u] -= 1\n @stack << u if @deg[u] == 0\n end\n\n dfs\n\n @graph[v].each do |u|\n @stack.pop if @deg[u] == 0\n @deg[u] += 1\n end\n @perm.pop\n @stack.insert(i, v)\n end\n end\nend\n\nSolve.new.run\n" }, { "id": 373, "name": "071", "C++": "// Time Complexity: O((N + M + K) * K)\n\n\n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tcin.tie(0);\n\n\tios_base::sync_with_stdio(false);\n\n\tint N, M, K;\n\n\tcin >> N >> M >> K;\n\n\tvector > G(N);\n\n\tvector deg(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tint a, b;\n\n\t\tcin >> a >> b; --a, --b;\n\n\t\tG[a].push_back(b);\n\n\t\t++deg[b];\n\n\t}\n\n\tvector st;\n\n\tvector perm(N, -1);\n\n\tvector > answer_list;\n\n\tfunction dfs = [&](int depth) {\n\n\t\tif (depth == N) {\n\n\t\t\tanswer_list.push_back(perm);\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\tif (st.empty()) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tfor (int i = int(st.size()) - 1; i >= 0; --i) {\n\n\t\t\tif (answer_list.size() == K) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t\tint x = st[i];\n\n\t\t\tst.erase(st.begin() + i);\n\n\t\t\tfor (int j : G[x]) {\n\n\t\t\t\t--deg[j];\n\n\t\t\t\tif (deg[j] == 0) {\n\n\t\t\t\t\tst.push_back(j);\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tperm[depth] = x;\n\n\t\t\tbool sign = dfs(depth + 1);\n\n\t\t\tif (!sign) {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t\tfor (int j : G[x]) {\n\n\t\t\t\tif (deg[j] == 0) {\n\n\t\t\t\t\tst.pop_back();\n\n\t\t\t\t}\n\n\t\t\t\t++deg[j];\n\n\t\t\t}\n\n\t\t\tst.insert(st.begin() + i, x);\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tif (deg[i] == 0) {\n\n\t\t\tst.push_back(i);\n\n\t\t}\n\n\t}\n\n\tdfs(0);\n\n\tif (answer_list.size() != K) {\n\n\t\tcout << -1 << endl;\n\n\t}\n\n\telse {\n\n\t\tfor (vector v : answer_list) {\n\n\t\t\tfor (int i = 0; i < N; ++i) {\n\n\t\t\t\tif (i != 0) cout << ' ';\n\n\t\t\t\tcout << v[i] + 1;\n\n\t\t\t}\n\n\t\t\tcout << endl;\n\n\t\t}\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "class Solve\n getter n : Int32, m : Int32, k : Int32\n\n def initialize\n @n, @m, @k = read_line.split.map(&.to_i)\n @graph = Array(Array(Int32)).new(n) { [] of Int32 }\n @deg = Array(Int32).new(n, 0)\n m.times do\n a, b = read_line.split.map(&.to_i.pred)\n @graph[a] << b\n @deg[b] += 1\n end\n @ans = [] of Array(Int32)\n @perm = [] of Int32\n @stack = [] of Int32\n end\n\n def run\n @stack = (0...n).select { |i| @deg[i] == 0 }\n dfs\n puts -1\n end\n\n def dfs\n if @perm.size == n\n @ans << @perm.dup\n if @ans.size == k\n @ans.each { |t| puts t.join(' ', &.succ) }\n exit\n end\n return\n elsif @stack.size == 0\n puts -1\n exit\n end\n\n (0...@stack.size).reverse_each do |i|\n v = @stack.delete_at(i)\n @perm << v\n @graph[v].each do |u|\n @deg[u] -= 1\n @stack << u if @deg[u] == 0\n end\n\n dfs\n\n @graph[v].each do |u|\n @stack.pop if @deg[u] == 0\n @deg[u] += 1\n end\n @perm.pop\n @stack.insert(i, v)\n end\n end\nend\n\nSolve.new.run\n" }, { "id": 374, "name": "072", "Crystal": "record Point, y : Int32, x : Int32 do\n Direction = [Point.new(0, 1), Point.new(0, -1), Point.new(1, 0), Point.new(-1, 0)]\n\n def +(other : Point)\n Point.new(y + other.y, x + other.x)\n end\nend\n\nclass Solve\n getter h : Int32, w : Int32\n\n def initialize\n @h, @w = read_line.split.map(&.to_i)\n @s = Array(String).new(h) { read_line }\n @ans = 0\n @start = Point.new(0, 0)\n @used = Array(Array(Bool)).new(h) { Array(Bool).new(w, false) }\n end\n\n def run\n Array.each_product((0...h).to_a, (0...w).to_a) do |(y, x)|\n @start = Point.new(y, x)\n @used.map(&.fill(false))\n @used[y][x] = true\n dfs(@start, 0)\n end\n @ans <= 2 ? -1 : @ans\n end\n\n def dfs(p1, cnt) : Nil\n (0...4).each do |d|\n p2 = p1 + Point::Direction[d]\n next unless (0...h).includes?(p2.y) && (0...w).includes?(p2.x) && @s[p2.y][p2.x] == '.'\n if @start == p2\n @ans = {@ans, cnt + 1}.max\n return\n end\n if !@used[p2.y][p2.x]\n @used[p2.y][p2.x] = true\n dfs(p2, cnt + 1)\n @used[p2.y][p2.x] = false\n end\n end\n end\nend\n\nputs Solve.new.run\n", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nchar c[20][20];\n\nint dx[4] = { 0, 1, 0, -1 };\n\nint dy[4] = { 1, 0, -1, 0 };\n\nbool used[20][20];\n\n\n\nint dfs(int sx, int sy, int px, int py) {\n\n\tif (sx == px && sy == py && used[px][py] == true) return 0;\n\n\tused[px][py] = true;\n\n\n\n\tint ret = -10000;\n\n\tfor (int i = 0; i < 4; i++) {\n\n\t\tint nx = px + dx[i], ny = py + dy[i];\n\n\t\tif (nx < 1 || ny < 1 || nx > H || ny > W || c[nx][ny] == '#') continue;\n\n\t\tif ((sx != nx || sy != ny) && used[nx][ny] == true) continue;\n\n\t\tint v = dfs(sx, sy, nx, ny);\n\n\t\tret = max(ret, v + 1);\n\n\t}\n\n\tused[px][py] = false;\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) cin >> c[i][j];\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tint Answer = -1;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer = max(Answer, dfs(i, j, i, j));\n\n\t\t}\n\n\t}\n\n\tif (Answer <= 2) Answer = -1;\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}" }, { "id": 375, "name": "072", "Crystal": "record Point, y : Int32, x : Int32 do\n Direction = [Point.new(0, 1), Point.new(0, -1), Point.new(1, 0), Point.new(-1, 0)]\n\n def +(other : Point)\n Point.new(y + other.y, x + other.x)\n end\nend\n\nclass Solve\n getter h : Int32, w : Int32\n\n def initialize\n @h, @w = read_line.split.map(&.to_i)\n @s = Array(String).new(h) { read_line }\n @ans = 0\n @start = Point.new(0, 0)\n @used = Array(Array(Bool)).new(h) { Array(Bool).new(w, false) }\n end\n\n def run\n Array.each_product((0...h).to_a, (0...w).to_a) do |(y, x)|\n @start = Point.new(y, x)\n @used.map(&.fill(false))\n @used[y][x] = true\n dfs(@start, 0)\n end\n @ans <= 2 ? -1 : @ans\n end\n\n def dfs(p1, cnt) : Nil\n (0...4).each do |d|\n p2 = p1 + Point::Direction[d]\n next unless (0...h).includes?(p2.y) && (0...w).includes?(p2.x) && @s[p2.y][p2.x] == '.'\n if @start == p2\n @ans = {@ans, cnt + 1}.max\n return\n end\n if !@used[p2.y][p2.x]\n @used[p2.y][p2.x] = true\n dfs(p2, cnt + 1)\n @used[p2.y][p2.x] = false\n end\n end\n end\nend\n\nputs Solve.new.run\n", "Python": "h, w = map(int,input().split())\ns = [list(input()) for _ in range(h)]\n\ndist = [[-1] * w for _ in range(h)]\nd = ((1, 0), (-1, 0), (0, 1), (0, -1))\n\ndef dfs(y: int, x: int, cnt) -> int:\n if dist[y][x] != -1:\n if cnt - dist[y][x] >= 4:\n return cnt - dist[y][x]\n else:\n return -1\n\n num = -1\n dist[y][x] = cnt\n for dy, dx in d:\n if not (0 <= dy + y <= h - 1 and 0 <= dx + x <= w - 1): continue\n if s[dy + y][dx + x] == \"#\": continue\n num = max(num, dfs(dy + y, dx + x, cnt + 1)) \n dist[y][x] = -1\n\n return num\n\nans = -1\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\": continue\n ans = max(ans, dfs(i, j, 0))\n\nprint(ans)" }, { "id": 376, "name": "072", "Crystal": "record Point, y : Int32, x : Int32 do\n Direction = [Point.new(0, 1), Point.new(0, -1), Point.new(1, 0), Point.new(-1, 0)]\n\n def +(other : Point)\n Point.new(y + other.y, x + other.x)\n end\nend\n\nclass Solve\n getter h : Int32, w : Int32\n\n def initialize\n @h, @w = read_line.split.map(&.to_i)\n @s = Array(String).new(h) { read_line }\n @ans = 0\n @start = Point.new(0, 0)\n @used = Array(Array(Bool)).new(h) { Array(Bool).new(w, false) }\n end\n\n def run\n Array.each_product((0...h).to_a, (0...w).to_a) do |(y, x)|\n @start = Point.new(y, x)\n @used.map(&.fill(false))\n @used[y][x] = true\n dfs(@start, 0)\n end\n @ans <= 2 ? -1 : @ans\n end\n\n def dfs(p1, cnt) : Nil\n (0...4).each do |d|\n p2 = p1 + Point::Direction[d]\n next unless (0...h).includes?(p2.y) && (0...w).includes?(p2.x) && @s[p2.y][p2.x] == '.'\n if @start == p2\n @ans = {@ans, cnt + 1}.max\n return\n end\n if !@used[p2.y][p2.x]\n @used[p2.y][p2.x] = true\n dfs(p2, cnt + 1)\n @used[p2.y][p2.x] = false\n end\n end\n end\nend\n\nputs Solve.new.run\n", "Ruby": "require 'thread'\n\nState = Struct.new(:vis, :pos, :src)\n\nh, w = readline.split.map(&:to_i)\nw += 1\ngrid = readlines.join + ('#' * w)\n\nqueue = Queue.new\ndp = {}\nfor pos in 0...(h * w)\n if grid[pos] == '.' then\n q = State.new(1 << pos, pos, pos)\n queue.push(q)\n dp[q] = 1\n end\nend\n\nans = 2\n\nuntil queue.empty?\n q0 = queue.pop\n\n for δ in [-w, -1, +1, +w]\n pos = q0.pos + δ\n\n next if grid[pos] != '.'\n q1 = State.new(q0.vis | (1 << pos), pos, q0.src)\n next if dp.include?(q1)\n if q1.vis != q0.vis then\n dp[q1] = dp[q0] + 1\n queue.push(q1)\n elsif q1.pos == q0.src then\n ans = [ans, dp[q0]].max\n end\n end\nend\n\nputs (ans == 2) ? -1 : ans\n" }, { "id": 377, "name": "072", "Crystal": "record Point, y : Int32, x : Int32 do\n Direction = [Point.new(0, 1), Point.new(0, -1), Point.new(1, 0), Point.new(-1, 0)]\n\n def +(other : Point)\n Point.new(y + other.y, x + other.x)\n end\nend\n\nclass Solve\n getter h : Int32, w : Int32\n\n def initialize\n @h, @w = read_line.split.map(&.to_i)\n @s = Array(String).new(h) { read_line }\n @ans = 0\n @start = Point.new(0, 0)\n @used = Array(Array(Bool)).new(h) { Array(Bool).new(w, false) }\n end\n\n def run\n Array.each_product((0...h).to_a, (0...w).to_a) do |(y, x)|\n @start = Point.new(y, x)\n @used.map(&.fill(false))\n @used[y][x] = true\n dfs(@start, 0)\n end\n @ans <= 2 ? -1 : @ans\n end\n\n def dfs(p1, cnt) : Nil\n (0...4).each do |d|\n p2 = p1 + Point::Direction[d]\n next unless (0...h).includes?(p2.y) && (0...w).includes?(p2.x) && @s[p2.y][p2.x] == '.'\n if @start == p2\n @ans = {@ans, cnt + 1}.max\n return\n end\n if !@used[p2.y][p2.x]\n @used[p2.y][p2.x] = true\n dfs(p2, cnt + 1)\n @used[p2.y][p2.x] = false\n end\n end\n end\nend\n\nputs Solve.new.run\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar c: [][]char :: #[h][]char\n\tfor i(0, h - 1)\n\t\tdo c[i] :: cui@input()\n\tend for\n\t\n\tvar ans: int :: 0\n\tif(h = 1 | w = 1)\n\telse\n\t\tfor y(0, h - 1)\n\t\t\tfor x(0, w - 1)\n\t\t\t\tfor d(0, 3)\n\t\t\t\t\tif(c[y][x] = '.')\n\t\t\t\t\t\tdo ans :: [ans, f(0, y, x, y, x, h, w, c, d)].max()\n\t\t\t\t\tend if\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend if\n\tif(ans = 0)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(cnt: int, sy: int, sx: int, y: int, x: int, h: int, w: int, c: [][]char, d: int): int\n\t\tvar res: int :: 0\n\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\tfor dd(-1, 1)\n\t\t\tvar nd: int :: (d + dd + 4) % 4\n\t\t\tvar nx: int :: x + dx[nd]\n\t\t\tvar ny: int :: y + dy[nd]\n\t\t\tif(nx = -1 | nx = w)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = -1 | ny = h)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = sy & nx = sx)\n\t\t\t\tdo res :: [res, cnt + 1].max()\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(c[ny][nx] = '#')\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tdo c[ny][nx] :: '#'\n\t\t\tdo res :: [res, f(cnt + 1, sy, sx, ny, nx, h, w, c, nd)].max()\n\t\t\tdo c[ny][nx] :: '.'\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 378, "name": "072", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nchar c[20][20];\n\nint dx[4] = { 0, 1, 0, -1 };\n\nint dy[4] = { 1, 0, -1, 0 };\n\nbool used[20][20];\n\n\n\nint dfs(int sx, int sy, int px, int py) {\n\n\tif (sx == px && sy == py && used[px][py] == true) return 0;\n\n\tused[px][py] = true;\n\n\n\n\tint ret = -10000;\n\n\tfor (int i = 0; i < 4; i++) {\n\n\t\tint nx = px + dx[i], ny = py + dy[i];\n\n\t\tif (nx < 1 || ny < 1 || nx > H || ny > W || c[nx][ny] == '#') continue;\n\n\t\tif ((sx != nx || sy != ny) && used[nx][ny] == true) continue;\n\n\t\tint v = dfs(sx, sy, nx, ny);\n\n\t\tret = max(ret, v + 1);\n\n\t}\n\n\tused[px][py] = false;\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) cin >> c[i][j];\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tint Answer = -1;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer = max(Answer, dfs(i, j, i, j));\n\n\t\t}\n\n\t}\n\n\tif (Answer <= 2) Answer = -1;\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Python": "h, w = map(int,input().split())\ns = [list(input()) for _ in range(h)]\n\ndist = [[-1] * w for _ in range(h)]\nd = ((1, 0), (-1, 0), (0, 1), (0, -1))\n\ndef dfs(y: int, x: int, cnt) -> int:\n if dist[y][x] != -1:\n if cnt - dist[y][x] >= 4:\n return cnt - dist[y][x]\n else:\n return -1\n\n num = -1\n dist[y][x] = cnt\n for dy, dx in d:\n if not (0 <= dy + y <= h - 1 and 0 <= dx + x <= w - 1): continue\n if s[dy + y][dx + x] == \"#\": continue\n num = max(num, dfs(dy + y, dx + x, cnt + 1)) \n dist[y][x] = -1\n\n return num\n\nans = -1\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\": continue\n ans = max(ans, dfs(i, j, 0))\n\nprint(ans)" }, { "id": 379, "name": "072", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nchar c[20][20];\n\nint dx[4] = { 0, 1, 0, -1 };\n\nint dy[4] = { 1, 0, -1, 0 };\n\nbool used[20][20];\n\n\n\nint dfs(int sx, int sy, int px, int py) {\n\n\tif (sx == px && sy == py && used[px][py] == true) return 0;\n\n\tused[px][py] = true;\n\n\n\n\tint ret = -10000;\n\n\tfor (int i = 0; i < 4; i++) {\n\n\t\tint nx = px + dx[i], ny = py + dy[i];\n\n\t\tif (nx < 1 || ny < 1 || nx > H || ny > W || c[nx][ny] == '#') continue;\n\n\t\tif ((sx != nx || sy != ny) && used[nx][ny] == true) continue;\n\n\t\tint v = dfs(sx, sy, nx, ny);\n\n\t\tret = max(ret, v + 1);\n\n\t}\n\n\tused[px][py] = false;\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) cin >> c[i][j];\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tint Answer = -1;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer = max(Answer, dfs(i, j, i, j));\n\n\t\t}\n\n\t}\n\n\tif (Answer <= 2) Answer = -1;\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Ruby": "require 'thread'\n\nState = Struct.new(:vis, :pos, :src)\n\nh, w = readline.split.map(&:to_i)\nw += 1\ngrid = readlines.join + ('#' * w)\n\nqueue = Queue.new\ndp = {}\nfor pos in 0...(h * w)\n if grid[pos] == '.' then\n q = State.new(1 << pos, pos, pos)\n queue.push(q)\n dp[q] = 1\n end\nend\n\nans = 2\n\nuntil queue.empty?\n q0 = queue.pop\n\n for δ in [-w, -1, +1, +w]\n pos = q0.pos + δ\n\n next if grid[pos] != '.'\n q1 = State.new(q0.vis | (1 << pos), pos, q0.src)\n next if dp.include?(q1)\n if q1.vis != q0.vis then\n dp[q1] = dp[q0] + 1\n queue.push(q1)\n elsif q1.pos == q0.src then\n ans = [ans, dp[q0]].max\n end\n end\nend\n\nputs (ans == 2) ? -1 : ans\n" }, { "id": 380, "name": "072", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nint H, W;\n\nchar c[20][20];\n\nint dx[4] = { 0, 1, 0, -1 };\n\nint dy[4] = { 1, 0, -1, 0 };\n\nbool used[20][20];\n\n\n\nint dfs(int sx, int sy, int px, int py) {\n\n\tif (sx == px && sy == py && used[px][py] == true) return 0;\n\n\tused[px][py] = true;\n\n\n\n\tint ret = -10000;\n\n\tfor (int i = 0; i < 4; i++) {\n\n\t\tint nx = px + dx[i], ny = py + dy[i];\n\n\t\tif (nx < 1 || ny < 1 || nx > H || ny > W || c[nx][ny] == '#') continue;\n\n\t\tif ((sx != nx || sy != ny) && used[nx][ny] == true) continue;\n\n\t\tint v = dfs(sx, sy, nx, ny);\n\n\t\tret = max(ret, v + 1);\n\n\t}\n\n\tused[px][py] = false;\n\n\treturn ret;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> H >> W;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) cin >> c[i][j];\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tint Answer = -1;\n\n\tfor (int i = 1; i <= H; i++) {\n\n\t\tfor (int j = 1; j <= W; j++) {\n\n\t\t\tAnswer = max(Answer, dfs(i, j, i, j));\n\n\t\t}\n\n\t}\n\n\tif (Answer <= 2) Answer = -1;\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar c: [][]char :: #[h][]char\n\tfor i(0, h - 1)\n\t\tdo c[i] :: cui@input()\n\tend for\n\t\n\tvar ans: int :: 0\n\tif(h = 1 | w = 1)\n\telse\n\t\tfor y(0, h - 1)\n\t\t\tfor x(0, w - 1)\n\t\t\t\tfor d(0, 3)\n\t\t\t\t\tif(c[y][x] = '.')\n\t\t\t\t\t\tdo ans :: [ans, f(0, y, x, y, x, h, w, c, d)].max()\n\t\t\t\t\tend if\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend if\n\tif(ans = 0)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(cnt: int, sy: int, sx: int, y: int, x: int, h: int, w: int, c: [][]char, d: int): int\n\t\tvar res: int :: 0\n\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\tfor dd(-1, 1)\n\t\t\tvar nd: int :: (d + dd + 4) % 4\n\t\t\tvar nx: int :: x + dx[nd]\n\t\t\tvar ny: int :: y + dy[nd]\n\t\t\tif(nx = -1 | nx = w)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = -1 | ny = h)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = sy & nx = sx)\n\t\t\t\tdo res :: [res, cnt + 1].max()\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(c[ny][nx] = '#')\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tdo c[ny][nx] :: '#'\n\t\t\tdo res :: [res, f(cnt + 1, sy, sx, ny, nx, h, w, c, nd)].max()\n\t\t\tdo c[ny][nx] :: '.'\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 381, "name": "072", "Python": "h, w = map(int,input().split())\ns = [list(input()) for _ in range(h)]\n\ndist = [[-1] * w for _ in range(h)]\nd = ((1, 0), (-1, 0), (0, 1), (0, -1))\n\ndef dfs(y: int, x: int, cnt) -> int:\n if dist[y][x] != -1:\n if cnt - dist[y][x] >= 4:\n return cnt - dist[y][x]\n else:\n return -1\n\n num = -1\n dist[y][x] = cnt\n for dy, dx in d:\n if not (0 <= dy + y <= h - 1 and 0 <= dx + x <= w - 1): continue\n if s[dy + y][dx + x] == \"#\": continue\n num = max(num, dfs(dy + y, dx + x, cnt + 1)) \n dist[y][x] = -1\n\n return num\n\nans = -1\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\": continue\n ans = max(ans, dfs(i, j, 0))\n\nprint(ans)", "Ruby": "require 'thread'\n\nState = Struct.new(:vis, :pos, :src)\n\nh, w = readline.split.map(&:to_i)\nw += 1\ngrid = readlines.join + ('#' * w)\n\nqueue = Queue.new\ndp = {}\nfor pos in 0...(h * w)\n if grid[pos] == '.' then\n q = State.new(1 << pos, pos, pos)\n queue.push(q)\n dp[q] = 1\n end\nend\n\nans = 2\n\nuntil queue.empty?\n q0 = queue.pop\n\n for δ in [-w, -1, +1, +w]\n pos = q0.pos + δ\n\n next if grid[pos] != '.'\n q1 = State.new(q0.vis | (1 << pos), pos, q0.src)\n next if dp.include?(q1)\n if q1.vis != q0.vis then\n dp[q1] = dp[q0] + 1\n queue.push(q1)\n elsif q1.pos == q0.src then\n ans = [ans, dp[q0]].max\n end\n end\nend\n\nputs (ans == 2) ? -1 : ans\n" }, { "id": 382, "name": "072", "Python": "h, w = map(int,input().split())\ns = [list(input()) for _ in range(h)]\n\ndist = [[-1] * w for _ in range(h)]\nd = ((1, 0), (-1, 0), (0, 1), (0, -1))\n\ndef dfs(y: int, x: int, cnt) -> int:\n if dist[y][x] != -1:\n if cnt - dist[y][x] >= 4:\n return cnt - dist[y][x]\n else:\n return -1\n\n num = -1\n dist[y][x] = cnt\n for dy, dx in d:\n if not (0 <= dy + y <= h - 1 and 0 <= dx + x <= w - 1): continue\n if s[dy + y][dx + x] == \"#\": continue\n num = max(num, dfs(dy + y, dx + x, cnt + 1)) \n dist[y][x] = -1\n\n return num\n\nans = -1\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\": continue\n ans = max(ans, dfs(i, j, 0))\n\nprint(ans)", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar c: [][]char :: #[h][]char\n\tfor i(0, h - 1)\n\t\tdo c[i] :: cui@input()\n\tend for\n\t\n\tvar ans: int :: 0\n\tif(h = 1 | w = 1)\n\telse\n\t\tfor y(0, h - 1)\n\t\t\tfor x(0, w - 1)\n\t\t\t\tfor d(0, 3)\n\t\t\t\t\tif(c[y][x] = '.')\n\t\t\t\t\t\tdo ans :: [ans, f(0, y, x, y, x, h, w, c, d)].max()\n\t\t\t\t\tend if\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend if\n\tif(ans = 0)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(cnt: int, sy: int, sx: int, y: int, x: int, h: int, w: int, c: [][]char, d: int): int\n\t\tvar res: int :: 0\n\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\tfor dd(-1, 1)\n\t\t\tvar nd: int :: (d + dd + 4) % 4\n\t\t\tvar nx: int :: x + dx[nd]\n\t\t\tvar ny: int :: y + dy[nd]\n\t\t\tif(nx = -1 | nx = w)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = -1 | ny = h)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = sy & nx = sx)\n\t\t\t\tdo res :: [res, cnt + 1].max()\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(c[ny][nx] = '#')\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tdo c[ny][nx] :: '#'\n\t\t\tdo res :: [res, f(cnt + 1, sy, sx, ny, nx, h, w, c, nd)].max()\n\t\t\tdo c[ny][nx] :: '.'\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 383, "name": "072", "Ruby": "require 'thread'\n\nState = Struct.new(:vis, :pos, :src)\n\nh, w = readline.split.map(&:to_i)\nw += 1\ngrid = readlines.join + ('#' * w)\n\nqueue = Queue.new\ndp = {}\nfor pos in 0...(h * w)\n if grid[pos] == '.' then\n q = State.new(1 << pos, pos, pos)\n queue.push(q)\n dp[q] = 1\n end\nend\n\nans = 2\n\nuntil queue.empty?\n q0 = queue.pop\n\n for δ in [-w, -1, +1, +w]\n pos = q0.pos + δ\n\n next if grid[pos] != '.'\n q1 = State.new(q0.vis | (1 << pos), pos, q0.src)\n next if dp.include?(q1)\n if q1.vis != q0.vis then\n dp[q1] = dp[q0] + 1\n queue.push(q1)\n elsif q1.pos == q0.src then\n ans = [ans, dp[q0]].max\n end\n end\nend\n\nputs (ans == 2) ? -1 : ans\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar c: [][]char :: #[h][]char\n\tfor i(0, h - 1)\n\t\tdo c[i] :: cui@input()\n\tend for\n\t\n\tvar ans: int :: 0\n\tif(h = 1 | w = 1)\n\telse\n\t\tfor y(0, h - 1)\n\t\t\tfor x(0, w - 1)\n\t\t\t\tfor d(0, 3)\n\t\t\t\t\tif(c[y][x] = '.')\n\t\t\t\t\t\tdo ans :: [ans, f(0, y, x, y, x, h, w, c, d)].max()\n\t\t\t\t\tend if\n\t\t\t\tend for\n\t\t\tend for\n\t\tend for\n\tend if\n\tif(ans = 0)\n\t\tdo ans :: -1\n\tend if\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc f(cnt: int, sy: int, sx: int, y: int, x: int, h: int, w: int, c: [][]char, d: int): int\n\t\tvar res: int :: 0\n\t\tvar dx: []int :: [1, 0, -1, 0]\n\t\tvar dy: []int :: [0, 1, 0, -1]\n\t\tfor dd(-1, 1)\n\t\t\tvar nd: int :: (d + dd + 4) % 4\n\t\t\tvar nx: int :: x + dx[nd]\n\t\t\tvar ny: int :: y + dy[nd]\n\t\t\tif(nx = -1 | nx = w)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = -1 | ny = h)\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(ny = sy & nx = sx)\n\t\t\t\tdo res :: [res, cnt + 1].max()\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tif(c[ny][nx] = '#')\n\t\t\t\tskip dd\n\t\t\tend if\n\t\t\tdo c[ny][nx] :: '#'\n\t\t\tdo res :: [res, f(cnt + 1, sy, sx, ny, nx, h, w, c, nd)].max()\n\t\t\tdo c[ny][nx] :: '.'\n\t\tend for\n\t\tret res\n\tend func\nend func\n" }, { "id": 384, "name": "073", "Python": "from collections import deque\nn = int(input())\nC = input().split()\nmod = 10**9+7\ne = [[] for i in range(n)]\nfor _ in range(n-1):\n a,b = [int(x)-1 for x in input().split()]\n e[a].append(b)\n e[b].append(a)\npar = [-1]*n\ntopo = []\nq = deque([0])\nwhile q:\n x = q.pop()\n topo.append(x)\n for nex in e[x]:\n if par[x] == nex:\n continue\n par[nex] = x\n q.append(nex)\n \ndp = [[-1]*3 for i in range(n)]\n\nfor x in topo[::-1]:\n id = int(C[x] == \"b\")\n dpx = [0]*3\n dpx[id] = 1\n dpx[2] = 1\n for nex in e[x]:\n if nex == par[x]:\n continue\n ndp = dp[nex]\n dpx[id] *= (ndp[id]+ndp[2])\n dpx[id] %= mod\n dpx[2] *= sum(ndp)+ndp[2]\n dpx[2] %= mod\n dpx[2] -= dpx[id]\n dpx[2] %= mod\n dp[x] = dpx\n\nprint(dp[0][2])", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, A[1 << 18], B[1 << 18];\n\nchar C[1 << 18];\n\n\n\nlong long mod = 1000000007;\n\nlong long dp[1 << 18][3];\n\nvector G[1 << 18];\n\n\n\nvoid dfs(int pos, int pre) {\n\n\tlong long val1 = 1, val2 = 1;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (i == pre) continue;\n\n\t\tdfs(i, pos);\n\n\t\tif (C[pos] == 'a') {\n\n\t\t\tval1 *= (dp[i][0] + dp[i][2]);\n\n\t\t\tval2 *= (dp[i][0] + dp[i][1] + 2LL * dp[i][2]);\n\n\t\t}\n\n\t\tif (C[pos] == 'b') {\n\n\t\t\tval1 *= (dp[i][1] + dp[i][2]);\n\n\t\t\tval2 *= (dp[i][0] + dp[i][1] + 2LL * dp[i][2]);\n\n\t\t}\n\n\t\tval1 %= mod;\n\n\t\tval2 %= mod;\n\n\t}\n\n\n\n\tif (C[pos] == 'a') {\n\n\t\tdp[pos][0] = val1;\n\n\t\tdp[pos][2] = (val2 - val1 + mod) % mod;\n\n\t}\n\n\tif (C[pos] == 'b') {\n\n\t\tdp[pos][1] = val1;\n\n\t\tdp[pos][2] = (val2 - val1 + mod) % mod;\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> C[i];\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tdfs(1, -1);\n\n\tcout << dp[1][2] << endl;\n\n\treturn 0;\n\n}" }, { "id": 385, "name": "073", "Python": "from collections import deque\nn = int(input())\nC = input().split()\nmod = 10**9+7\ne = [[] for i in range(n)]\nfor _ in range(n-1):\n a,b = [int(x)-1 for x in input().split()]\n e[a].append(b)\n e[b].append(a)\npar = [-1]*n\ntopo = []\nq = deque([0])\nwhile q:\n x = q.pop()\n topo.append(x)\n for nex in e[x]:\n if par[x] == nex:\n continue\n par[nex] = x\n q.append(nex)\n \ndp = [[-1]*3 for i in range(n)]\n\nfor x in topo[::-1]:\n id = int(C[x] == \"b\")\n dpx = [0]*3\n dpx[id] = 1\n dpx[2] = 1\n for nex in e[x]:\n if nex == par[x]:\n continue\n ndp = dp[nex]\n dpx[id] *= (ndp[id]+ndp[2])\n dpx[id] %= mod\n dpx[2] *= sum(ndp)+ndp[2]\n dpx[2] %= mod\n dpx[2] -= dpx[id]\n dpx[2] %= mod\n dp[x] = dpx\n\nprint(dp[0][2])", "Crystal": "MOD = 10**9 + 7\n\nclass Graph\n def initialize(size, @color : Array(Char))\n @graph = Array(Array(Int32)).new(size) { [] of Int32 }\n end\n\n def add_edge(u, v)\n @graph[u] << v\n @graph[v] << u\n end\n\n def run\n dfs(0, -1)[2] % MOD\n end\n\n def dfs(v, p)\n val1, val2 = 1i64, 1i64\n @graph[v].each do |u|\n next if u == p\n a, b, ab = dfs(u, v)\n val1 *= (@color[v] == 'a' ? a : b) + ab\n val2 *= a + b + ab * 2\n val1 %= MOD\n val2 %= MOD\n end\n\n if @color[v] == 'a'\n {val1, 0i64, val2 - val1}\n else\n {0i64, val1, val2 - val1}\n end\n end\nend\n\nn = read_line.to_i\nc = read_line.split.map(&.[0])\ng = Graph.new(n, c)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n g.add_edge(a, b)\nend\nputs g.run\n" }, { "id": 386, "name": "073", "Python": "from collections import deque\nn = int(input())\nC = input().split()\nmod = 10**9+7\ne = [[] for i in range(n)]\nfor _ in range(n-1):\n a,b = [int(x)-1 for x in input().split()]\n e[a].append(b)\n e[b].append(a)\npar = [-1]*n\ntopo = []\nq = deque([0])\nwhile q:\n x = q.pop()\n topo.append(x)\n for nex in e[x]:\n if par[x] == nex:\n continue\n par[nex] = x\n q.append(nex)\n \ndp = [[-1]*3 for i in range(n)]\n\nfor x in topo[::-1]:\n id = int(C[x] == \"b\")\n dpx = [0]*3\n dpx[id] = 1\n dpx[2] = 1\n for nex in e[x]:\n if nex == par[x]:\n continue\n ndp = dp[nex]\n dpx[id] *= (ndp[id]+ndp[2])\n dpx[id] %= mod\n dpx[2] *= sum(ndp)+ndp[2]\n dpx[2] %= mod\n dpx[2] -= dpx[id]\n dpx[2] %= mod\n dp[x] = dpx\n\nprint(dp[0][2])", "Kuin": "var dp: [][]int\nvar c: []char\n\nfunc main()\n\tconst mod: int :: 1000000007\n\tvar n: int :: cui@inputInt()\n\tdo @c :: #[n]char\n\tfor i(0, n - 1)\n\t\tdo @c[i] :: cui@inputChar()\n\tend for\n\tvar g: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo g[i] :: #list\n\tend for\n\tfor(1, n - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo g[a].add(b)\n\t\tdo g[b].add(a)\n\tend for\n\t\n\tdo @dp :: #[n, 3]int\n\tdo dfs(g, 0, -1)\n\tvar ans: int :: @dp[0][2]\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs(g: []list, u: int, p: int)\n\t\tvar x: int :: @c[u] $ int - 'a' $ int\n\t\tdo @dp[u][x] :: 1\n\t\tdo @dp[u][2] :: 1\n\t\tdo g[u].head()\n\t\tfor(1, ^g[u])\n\t\t\tvar v: int :: g[u].get()\n\t\t\tif(v <> p)\n\t\t\t\tdo dfs(g, v, u)\n\t\t\t\tvar v2: int :: @dp[v][x] + @dp[v][2]\n\t\t\t\tvar v3: int :: @dp[v][0] + @dp[v][1] + 2 * @dp[v][2]\n\t\t\t\tdo @dp[u][x] :* v2\n\t\t\t\tdo @dp[u][x] :% mod\n\t\t\t\tdo @dp[u][2] :* v3\n\t\t\t\tdo @dp[u][2] :% mod\n\t\t\tend if\n\t\t\tdo g[u].next()\n\t\tend for\n\t\tdo @dp[u][2] :+ mod - @dp[u][x]\n\t\tdo @dp[u][2] :% mod\n\tend func\nend func\n" }, { "id": 387, "name": "073", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, A[1 << 18], B[1 << 18];\n\nchar C[1 << 18];\n\n\n\nlong long mod = 1000000007;\n\nlong long dp[1 << 18][3];\n\nvector G[1 << 18];\n\n\n\nvoid dfs(int pos, int pre) {\n\n\tlong long val1 = 1, val2 = 1;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (i == pre) continue;\n\n\t\tdfs(i, pos);\n\n\t\tif (C[pos] == 'a') {\n\n\t\t\tval1 *= (dp[i][0] + dp[i][2]);\n\n\t\t\tval2 *= (dp[i][0] + dp[i][1] + 2LL * dp[i][2]);\n\n\t\t}\n\n\t\tif (C[pos] == 'b') {\n\n\t\t\tval1 *= (dp[i][1] + dp[i][2]);\n\n\t\t\tval2 *= (dp[i][0] + dp[i][1] + 2LL * dp[i][2]);\n\n\t\t}\n\n\t\tval1 %= mod;\n\n\t\tval2 %= mod;\n\n\t}\n\n\n\n\tif (C[pos] == 'a') {\n\n\t\tdp[pos][0] = val1;\n\n\t\tdp[pos][2] = (val2 - val1 + mod) % mod;\n\n\t}\n\n\tif (C[pos] == 'b') {\n\n\t\tdp[pos][1] = val1;\n\n\t\tdp[pos][2] = (val2 - val1 + mod) % mod;\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> C[i];\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tdfs(1, -1);\n\n\tcout << dp[1][2] << endl;\n\n\treturn 0;\n\n}", "Crystal": "MOD = 10**9 + 7\n\nclass Graph\n def initialize(size, @color : Array(Char))\n @graph = Array(Array(Int32)).new(size) { [] of Int32 }\n end\n\n def add_edge(u, v)\n @graph[u] << v\n @graph[v] << u\n end\n\n def run\n dfs(0, -1)[2] % MOD\n end\n\n def dfs(v, p)\n val1, val2 = 1i64, 1i64\n @graph[v].each do |u|\n next if u == p\n a, b, ab = dfs(u, v)\n val1 *= (@color[v] == 'a' ? a : b) + ab\n val2 *= a + b + ab * 2\n val1 %= MOD\n val2 %= MOD\n end\n\n if @color[v] == 'a'\n {val1, 0i64, val2 - val1}\n else\n {0i64, val1, val2 - val1}\n end\n end\nend\n\nn = read_line.to_i\nc = read_line.split.map(&.[0])\ng = Graph.new(n, c)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n g.add_edge(a, b)\nend\nputs g.run\n" }, { "id": 388, "name": "073", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nlong long N, A[1 << 18], B[1 << 18];\n\nchar C[1 << 18];\n\n\n\nlong long mod = 1000000007;\n\nlong long dp[1 << 18][3];\n\nvector G[1 << 18];\n\n\n\nvoid dfs(int pos, int pre) {\n\n\tlong long val1 = 1, val2 = 1;\n\n\tfor (int i : G[pos]) {\n\n\t\tif (i == pre) continue;\n\n\t\tdfs(i, pos);\n\n\t\tif (C[pos] == 'a') {\n\n\t\t\tval1 *= (dp[i][0] + dp[i][2]);\n\n\t\t\tval2 *= (dp[i][0] + dp[i][1] + 2LL * dp[i][2]);\n\n\t\t}\n\n\t\tif (C[pos] == 'b') {\n\n\t\t\tval1 *= (dp[i][1] + dp[i][2]);\n\n\t\t\tval2 *= (dp[i][0] + dp[i][1] + 2LL * dp[i][2]);\n\n\t\t}\n\n\t\tval1 %= mod;\n\n\t\tval2 %= mod;\n\n\t}\n\n\n\n\tif (C[pos] == 'a') {\n\n\t\tdp[pos][0] = val1;\n\n\t\tdp[pos][2] = (val2 - val1 + mod) % mod;\n\n\t}\n\n\tif (C[pos] == 'b') {\n\n\t\tdp[pos][1] = val1;\n\n\t\tdp[pos][2] = (val2 - val1 + mod) % mod;\n\n\t}\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N;\n\n\tfor (int i = 1; i <= N; i++) cin >> C[i];\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\n\t\tcin >> A[i] >> B[i];\n\n\t\tG[A[i]].push_back(B[i]);\n\n\t\tG[B[i]].push_back(A[i]);\n\n\t}\n\n\n\n\t// Step #2. DFS\n\n\tdfs(1, -1);\n\n\tcout << dp[1][2] << endl;\n\n\treturn 0;\n\n}", "Kuin": "var dp: [][]int\nvar c: []char\n\nfunc main()\n\tconst mod: int :: 1000000007\n\tvar n: int :: cui@inputInt()\n\tdo @c :: #[n]char\n\tfor i(0, n - 1)\n\t\tdo @c[i] :: cui@inputChar()\n\tend for\n\tvar g: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo g[i] :: #list\n\tend for\n\tfor(1, n - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo g[a].add(b)\n\t\tdo g[b].add(a)\n\tend for\n\t\n\tdo @dp :: #[n, 3]int\n\tdo dfs(g, 0, -1)\n\tvar ans: int :: @dp[0][2]\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs(g: []list, u: int, p: int)\n\t\tvar x: int :: @c[u] $ int - 'a' $ int\n\t\tdo @dp[u][x] :: 1\n\t\tdo @dp[u][2] :: 1\n\t\tdo g[u].head()\n\t\tfor(1, ^g[u])\n\t\t\tvar v: int :: g[u].get()\n\t\t\tif(v <> p)\n\t\t\t\tdo dfs(g, v, u)\n\t\t\t\tvar v2: int :: @dp[v][x] + @dp[v][2]\n\t\t\t\tvar v3: int :: @dp[v][0] + @dp[v][1] + 2 * @dp[v][2]\n\t\t\t\tdo @dp[u][x] :* v2\n\t\t\t\tdo @dp[u][x] :% mod\n\t\t\t\tdo @dp[u][2] :* v3\n\t\t\t\tdo @dp[u][2] :% mod\n\t\t\tend if\n\t\t\tdo g[u].next()\n\t\tend for\n\t\tdo @dp[u][2] :+ mod - @dp[u][x]\n\t\tdo @dp[u][2] :% mod\n\tend func\nend func\n" }, { "id": 389, "name": "073", "Crystal": "MOD = 10**9 + 7\n\nclass Graph\n def initialize(size, @color : Array(Char))\n @graph = Array(Array(Int32)).new(size) { [] of Int32 }\n end\n\n def add_edge(u, v)\n @graph[u] << v\n @graph[v] << u\n end\n\n def run\n dfs(0, -1)[2] % MOD\n end\n\n def dfs(v, p)\n val1, val2 = 1i64, 1i64\n @graph[v].each do |u|\n next if u == p\n a, b, ab = dfs(u, v)\n val1 *= (@color[v] == 'a' ? a : b) + ab\n val2 *= a + b + ab * 2\n val1 %= MOD\n val2 %= MOD\n end\n\n if @color[v] == 'a'\n {val1, 0i64, val2 - val1}\n else\n {0i64, val1, val2 - val1}\n end\n end\nend\n\nn = read_line.to_i\nc = read_line.split.map(&.[0])\ng = Graph.new(n, c)\nn.pred.times do\n a, b = read_line.split.map(&.to_i.pred)\n g.add_edge(a, b)\nend\nputs g.run\n", "Kuin": "var dp: [][]int\nvar c: []char\n\nfunc main()\n\tconst mod: int :: 1000000007\n\tvar n: int :: cui@inputInt()\n\tdo @c :: #[n]char\n\tfor i(0, n - 1)\n\t\tdo @c[i] :: cui@inputChar()\n\tend for\n\tvar g: []list :: #[n]list\n\tfor i(0, n - 1)\n\t\tdo g[i] :: #list\n\tend for\n\tfor(1, n - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tdo g[a].add(b)\n\t\tdo g[b].add(a)\n\tend for\n\t\n\tdo @dp :: #[n, 3]int\n\tdo dfs(g, 0, -1)\n\tvar ans: int :: @dp[0][2]\n\tdo cui@print(\"\\{ans}\\n\")\n\t\n\tfunc dfs(g: []list, u: int, p: int)\n\t\tvar x: int :: @c[u] $ int - 'a' $ int\n\t\tdo @dp[u][x] :: 1\n\t\tdo @dp[u][2] :: 1\n\t\tdo g[u].head()\n\t\tfor(1, ^g[u])\n\t\t\tvar v: int :: g[u].get()\n\t\t\tif(v <> p)\n\t\t\t\tdo dfs(g, v, u)\n\t\t\t\tvar v2: int :: @dp[v][x] + @dp[v][2]\n\t\t\t\tvar v3: int :: @dp[v][0] + @dp[v][1] + 2 * @dp[v][2]\n\t\t\t\tdo @dp[u][x] :* v2\n\t\t\t\tdo @dp[u][x] :% mod\n\t\t\t\tdo @dp[u][2] :* v3\n\t\t\t\tdo @dp[u][2] :% mod\n\t\t\tend if\n\t\t\tdo g[u].next()\n\t\tend for\n\t\tdo @dp[u][2] :+ mod - @dp[u][x]\n\t\tdo @dp[u][2] :% mod\n\tend func\nend func\n" }, { "id": 390, "name": "074", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, Answer = 0;\n\nstring S;\n\n\n\nint main() {\n\n\tcin >> N >> S;\n\n\tfor (int i = 0; i < N; i++) {\n\n\t\tif (S[i] == 'b') Answer += 1LL * (1LL << i);\n\n\t\tif (S[i] == 'c') Answer += 2LL * (1LL << i);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "read_line\ns = read_line.chars\nputs s.each_with_index.sum { |c, i|\n 2i64**i * (c - 'a')\n}\n" }, { "id": 391, "name": "074", "C++": "#include \n\nusing namespace std;\n\n\n\nlong long N, Answer = 0;\n\nstring S;\n\n\n\nint main() {\n\n\tcin >> N >> S;\n\n\tfor (int i = 0; i < N; i++) {\n\n\t\tif (S[i] == 'b') Answer += 1LL * (1LL << i);\n\n\t\tif (S[i] == 'c') Answer += 2LL * (1LL << i);\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Python": "n = int(input())\ns = input()\nnum = [ord(i) - 97 for i in s]\n\nans = 0\nfor i, j in enumerate(num):\n if j == 0: continue\n if j == 1:\n ans += 2 ** i\n elif j == 2:\n ans += 2 ** (i + 1)\nprint(ans)" }, { "id": 392, "name": "074", "Crystal": "read_line\ns = read_line.chars\nputs s.each_with_index.sum { |c, i|\n 2i64**i * (c - 'a')\n}\n", "Python": "n = int(input())\ns = input()\nnum = [ord(i) - 97 for i in s]\n\nans = 0\nfor i, j in enumerate(num):\n if j == 0: continue\n if j == 1:\n ans += 2 ** i\n elif j == 2:\n ans += 2 ** (i + 1)\nprint(ans)" }, { "id": 393, "name": "075", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nvector prime_factors(long long N) {\n\n\tlong long rem = N;\n\n\tvector p;\n\n\tfor (long long i = 2; i * i <= N; i++) {\n\n\t\twhile (rem % i == 0) {\n\n\t\t\trem /= i;\n\n\t\t\tp.push_back(i);\n\n\t\t}\n\n\t}\n\n\tif (rem != 1LL) p.push_back(rem);\n\n\treturn p;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tlong long N;\n\n\tcin >> N;\n\n\t\n\n\t// Step #2. Get Answer\n\n\tint Answer = 0;\n\n\tvector vec = prime_factors(N);\n\n\tfor (int i = 0; i <= 20; i++) {\n\n\t\tif ((1 << i) >= (int)vec.size()) { Answer = i; break; }\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Crystal": "n = read_line.to_i64\nnow, cnt = n, 0\n(2i64..).each do |x|\n break if x * x > n\n while now % x == 0\n now //= x\n cnt += 1\n end\nend\ncnt += 1 if now != 1\nputs Math.log2(cnt).ceil.to_i\n" }, { "id": 394, "name": "075", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nvector prime_factors(long long N) {\n\n\tlong long rem = N;\n\n\tvector p;\n\n\tfor (long long i = 2; i * i <= N; i++) {\n\n\t\twhile (rem % i == 0) {\n\n\t\t\trem /= i;\n\n\t\t\tp.push_back(i);\n\n\t\t}\n\n\t}\n\n\tif (rem != 1LL) p.push_back(rem);\n\n\treturn p;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tlong long N;\n\n\tcin >> N;\n\n\t\n\n\t// Step #2. Get Answer\n\n\tint Answer = 0;\n\n\tvector vec = prime_factors(N);\n\n\tfor (int i = 0; i <= 20; i++) {\n\n\t\tif ((1 << i) >= (int)vec.size()) { Answer = i; break; }\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Python": "def factorization(n):\n arr = []\n tmp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if tmp % i == 0:\n cnt = 0\n while tmp % i == 0:\n cnt += 1\n tmp //= i\n arr.append([i, cnt])\n if tmp != 1:\n arr.append([tmp, 1])\n if arr == []:\n arr.append([n, 1])\n return arr\n\nnum = sum(i[1] for i in factorization(int(input())))\nif num == 1:\n print(0)\nelse:\n i = 0\n while True:\n if num <= 2 ** i:\n break\n i += 1\n print(i)" }, { "id": 395, "name": "075", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nvector prime_factors(long long N) {\n\n\tlong long rem = N;\n\n\tvector p;\n\n\tfor (long long i = 2; i * i <= N; i++) {\n\n\t\twhile (rem % i == 0) {\n\n\t\t\trem /= i;\n\n\t\t\tp.push_back(i);\n\n\t\t}\n\n\t}\n\n\tif (rem != 1LL) p.push_back(rem);\n\n\treturn p;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tlong long N;\n\n\tcin >> N;\n\n\t\n\n\t// Step #2. Get Answer\n\n\tint Answer = 0;\n\n\tvector vec = prime_factors(N);\n\n\tfor (int i = 0; i <= 20; i++) {\n\n\t\tif ((1 << i) >= (int)vec.size()) { Answer = i; break; }\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Ruby": "p Math.log2(`factor`.count(' ')).ceil" }, { "id": 396, "name": "075", "C++": "#include \n\n#include \n\nusing namespace std;\n\n\n\nvector prime_factors(long long N) {\n\n\tlong long rem = N;\n\n\tvector p;\n\n\tfor (long long i = 2; i * i <= N; i++) {\n\n\t\twhile (rem % i == 0) {\n\n\t\t\trem /= i;\n\n\t\t\tp.push_back(i);\n\n\t\t}\n\n\t}\n\n\tif (rem != 1LL) p.push_back(rem);\n\n\treturn p;\n\n}\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tlong long N;\n\n\tcin >> N;\n\n\t\n\n\t// Step #2. Get Answer\n\n\tint Answer = 0;\n\n\tvector vec = prime_factors(N);\n\n\tfor (int i = 0; i <= 20; i++) {\n\n\t\tif ((1 << i) >= (int)vec.size()) { Answer = i; break; }\n\n\t}\n\n\tcout << Answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar primeFactors: []int :: math@primeFactors(n)\n\tvar num: int :: ^primeFactors\n\tvar ans: int :: 0\n\twhile(num <> 1)\n\t\tdo num :: (num + 1) / 2\n\t\tdo ans :+ 1\n\tend while\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 397, "name": "075", "Crystal": "n = read_line.to_i64\nnow, cnt = n, 0\n(2i64..).each do |x|\n break if x * x > n\n while now % x == 0\n now //= x\n cnt += 1\n end\nend\ncnt += 1 if now != 1\nputs Math.log2(cnt).ceil.to_i\n", "Python": "def factorization(n):\n arr = []\n tmp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if tmp % i == 0:\n cnt = 0\n while tmp % i == 0:\n cnt += 1\n tmp //= i\n arr.append([i, cnt])\n if tmp != 1:\n arr.append([tmp, 1])\n if arr == []:\n arr.append([n, 1])\n return arr\n\nnum = sum(i[1] for i in factorization(int(input())))\nif num == 1:\n print(0)\nelse:\n i = 0\n while True:\n if num <= 2 ** i:\n break\n i += 1\n print(i)" }, { "id": 398, "name": "075", "Crystal": "n = read_line.to_i64\nnow, cnt = n, 0\n(2i64..).each do |x|\n break if x * x > n\n while now % x == 0\n now //= x\n cnt += 1\n end\nend\ncnt += 1 if now != 1\nputs Math.log2(cnt).ceil.to_i\n", "Ruby": "p Math.log2(`factor`.count(' ')).ceil" }, { "id": 399, "name": "075", "Crystal": "n = read_line.to_i64\nnow, cnt = n, 0\n(2i64..).each do |x|\n break if x * x > n\n while now % x == 0\n now //= x\n cnt += 1\n end\nend\ncnt += 1 if now != 1\nputs Math.log2(cnt).ceil.to_i\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar primeFactors: []int :: math@primeFactors(n)\n\tvar num: int :: ^primeFactors\n\tvar ans: int :: 0\n\twhile(num <> 1)\n\t\tdo num :: (num + 1) / 2\n\t\tdo ans :+ 1\n\tend while\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 400, "name": "075", "Python": "def factorization(n):\n arr = []\n tmp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if tmp % i == 0:\n cnt = 0\n while tmp % i == 0:\n cnt += 1\n tmp //= i\n arr.append([i, cnt])\n if tmp != 1:\n arr.append([tmp, 1])\n if arr == []:\n arr.append([n, 1])\n return arr\n\nnum = sum(i[1] for i in factorization(int(input())))\nif num == 1:\n print(0)\nelse:\n i = 0\n while True:\n if num <= 2 ** i:\n break\n i += 1\n print(i)", "Ruby": "p Math.log2(`factor`.count(' ')).ceil" }, { "id": 401, "name": "075", "Python": "def factorization(n):\n arr = []\n tmp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if tmp % i == 0:\n cnt = 0\n while tmp % i == 0:\n cnt += 1\n tmp //= i\n arr.append([i, cnt])\n if tmp != 1:\n arr.append([tmp, 1])\n if arr == []:\n arr.append([n, 1])\n return arr\n\nnum = sum(i[1] for i in factorization(int(input())))\nif num == 1:\n print(0)\nelse:\n i = 0\n while True:\n if num <= 2 ** i:\n break\n i += 1\n print(i)", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar primeFactors: []int :: math@primeFactors(n)\n\tvar num: int :: ^primeFactors\n\tvar ans: int :: 0\n\twhile(num <> 1)\n\t\tdo num :: (num + 1) / 2\n\t\tdo ans :+ 1\n\tend while\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 402, "name": "075", "Ruby": "p Math.log2(`factor`.count(' ')).ceil", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar primeFactors: []int :: math@primeFactors(n)\n\tvar num: int :: ^primeFactors\n\tvar ans: int :: 0\n\twhile(num <> 1)\n\t\tdo num :: (num + 1) / 2\n\t\tdo ans :+ 1\n\tend while\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 403, "name": "076", "Crystal": "n = read_line.to_i\na = read_line.split.map(&.to_i64) * 2\nsum = a.sum // 2\n\nculsum = a.each_with_object([0i64]) do |x, culsum|\n culsum << culsum[-1] + x\nend\n\nputs (0...n).any? { |i|\n pos = (i...2*n).bsearch { |j| (culsum[j] - culsum[i]) * 10 >= sum }\n pos && (culsum[pos] - culsum[i]) * 10 == sum\n} ? \"Yes\" : \"No\"\n", "C++": "#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n)\n#define mp(a, b) make_pair(a, b)\nusing ll = long long;\nusing ld = long double;\n\nint main(){\n int n; cin >> n;\n // {A1～An} + {A1～An} from the beginning\n vector a(n * 2);\n ll sum = 0;\n for(int i = 0; i < n; i++){\n cin >> a[i];\n sum += a[i];\n a[i + n] = a[i];\n }\n // Two-Pointer Technique\n int l = 0, r = 0;\n ll t = a[0];\n while(true){\n if(t * 10 == sum){\n cout << \"Yes\" << endl;\n return 0;\n }\n r++;\n if(r >= n * 2) break;\n t += a[r];\n if(t * 10 > sum){\n t -= a[l];\n l++;\n }\n }\n cout << \"No\" << endl;\n}" }, { "id": 404, "name": "076", "Crystal": "n = read_line.to_i\na = read_line.split.map(&.to_i64) * 2\nsum = a.sum // 2\n\nculsum = a.each_with_object([0i64]) do |x, culsum|\n culsum << culsum[-1] + x\nend\n\nputs (0...n).any? { |i|\n pos = (i...2*n).bsearch { |j| (culsum[j] - culsum[i]) * 10 >= sum }\n pos && (culsum[pos] - culsum[i]) * 10 == sum\n} ? \"Yes\" : \"No\"\n", "Python": "from bisect import bisect_left\nn = int(input())\na = list(map(int,input().split()))\n\n# 入力は整数なので10分の1も整数でなければNoになる\nif sum(a) % 10 != 0:\n exit(print(\"No\"))\n\n# 目標となる1/10の値\nnum = sum(a) // 10\n\n# 前からの累積和と後ろからの累積和\nx, y = [a[0]], [a[-1]]\nfor i in range(n - 1):\n x.append(a[i + 1] + x[-1])\n y.append(a[-2 - i] + y[-1])\n\nfor i in range(n):\n # 目的の大きさと一致した場合\n if x[i] == num:\n exit(print(\"Yes\"))\n # 目的の大きさより多く選んでしまった場合\n elif x[i] > num:\n j = bisect_left(x, x[i] - num) # 余分な分を二分探索\n if x[i] - x[j] == num:\n exit(print(\"Yes\"))\n # 目的の大きさより小さい場合は後ろから持ってくる\n elif x[i] < num:\n j = bisect_left(y, num - x[i]) # 後ろから二分探索\n if x[i] + y[j] == num:\n exit(print(\"Yes\"))\n\nprint(\"No\")" }, { "id": 405, "name": "076", "Crystal": "n = read_line.to_i\na = read_line.split.map(&.to_i64) * 2\nsum = a.sum // 2\n\nculsum = a.each_with_object([0i64]) do |x, culsum|\n culsum << culsum[-1] + x\nend\n\nputs (0...n).any? { |i|\n pos = (i...2*n).bsearch { |j| (culsum[j] - culsum[i]) * 10 >= sum }\n pos && (culsum[pos] - culsum[i]) * 10 == sum\n} ? \"Yes\" : \"No\"\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[2 * n]int\n\tvar sum: int :: 0\n\tfor i(0, n - 1)\n\t\tvar x: int :: cui@inputInt()\n\t\tdo a[i] :: x\n\t\tdo a[n + i] :: x\n\t\tdo sum :+ x\n\tend for\n\t\n\tvar ans: bool :: false\n\tif(sum % 10 = 0)\n\t\tdo sum :/ 10\n\t\tvar l: int :: 0\n\t\tvar r: int :: 0\n\t\tvar sum2: int :: 0\n\t\twhile loop(l <> 2 * n)\n\t\t\tif(sum2 < sum & r <> 2 * n)\n\t\t\t\tdo sum2 :+ a[r]\n\t\t\t\tif(sum2 = sum)\n\t\t\t\t\tdo ans :: true\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tdo r :+ 1\n\t\t\telse\n\t\t\t\tdo sum2 :- a[l]\n\t\t\t\tdo l :+ 1\n\t\t\tend if\n\t\tend while\n\tend if\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 406, "name": "076", "C++": "#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n)\n#define mp(a, b) make_pair(a, b)\nusing ll = long long;\nusing ld = long double;\n\nint main(){\n int n; cin >> n;\n // {A1～An} + {A1～An} from the beginning\n vector a(n * 2);\n ll sum = 0;\n for(int i = 0; i < n; i++){\n cin >> a[i];\n sum += a[i];\n a[i + n] = a[i];\n }\n // Two-Pointer Technique\n int l = 0, r = 0;\n ll t = a[0];\n while(true){\n if(t * 10 == sum){\n cout << \"Yes\" << endl;\n return 0;\n }\n r++;\n if(r >= n * 2) break;\n t += a[r];\n if(t * 10 > sum){\n t -= a[l];\n l++;\n }\n }\n cout << \"No\" << endl;\n}", "Python": "from bisect import bisect_left\nn = int(input())\na = list(map(int,input().split()))\n\n# 入力は整数なので10分の1も整数でなければNoになる\nif sum(a) % 10 != 0:\n exit(print(\"No\"))\n\n# 目標となる1/10の値\nnum = sum(a) // 10\n\n# 前からの累積和と後ろからの累積和\nx, y = [a[0]], [a[-1]]\nfor i in range(n - 1):\n x.append(a[i + 1] + x[-1])\n y.append(a[-2 - i] + y[-1])\n\nfor i in range(n):\n # 目的の大きさと一致した場合\n if x[i] == num:\n exit(print(\"Yes\"))\n # 目的の大きさより多く選んでしまった場合\n elif x[i] > num:\n j = bisect_left(x, x[i] - num) # 余分な分を二分探索\n if x[i] - x[j] == num:\n exit(print(\"Yes\"))\n # 目的の大きさより小さい場合は後ろから持ってくる\n elif x[i] < num:\n j = bisect_left(y, num - x[i]) # 後ろから二分探索\n if x[i] + y[j] == num:\n exit(print(\"Yes\"))\n\nprint(\"No\")" }, { "id": 407, "name": "076", "C++": "#include \n#include \nusing namespace std;\nusing namespace atcoder;\n\n#define fs(n) fixed << setprecision(n)\n#define mp(a, b) make_pair(a, b)\nusing ll = long long;\nusing ld = long double;\n\nint main(){\n int n; cin >> n;\n // {A1～An} + {A1～An} from the beginning\n vector a(n * 2);\n ll sum = 0;\n for(int i = 0; i < n; i++){\n cin >> a[i];\n sum += a[i];\n a[i + n] = a[i];\n }\n // Two-Pointer Technique\n int l = 0, r = 0;\n ll t = a[0];\n while(true){\n if(t * 10 == sum){\n cout << \"Yes\" << endl;\n return 0;\n }\n r++;\n if(r >= n * 2) break;\n t += a[r];\n if(t * 10 > sum){\n t -= a[l];\n l++;\n }\n }\n cout << \"No\" << endl;\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[2 * n]int\n\tvar sum: int :: 0\n\tfor i(0, n - 1)\n\t\tvar x: int :: cui@inputInt()\n\t\tdo a[i] :: x\n\t\tdo a[n + i] :: x\n\t\tdo sum :+ x\n\tend for\n\t\n\tvar ans: bool :: false\n\tif(sum % 10 = 0)\n\t\tdo sum :/ 10\n\t\tvar l: int :: 0\n\t\tvar r: int :: 0\n\t\tvar sum2: int :: 0\n\t\twhile loop(l <> 2 * n)\n\t\t\tif(sum2 < sum & r <> 2 * n)\n\t\t\t\tdo sum2 :+ a[r]\n\t\t\t\tif(sum2 = sum)\n\t\t\t\t\tdo ans :: true\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tdo r :+ 1\n\t\t\telse\n\t\t\t\tdo sum2 :- a[l]\n\t\t\t\tdo l :+ 1\n\t\t\tend if\n\t\tend while\n\tend if\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 408, "name": "076", "Python": "from bisect import bisect_left\nn = int(input())\na = list(map(int,input().split()))\n\n# 入力は整数なので10分の1も整数でなければNoになる\nif sum(a) % 10 != 0:\n exit(print(\"No\"))\n\n# 目標となる1/10の値\nnum = sum(a) // 10\n\n# 前からの累積和と後ろからの累積和\nx, y = [a[0]], [a[-1]]\nfor i in range(n - 1):\n x.append(a[i + 1] + x[-1])\n y.append(a[-2 - i] + y[-1])\n\nfor i in range(n):\n # 目的の大きさと一致した場合\n if x[i] == num:\n exit(print(\"Yes\"))\n # 目的の大きさより多く選んでしまった場合\n elif x[i] > num:\n j = bisect_left(x, x[i] - num) # 余分な分を二分探索\n if x[i] - x[j] == num:\n exit(print(\"Yes\"))\n # 目的の大きさより小さい場合は後ろから持ってくる\n elif x[i] < num:\n j = bisect_left(y, num - x[i]) # 後ろから二分探索\n if x[i] + y[j] == num:\n exit(print(\"Yes\"))\n\nprint(\"No\")", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar a: []int :: #[2 * n]int\n\tvar sum: int :: 0\n\tfor i(0, n - 1)\n\t\tvar x: int :: cui@inputInt()\n\t\tdo a[i] :: x\n\t\tdo a[n + i] :: x\n\t\tdo sum :+ x\n\tend for\n\t\n\tvar ans: bool :: false\n\tif(sum % 10 = 0)\n\t\tdo sum :/ 10\n\t\tvar l: int :: 0\n\t\tvar r: int :: 0\n\t\tvar sum2: int :: 0\n\t\twhile loop(l <> 2 * n)\n\t\t\tif(sum2 < sum & r <> 2 * n)\n\t\t\t\tdo sum2 :+ a[r]\n\t\t\t\tif(sum2 = sum)\n\t\t\t\t\tdo ans :: true\n\t\t\t\t\tbreak loop\n\t\t\t\tend if\n\t\t\t\tdo r :+ 1\n\t\t\telse\n\t\t\t\tdo sum2 :- a[l]\n\t\t\t\tdo l :+ 1\n\t\t\tend if\n\t\tend while\n\tend if\n\tdo cui@print((ans ?(\"Yes\", \"No\")) ~ \"\\n\")\nend func\n" }, { "id": 409, "name": "077", "C++": "#include \n\n#include \n\n#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint N, T;\n\nint AX[1 << 18], AY[1 << 18];\n\nint BX[1 << 18], BY[1 << 18];\n\nint dx[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };\n\nint dy[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };\n\n\n\nmap, int> Map;\n\nint Nex[1 << 18][8];\n\nint Answer[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> T;\n\n\tfor (int i = 1; i <= N; i++) scanf(\"%d%d\", &AX[i], &AY[i]);\n\n\tfor (int i = 1; i <= N; i++) scanf(\"%d%d\", &BX[i], &BY[i]);\n\n\tfor (int i = 1; i <= N; i++) Map[make_pair(BX[i], BY[i])] = i;\n\n\n\n\t// Step #2. Add Edge\n\n\tatcoder::mf_graph Z(2 * N + 5);\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 0; j < 8; j++) {\n\n\t\t\tint tx = AX[i] + dx[j] * T;\n\n\t\t\tint ty = AY[i] + dy[j] * T;\n\n\t\t\tNex[i][j] = Map[make_pair(tx, ty)];\n\n\t\t\tif (Nex[i][j] != 0) {\n\n\t\t\t\tZ.add_edge(i, N + Nex[i][j], 1);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tfor (int i = 1; i <= N; i++) Z.add_edge(2 * N + 1, i, 1);\n\n\tfor (int i = 1; i <= N; i++) Z.add_edge(i + N, 2 * N + 2, 1);\n\n\n\n\t// Step #3. Max Flow\n\n\tint res = Z.flow(2 * N + 1, 2 * N + 2);\n\n\tif (res != N) {\n\n\t\tcout << \"No\" << endl;\n\n\t\treturn 0;\n\n\t}\n\n\n\n\t// Step #4. Get Answer\n\n\tfor (auto e : Z.edges()) {\n\n\t\tif (e.flow == 1) {\n\n\t\t\tint a = e.to;\n\n\t\t\tint b = e.from;\n\n\t\t\tif (!(a >= N + 1 && a <= 2 * N)) continue;\n\n\t\t\tif (!(b >= 1 && b <= N)) continue;\n\n\t\t\tfor (int k = 0; k < 8; k++) {\n\n\t\t\t\tif (Nex[b][k] == a - N) Answer[b] = k + 1;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #5. Output\n\n\tcout << \"Yes\" << endl;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i >= 2) cout << \" \";\n\n\t\tcout << Answer[i];\n\n\t}\n\n\tcout << endl;\n\n\treturn 0;\n\n}", "Crystal": "class BipartiteMatching\n getter left : Int32, right : Int32\n\n def initialize(@left, @right)\n @graph = Array(Array(Int32)).new(left) { [] of Int32 }\n @left_match = Array(Int32?).new(left, nil)\n @right_match = Array(Int32?).new(right, nil)\n @used = Array(Bool).new(left, false)\n end\n\n def add_edge(l : Int32, r : Int32)\n @graph[l] << r\n end\n\n private def dfs(v : Int32) : Bool\n return false if @used[v]\n @used[v] = true\n @graph[v].each do |edge|\n if @right_match[edge].nil? || dfs(@right_match[edge].not_nil!)\n @left_match[v], @right_match[edge] = edge, v\n return true\n end\n end\n false\n end\n\n def solve : Int32\n while (0...left).reduce(false) { |update, i|\n update | (@left_match[i].nil? && dfs(i))\n }\n @used.fill(false)\n end\n left - @left_match.count(&.nil?)\n end\n\n def each_edge(&block) : Nil\n (0...left).each do |i|\n if j = @left_match[i]\n yield i, j\n end\n end\n end\n\n def each_edge\n (0...left).each.select { |i| @left_match[i] }.map { |i|\n {i, @left_match[i].not_nil!}\n }\n end\nend\n\nrecord Point, x : Int32, y : Int32 do\n def +(other : Point)\n Point.new(x + other.x, y + other.y)\n end\n\n def -(other : Point)\n Point.new(x - other.x, y - other.y)\n end\n\n def *(n : Int32)\n Point.new(x * n, y * n)\n end\n\n def //(n : Int32)\n Point.new(x // n, y // n)\n end\nend\n\nDirection = [\n {1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1},\n].map { |x, y| Point.new(x, y) }\n\nn, t = read_line.split.map(&.to_i)\na, b = {0, 1}.map {\n Array.new(n) {\n x, y = read_line.split.map(&.to_i)\n Point.new x, y\n }\n}\n\nhash = b.zip(0..).to_h\ng = BipartiteMatching.new(n, n)\na.each_with_index do |p, i|\n Direction.each do |dir|\n if j = hash[p + dir * t]?\n g.add_edge(i, j)\n end\n end\nend\n\nif g.solve == n\n puts \"Yes\", g.each_edge.join(' ') { |from, to|\n Direction.index((b[to] - a[from]) // t).not_nil!.succ\n }\nelse\n puts \"No\"\nend\n" }, { "id": 410, "name": "077", "C++": "#include \n\n#include \n\n#include \n\n#include \n\n#include \n\n#include \n\nusing namespace std;\n\n#pragma warning (disable: 4996)\n\n\n\nint N, T;\n\nint AX[1 << 18], AY[1 << 18];\n\nint BX[1 << 18], BY[1 << 18];\n\nint dx[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };\n\nint dy[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };\n\n\n\nmap, int> Map;\n\nint Nex[1 << 18][8];\n\nint Answer[1 << 18];\n\n\n\nint main() {\n\n\t// Step #1. Input\n\n\tcin >> N >> T;\n\n\tfor (int i = 1; i <= N; i++) scanf(\"%d%d\", &AX[i], &AY[i]);\n\n\tfor (int i = 1; i <= N; i++) scanf(\"%d%d\", &BX[i], &BY[i]);\n\n\tfor (int i = 1; i <= N; i++) Map[make_pair(BX[i], BY[i])] = i;\n\n\n\n\t// Step #2. Add Edge\n\n\tatcoder::mf_graph Z(2 * N + 5);\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tfor (int j = 0; j < 8; j++) {\n\n\t\t\tint tx = AX[i] + dx[j] * T;\n\n\t\t\tint ty = AY[i] + dy[j] * T;\n\n\t\t\tNex[i][j] = Map[make_pair(tx, ty)];\n\n\t\t\tif (Nex[i][j] != 0) {\n\n\t\t\t\tZ.add_edge(i, N + Nex[i][j], 1);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tfor (int i = 1; i <= N; i++) Z.add_edge(2 * N + 1, i, 1);\n\n\tfor (int i = 1; i <= N; i++) Z.add_edge(i + N, 2 * N + 2, 1);\n\n\n\n\t// Step #3. Max Flow\n\n\tint res = Z.flow(2 * N + 1, 2 * N + 2);\n\n\tif (res != N) {\n\n\t\tcout << \"No\" << endl;\n\n\t\treturn 0;\n\n\t}\n\n\n\n\t// Step #4. Get Answer\n\n\tfor (auto e : Z.edges()) {\n\n\t\tif (e.flow == 1) {\n\n\t\t\tint a = e.to;\n\n\t\t\tint b = e.from;\n\n\t\t\tif (!(a >= N + 1 && a <= 2 * N)) continue;\n\n\t\t\tif (!(b >= 1 && b <= N)) continue;\n\n\t\t\tfor (int k = 0; k < 8; k++) {\n\n\t\t\t\tif (Nex[b][k] == a - N) Answer[b] = k + 1;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t// Step #5. Output\n\n\tcout << \"Yes\" << endl;\n\n\tfor (int i = 1; i <= N; i++) {\n\n\t\tif (i >= 2) cout << \" \";\n\n\t\tcout << Answer[i];\n\n\t}\n\n\tcout << endl;\n\n\treturn 0;\n\n}", "Python": "#移植https://atcoder.jp/contests/practice2/submissions/16897549\n\n# TODO: メモリリーク確認\n# TODO: min_cut, change_edge が正しく動くか確認\n\ncode_mf_graph = r\"\"\"\n#define PY_SSIZE_T_CLEAN\n#include \n#include \"structmember.h\"\n\n// 元のライブラリの private を剥がした\n\n// >>> AtCoder >>>\n\n#ifndef ATCODER_MAXFLOW_HPP\n#define ATCODER_MAXFLOW_HPP 1\n\n#include \n\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include \n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate struct simple_queue {\n std::vector payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n#include \n#include \n#include \n#include \n\nnamespace atcoder {\n\ntemplate struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector edges() {\n int m = int(pos.size());\n std::vector result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector level(_n), iter(_n);\n internal::simple_queue que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector min_cut(int s) {\n std::vector visited(_n);\n internal::simple_queue que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n// private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector> pos;\n std::vector> g;\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_MAXFLOW_HPP\n\n// <<< AtCoder <<<\n\nusing namespace std;\nusing namespace atcoder;\n#define PARSE_ARGS(types, ...) if(!PyArg_ParseTuple(args, types, __VA_ARGS__)) return NULL\n\n\nstruct MFGraph{\n PyObject_HEAD\n mf_graph* graph;\n //unique_ptr> graph;\n};\n\nstruct MFGraphEdge{\n PyObject_HEAD\n mf_graph::edge* edge;\n //unique_ptr::edge> edge;\n};\n\n\nextern PyTypeObject MFGraphType;\nextern PyTypeObject MFGraphEdgeType;\n\n\n// >>> MFGraph definition >>>\n\nstatic void MFGraph_dealloc(MFGraph* self){\n delete self->graph;\n Py_TYPE(self)->tp_free((PyObject*)self);\n}\nstatic PyObject* MFGraph_new(PyTypeObject* type, PyObject* args, PyObject* kwds){\n MFGraph* self;\n self = (MFGraph*)type->tp_alloc(type, 0);\n return (PyObject*)self;\n}\nstatic int MFGraph_init(MFGraph* self, PyObject* args){\n long n;\n if(!PyArg_ParseTuple(args, \"l\", &n)) return -1;\n if(n < 0 || n > (long)1e8){\n PyErr_Format(PyExc_IndexError,\n \"constraint error in MFGraph constructor (constraint: 0<=n<=1e8, got n=%d)\", n);\n return -1;\n }\n //self->graph = make_unique>(n);\n self->graph = new mf_graph(n);\n return 0;\n}\nstatic PyObject* MFGraph_add_edge(MFGraph* self, PyObject* args){\n long from, to;\n long long cap;\n PARSE_ARGS(\"llL\", &from, &to, &cap);\n if(from < 0 || from >= self->graph->_n || to < 0 || to >= self->graph->_n){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph add_edge index out of range (n=%d, from=%d, to=%d)\", self->graph->_n, from, to);\n return (PyObject*)NULL;\n }\n if(from == to){\n PyErr_Format(PyExc_IndexError, \"got self-loop (from=%d, to=%d)\", from, to);\n return (PyObject*)NULL;\n }\n if(cap < 0){\n PyErr_Format(PyExc_IndexError, \"got negative cap (cap=%d)\", cap);\n return (PyObject*)NULL;\n }\n const int res = self->graph->add_edge(from, to, cap);\n return Py_BuildValue(\"l\", res);\n}\nstatic PyObject* MFGraph_flow(MFGraph* self, PyObject* args){\n long s, t;\n long long flow_limit = numeric_limits::max();\n PARSE_ARGS(\"ll|L\", &s, &t, &flow_limit);\n if(s < 0 || s >= self->graph->_n || t < 0 || t >= self->graph->_n){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph flow index out of range (n=%d, s=%d, t=%d)\", self->graph->_n, s, t);\n return (PyObject*)NULL;\n }\n if(s == t){\n PyErr_Format(PyExc_IndexError, \"got s == t (s=%d, t=%d)\", s, t);\n return (PyObject*)NULL;\n }\n const long long& flow = self->graph->flow(s, t, flow_limit);\n return Py_BuildValue(\"L\", flow);\n}\nstatic PyObject* MFGraph_min_cut(MFGraph* self, PyObject* args){\n long s;\n PARSE_ARGS(\"l\", &s);\n if(s < 0 || s >= self->graph->_n){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph min_cut index out of range (n=%d, s=%d)\", self->graph->_n, s);\n return (PyObject*)NULL;\n }\n const vector& vec = self->graph->min_cut(s);\n PyObject* list = PyList_New(vec.size());\n for(int i = 0; i < (int)vec.size(); i++){\n PyObject* b = vec[i] ? Py_True : Py_False;\n Py_INCREF(b);\n PyList_SET_ITEM(list, i, b);\n }\n return list;\n}\nstatic PyObject* MFGraph_get_edge(MFGraph* self, PyObject* args){\n long i;\n PARSE_ARGS(\"l\", &i);\n const int m = (int)self->graph->pos.size();\n if(i < 0 || i >= m){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph get_edge index out of range (m=%d, i=%d)\", m, i);\n return (PyObject*)NULL;\n }\n MFGraphEdge* edge = PyObject_NEW(MFGraphEdge, &MFGraphEdgeType);\n //edge->edge = make_unique::edge>(self->graph->get_edge(i)); // なぜか edge に値が入っていて詰まる\n edge->edge = new mf_graph::edge(self->graph->get_edge(i));\n return (PyObject*)edge;\n}\nstatic PyObject* MFGraph_edges(MFGraph* self, PyObject* args){\n const auto& edges = self->graph->edges();\n const int m = (int)edges.size();\n PyObject* list = PyList_New(m);\n for(int i = 0; i < m; i++){\n MFGraphEdge* edge = PyObject_NEW(MFGraphEdge, &MFGraphEdgeType);\n //edge->edge = make_unique::edge>(edges[i]);\n edge->edge = new mf_graph::edge(edges[i]);\n PyList_SET_ITEM(list, i, (PyObject*)edge);\n }\n return list;\n}\nstatic PyObject* MFGraph_change_edge(MFGraph* self, PyObject* args){\n long i;\n long long new_cap, new_flow;\n PARSE_ARGS(\"lLL\", &i, &new_cap, &new_flow);\n const int m = (int)self->graph->pos.size();\n if(i < 0 || i >= m){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph change_edge index out of range (m=%d, i=%d)\", m, i);\n return (PyObject*)NULL;\n }\n if(new_flow < 0 || new_cap < new_flow){\n PyErr_Format(\n PyExc_IndexError,\n \"MFGraph change_edge constraint error (constraint: 0<=new_flow<=new_cap, got new_flow=%lld, new_cap=%lld)\",\n new_flow, new_cap\n );\n return (PyObject*)NULL;\n }\n self->graph->change_edge(i, new_cap, new_flow);\n Py_RETURN_NONE;\n}\nstatic PyObject* MFGraph_repr(PyObject* self){\n PyObject* edges = MFGraph_edges((MFGraph*)self, NULL);\n PyObject* res = PyUnicode_FromFormat(\"MFGraph(%R)\", edges);\n Py_DECREF(edges);\n return res;\n}\nstatic PyMethodDef MFGraph_methods[] = {\n {\"add_edge\", (PyCFunction)MFGraph_add_edge, METH_VARARGS, \"Add edge\"},\n {\"flow\", (PyCFunction)MFGraph_flow, METH_VARARGS, \"Flow\"},\n {\"min_cut\", (PyCFunction)MFGraph_min_cut, METH_VARARGS, \"Get vertices those can be reached from source\"},\n {\"get_edge\", (PyCFunction)MFGraph_get_edge, METH_VARARGS, \"Get edge\"},\n {\"edges\", (PyCFunction)MFGraph_edges, METH_VARARGS, \"Get edges\"},\n {\"change_edge\", (PyCFunction)MFGraph_change_edge, METH_VARARGS, \"Change edge\"},\n {NULL} /* Sentinel */\n};\nPyTypeObject MFGraphType = {\n PyObject_HEAD_INIT(NULL)\n \"atcoder.MFGraph\", /*tp_name*/\n sizeof(MFGraph), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n (destructor)MFGraph_dealloc, /*tp_dealloc*/\n 0, /*tp_print*/\n 0, /*tp_getattr*/\n 0, /*tp_setattr*/\n 0, /*reserved*/\n MFGraph_repr, /*tp_repr*/\n 0, /*tp_as_number*/\n 0, /*tp_as_sequence*/\n 0, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n 0, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /*tp_flags*/\n 0, /*tp_doc*/\n 0, /*tp_traverse*/\n 0, /*tp_clear*/\n 0, /*tp_richcompare*/\n 0, /*tp_weaklistoffset*/\n 0, /*tp_iter*/\n 0, /*tp_iternext*/\n MFGraph_methods, /*tp_methods*/\n 0, /*tp_members*/\n 0, /*tp_getset*/\n 0, /*tp_base*/\n 0, /*tp_dict*/\n 0, /*tp_descr_get*/\n 0, /*tp_descr_set*/\n 0, /*tp_dictoffset*/\n (initproc)MFGraph_init, /*tp_init*/\n 0, /*tp_alloc*/\n MFGraph_new, /*tp_new*/\n 0, /*tp_free*/\n 0, /*tp_is_gc*/\n 0, /*tp_bases*/\n 0, /*tp_mro*/\n 0, /*tp_cache*/\n 0, /*tp_subclasses*/\n 0, /*tp_weaklist*/\n 0, /*tp_del*/\n 0, /*tp_version_tag*/\n 0, /*tp_finalize*/\n};\n\n// <<< MFGraph definition <<<\n\n\n// >>> MFGraphEdge definition >>>\n\nstatic void MFGraphEdge_dealloc(MFGraphEdge* self){\n delete self->edge;\n Py_TYPE(self)->tp_free((PyObject*)self);\n}\nstatic PyObject* MFGraphEdge_new(PyTypeObject* type, PyObject* args, PyObject* kwds){\n //MFGraphEdge* self;\n //self = (MFGraphEdge*)type->tp_alloc(type, 0);\n //return (PyObject*)self;\n return type->tp_alloc(type, 0);\n}\nstatic int MFGraphEdge_init(MFGraphEdge* self, PyObject* args){\n int from, to;\n long long cap, flow;\n if(!PyArg_ParseTuple(args, \"llLL\", &from, &to, &cap, &flow)) return -1;\n //self->edge = make_unique::edge>(mf_graph::edge{from, to, cap, flow});\n self->edge = new mf_graph::edge(mf_graph::edge{from, to, cap, flow});\n return 0;\n}\nstatic PyObject* MFGraphEdge_get_from(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLong(self->edge->from);\n}\nstatic PyObject* MFGraphEdge_get_to(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLong(self->edge->to);\n}\nstatic PyObject* MFGraphEdge_get_flow(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLongLong(self->edge->flow);\n}\nstatic PyObject* MFGraphEdge_get_cap(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLongLong(self->edge->cap);\n}\nstatic PyObject* MFGraphEdge_repr(PyObject* self){\n MFGraphEdge* self_ = (MFGraphEdge*)self;\n PyObject* res = PyUnicode_FromFormat(\"MFGraphEdge(%2d -> %2d, %2lld / %2lld)\",\n self_->edge->from, self_->edge->to, self_->edge->flow, self_->edge->cap);\n return res;\n}\nPyGetSetDef MFGraphEdge_getsets[] = {\n {\"from_\", (getter)MFGraphEdge_get_from, NULL, NULL, NULL},\n {\"to\", (getter)MFGraphEdge_get_to, NULL, NULL, NULL},\n {\"flow\", (getter)MFGraphEdge_get_flow, NULL, NULL, NULL},\n {\"cap\", (getter)MFGraphEdge_get_cap, NULL, NULL, NULL},\n {NULL}\n};\nPyTypeObject MFGraphEdgeType = {\n PyObject_HEAD_INIT(NULL)\n \"atcoder.MFGraphEdge\", /*tp_name*/\n sizeof(MFGraphEdge), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n (destructor)MFGraphEdge_dealloc, /*tp_dealloc*/\n 0, /*tp_print*/\n 0, /*tp_getattr*/\n 0, /*tp_setattr*/\n 0, /*reserved*/\n MFGraphEdge_repr, /*tp_repr*/\n 0, /*tp_as_number*/\n 0, /*tp_as_sequence*/\n 0, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n 0, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /*tp_flags*/\n 0, /*tp_doc*/\n 0, /*tp_traverse*/\n 0, /*tp_clear*/\n 0, /*tp_richcompare*/\n 0, /*tp_weaklistoffset*/\n 0, /*tp_iter*/\n 0, /*tp_iternext*/\n 0, /*tp_methods*/\n 0, /*tp_members*/\n MFGraphEdge_getsets, /*tp_getset*/\n 0, /*tp_base*/\n 0, /*tp_dict*/\n 0, /*tp_descr_get*/\n 0, /*tp_descr_set*/\n 0, /*tp_dictoffset*/\n (initproc)MFGraphEdge_init, /*tp_init*/\n 0, /*tp_alloc*/\n MFGraphEdge_new, /*tp_new*/\n 0, /*tp_free*/\n 0, /*tp_is_gc*/\n 0, /*tp_bases*/\n 0, /*tp_mro*/\n 0, /*tp_cache*/\n 0, /*tp_subclasses*/\n 0, /*tp_weaklist*/\n 0, /*tp_del*/\n 0, /*tp_version_tag*/\n 0, /*tp_finalize*/\n};\n\n// <<< MFGraphEdge definition <<<\n\n\nstatic PyModuleDef atcodermodule = {\n PyModuleDef_HEAD_INIT,\n \"atcoder\",\n NULL,\n -1,\n};\n\nPyMODINIT_FUNC PyInit_atcoder(void)\n{\n PyObject* m;\n if(PyType_Ready(&MFGraphType) < 0) return NULL;\n if(PyType_Ready(&MFGraphEdgeType) < 0) return NULL;\n\n m = PyModule_Create(&atcodermodule);\n if(m == NULL) return NULL;\n\n Py_INCREF(&MFGraphType);\n if (PyModule_AddObject(m, \"MFGraph\", (PyObject*)&MFGraphType) < 0) {\n Py_DECREF(&MFGraphType);\n Py_DECREF(m);\n return NULL;\n }\n \n Py_INCREF(&MFGraphEdgeType);\n if (PyModule_AddObject(m, \"MFGraphEdge\", (PyObject*)&MFGraphEdgeType) < 0) {\n Py_DECREF(&MFGraphEdgeType);\n Py_DECREF(m);\n return NULL;\n }\n return m;\n}\n\"\"\"\ncode_mf_graph_setup = r\"\"\"\nfrom distutils.core import setup, Extension\nmodule = Extension(\n \"atcoder\",\n sources=[\"mf_graph.cpp\"],\n extra_compile_args=[\"-O3\", \"-march=native\", \"-std=c++14\"]\n)\nsetup(\n name=\"atcoder-library\",\n version=\"0.0.1\",\n description=\"wrapper for atcoder library\",\n ext_modules=[module]\n)\n\"\"\"\n\nimport os\nimport sys\n\nif sys.argv[-1] == \"ONLINE_JUDGE\" or os.getcwd() != \"/imojudge/sandbox\":\n with open(\"mf_graph.cpp\", \"w\") as f:\n f.write(code_mf_graph)\n with open(\"mf_graph_setup.py\", \"w\") as f:\n f.write(code_mf_graph_setup)\n os.system(f\"{sys.executable} mf_graph_setup.py build_ext --inplace\")\n\nfrom atcoder import MFGraph, MFGraphEdge\n\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n n, t = map(int, input().split())\n axy = [tuple(map(int, input().split())) for i in range(n)]\n bxy = [tuple(map(int, input().split())) for i in range(n)]\n bxydic = {bxy[i]: i for i in range(n)}\n mf = MFGraph(2*n+2)\n movedic = {(1, 0): 1, (1, 1): 2, (0, 1): 3, (-1, 1): 4,\n (-1, 0): 5, (-1, -1): 6, (0, -1): 7, (1, -1): 8}\n for i, (ax, ay) in enumerate(axy):\n for dx, dy in movedic.keys():\n if (ax+t*dx, ay+t*dy) in bxydic:\n mf.add_edge(i, bxydic[(ax+t*dx, ay+t*dy)]+n, 1)\n mf.add_edge(2*n, i, 1)\n mf.add_edge(i+n, 2*n+1, 1)\n ans=mf.flow(2*n, 2*n+1)\n g=mf.edges()\n if ans != n:\n yn(0)\n else:\n yn(1)\n anslist=[0]*n\n for e in g:\n if e.flow == 0 or e.from_ == 2*n or e.to == 2*n+1:\n continue\n i=e.from_\n w=e.to\n ax,ay=axy[i]\n bx,by=bxy[w-n]\n anslist[i]=movedic[((bx-ax)//t,(by-ay)//t)]\n print(*anslist) \n \n \nif __name__ == '__main__':\n main()\n" }, { "id": 411, "name": "077", "Crystal": "class BipartiteMatching\n getter left : Int32, right : Int32\n\n def initialize(@left, @right)\n @graph = Array(Array(Int32)).new(left) { [] of Int32 }\n @left_match = Array(Int32?).new(left, nil)\n @right_match = Array(Int32?).new(right, nil)\n @used = Array(Bool).new(left, false)\n end\n\n def add_edge(l : Int32, r : Int32)\n @graph[l] << r\n end\n\n private def dfs(v : Int32) : Bool\n return false if @used[v]\n @used[v] = true\n @graph[v].each do |edge|\n if @right_match[edge].nil? || dfs(@right_match[edge].not_nil!)\n @left_match[v], @right_match[edge] = edge, v\n return true\n end\n end\n false\n end\n\n def solve : Int32\n while (0...left).reduce(false) { |update, i|\n update | (@left_match[i].nil? && dfs(i))\n }\n @used.fill(false)\n end\n left - @left_match.count(&.nil?)\n end\n\n def each_edge(&block) : Nil\n (0...left).each do |i|\n if j = @left_match[i]\n yield i, j\n end\n end\n end\n\n def each_edge\n (0...left).each.select { |i| @left_match[i] }.map { |i|\n {i, @left_match[i].not_nil!}\n }\n end\nend\n\nrecord Point, x : Int32, y : Int32 do\n def +(other : Point)\n Point.new(x + other.x, y + other.y)\n end\n\n def -(other : Point)\n Point.new(x - other.x, y - other.y)\n end\n\n def *(n : Int32)\n Point.new(x * n, y * n)\n end\n\n def //(n : Int32)\n Point.new(x // n, y // n)\n end\nend\n\nDirection = [\n {1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1},\n].map { |x, y| Point.new(x, y) }\n\nn, t = read_line.split.map(&.to_i)\na, b = {0, 1}.map {\n Array.new(n) {\n x, y = read_line.split.map(&.to_i)\n Point.new x, y\n }\n}\n\nhash = b.zip(0..).to_h\ng = BipartiteMatching.new(n, n)\na.each_with_index do |p, i|\n Direction.each do |dir|\n if j = hash[p + dir * t]?\n g.add_edge(i, j)\n end\n end\nend\n\nif g.solve == n\n puts \"Yes\", g.each_edge.join(' ') { |from, to|\n Direction.index((b[to] - a[from]) // t).not_nil!.succ\n }\nelse\n puts \"No\"\nend\n", "Python": "#移植https://atcoder.jp/contests/practice2/submissions/16897549\n\n# TODO: メモリリーク確認\n# TODO: min_cut, change_edge が正しく動くか確認\n\ncode_mf_graph = r\"\"\"\n#define PY_SSIZE_T_CLEAN\n#include \n#include \"structmember.h\"\n\n// 元のライブラリの private を剥がした\n\n// >>> AtCoder >>>\n\n#ifndef ATCODER_MAXFLOW_HPP\n#define ATCODER_MAXFLOW_HPP 1\n\n#include \n\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include \n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate struct simple_queue {\n std::vector payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n#include \n#include \n#include \n#include \n\nnamespace atcoder {\n\ntemplate struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector edges() {\n int m = int(pos.size());\n std::vector result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector level(_n), iter(_n);\n internal::simple_queue que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector min_cut(int s) {\n std::vector visited(_n);\n internal::simple_queue que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n// private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector> pos;\n std::vector> g;\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_MAXFLOW_HPP\n\n// <<< AtCoder <<<\n\nusing namespace std;\nusing namespace atcoder;\n#define PARSE_ARGS(types, ...) if(!PyArg_ParseTuple(args, types, __VA_ARGS__)) return NULL\n\n\nstruct MFGraph{\n PyObject_HEAD\n mf_graph* graph;\n //unique_ptr> graph;\n};\n\nstruct MFGraphEdge{\n PyObject_HEAD\n mf_graph::edge* edge;\n //unique_ptr::edge> edge;\n};\n\n\nextern PyTypeObject MFGraphType;\nextern PyTypeObject MFGraphEdgeType;\n\n\n// >>> MFGraph definition >>>\n\nstatic void MFGraph_dealloc(MFGraph* self){\n delete self->graph;\n Py_TYPE(self)->tp_free((PyObject*)self);\n}\nstatic PyObject* MFGraph_new(PyTypeObject* type, PyObject* args, PyObject* kwds){\n MFGraph* self;\n self = (MFGraph*)type->tp_alloc(type, 0);\n return (PyObject*)self;\n}\nstatic int MFGraph_init(MFGraph* self, PyObject* args){\n long n;\n if(!PyArg_ParseTuple(args, \"l\", &n)) return -1;\n if(n < 0 || n > (long)1e8){\n PyErr_Format(PyExc_IndexError,\n \"constraint error in MFGraph constructor (constraint: 0<=n<=1e8, got n=%d)\", n);\n return -1;\n }\n //self->graph = make_unique>(n);\n self->graph = new mf_graph(n);\n return 0;\n}\nstatic PyObject* MFGraph_add_edge(MFGraph* self, PyObject* args){\n long from, to;\n long long cap;\n PARSE_ARGS(\"llL\", &from, &to, &cap);\n if(from < 0 || from >= self->graph->_n || to < 0 || to >= self->graph->_n){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph add_edge index out of range (n=%d, from=%d, to=%d)\", self->graph->_n, from, to);\n return (PyObject*)NULL;\n }\n if(from == to){\n PyErr_Format(PyExc_IndexError, \"got self-loop (from=%d, to=%d)\", from, to);\n return (PyObject*)NULL;\n }\n if(cap < 0){\n PyErr_Format(PyExc_IndexError, \"got negative cap (cap=%d)\", cap);\n return (PyObject*)NULL;\n }\n const int res = self->graph->add_edge(from, to, cap);\n return Py_BuildValue(\"l\", res);\n}\nstatic PyObject* MFGraph_flow(MFGraph* self, PyObject* args){\n long s, t;\n long long flow_limit = numeric_limits::max();\n PARSE_ARGS(\"ll|L\", &s, &t, &flow_limit);\n if(s < 0 || s >= self->graph->_n || t < 0 || t >= self->graph->_n){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph flow index out of range (n=%d, s=%d, t=%d)\", self->graph->_n, s, t);\n return (PyObject*)NULL;\n }\n if(s == t){\n PyErr_Format(PyExc_IndexError, \"got s == t (s=%d, t=%d)\", s, t);\n return (PyObject*)NULL;\n }\n const long long& flow = self->graph->flow(s, t, flow_limit);\n return Py_BuildValue(\"L\", flow);\n}\nstatic PyObject* MFGraph_min_cut(MFGraph* self, PyObject* args){\n long s;\n PARSE_ARGS(\"l\", &s);\n if(s < 0 || s >= self->graph->_n){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph min_cut index out of range (n=%d, s=%d)\", self->graph->_n, s);\n return (PyObject*)NULL;\n }\n const vector& vec = self->graph->min_cut(s);\n PyObject* list = PyList_New(vec.size());\n for(int i = 0; i < (int)vec.size(); i++){\n PyObject* b = vec[i] ? Py_True : Py_False;\n Py_INCREF(b);\n PyList_SET_ITEM(list, i, b);\n }\n return list;\n}\nstatic PyObject* MFGraph_get_edge(MFGraph* self, PyObject* args){\n long i;\n PARSE_ARGS(\"l\", &i);\n const int m = (int)self->graph->pos.size();\n if(i < 0 || i >= m){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph get_edge index out of range (m=%d, i=%d)\", m, i);\n return (PyObject*)NULL;\n }\n MFGraphEdge* edge = PyObject_NEW(MFGraphEdge, &MFGraphEdgeType);\n //edge->edge = make_unique::edge>(self->graph->get_edge(i)); // なぜか edge に値が入っていて詰まる\n edge->edge = new mf_graph::edge(self->graph->get_edge(i));\n return (PyObject*)edge;\n}\nstatic PyObject* MFGraph_edges(MFGraph* self, PyObject* args){\n const auto& edges = self->graph->edges();\n const int m = (int)edges.size();\n PyObject* list = PyList_New(m);\n for(int i = 0; i < m; i++){\n MFGraphEdge* edge = PyObject_NEW(MFGraphEdge, &MFGraphEdgeType);\n //edge->edge = make_unique::edge>(edges[i]);\n edge->edge = new mf_graph::edge(edges[i]);\n PyList_SET_ITEM(list, i, (PyObject*)edge);\n }\n return list;\n}\nstatic PyObject* MFGraph_change_edge(MFGraph* self, PyObject* args){\n long i;\n long long new_cap, new_flow;\n PARSE_ARGS(\"lLL\", &i, &new_cap, &new_flow);\n const int m = (int)self->graph->pos.size();\n if(i < 0 || i >= m){\n PyErr_Format(PyExc_IndexError,\n \"MFGraph change_edge index out of range (m=%d, i=%d)\", m, i);\n return (PyObject*)NULL;\n }\n if(new_flow < 0 || new_cap < new_flow){\n PyErr_Format(\n PyExc_IndexError,\n \"MFGraph change_edge constraint error (constraint: 0<=new_flow<=new_cap, got new_flow=%lld, new_cap=%lld)\",\n new_flow, new_cap\n );\n return (PyObject*)NULL;\n }\n self->graph->change_edge(i, new_cap, new_flow);\n Py_RETURN_NONE;\n}\nstatic PyObject* MFGraph_repr(PyObject* self){\n PyObject* edges = MFGraph_edges((MFGraph*)self, NULL);\n PyObject* res = PyUnicode_FromFormat(\"MFGraph(%R)\", edges);\n Py_DECREF(edges);\n return res;\n}\nstatic PyMethodDef MFGraph_methods[] = {\n {\"add_edge\", (PyCFunction)MFGraph_add_edge, METH_VARARGS, \"Add edge\"},\n {\"flow\", (PyCFunction)MFGraph_flow, METH_VARARGS, \"Flow\"},\n {\"min_cut\", (PyCFunction)MFGraph_min_cut, METH_VARARGS, \"Get vertices those can be reached from source\"},\n {\"get_edge\", (PyCFunction)MFGraph_get_edge, METH_VARARGS, \"Get edge\"},\n {\"edges\", (PyCFunction)MFGraph_edges, METH_VARARGS, \"Get edges\"},\n {\"change_edge\", (PyCFunction)MFGraph_change_edge, METH_VARARGS, \"Change edge\"},\n {NULL} /* Sentinel */\n};\nPyTypeObject MFGraphType = {\n PyObject_HEAD_INIT(NULL)\n \"atcoder.MFGraph\", /*tp_name*/\n sizeof(MFGraph), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n (destructor)MFGraph_dealloc, /*tp_dealloc*/\n 0, /*tp_print*/\n 0, /*tp_getattr*/\n 0, /*tp_setattr*/\n 0, /*reserved*/\n MFGraph_repr, /*tp_repr*/\n 0, /*tp_as_number*/\n 0, /*tp_as_sequence*/\n 0, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n 0, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /*tp_flags*/\n 0, /*tp_doc*/\n 0, /*tp_traverse*/\n 0, /*tp_clear*/\n 0, /*tp_richcompare*/\n 0, /*tp_weaklistoffset*/\n 0, /*tp_iter*/\n 0, /*tp_iternext*/\n MFGraph_methods, /*tp_methods*/\n 0, /*tp_members*/\n 0, /*tp_getset*/\n 0, /*tp_base*/\n 0, /*tp_dict*/\n 0, /*tp_descr_get*/\n 0, /*tp_descr_set*/\n 0, /*tp_dictoffset*/\n (initproc)MFGraph_init, /*tp_init*/\n 0, /*tp_alloc*/\n MFGraph_new, /*tp_new*/\n 0, /*tp_free*/\n 0, /*tp_is_gc*/\n 0, /*tp_bases*/\n 0, /*tp_mro*/\n 0, /*tp_cache*/\n 0, /*tp_subclasses*/\n 0, /*tp_weaklist*/\n 0, /*tp_del*/\n 0, /*tp_version_tag*/\n 0, /*tp_finalize*/\n};\n\n// <<< MFGraph definition <<<\n\n\n// >>> MFGraphEdge definition >>>\n\nstatic void MFGraphEdge_dealloc(MFGraphEdge* self){\n delete self->edge;\n Py_TYPE(self)->tp_free((PyObject*)self);\n}\nstatic PyObject* MFGraphEdge_new(PyTypeObject* type, PyObject* args, PyObject* kwds){\n //MFGraphEdge* self;\n //self = (MFGraphEdge*)type->tp_alloc(type, 0);\n //return (PyObject*)self;\n return type->tp_alloc(type, 0);\n}\nstatic int MFGraphEdge_init(MFGraphEdge* self, PyObject* args){\n int from, to;\n long long cap, flow;\n if(!PyArg_ParseTuple(args, \"llLL\", &from, &to, &cap, &flow)) return -1;\n //self->edge = make_unique::edge>(mf_graph::edge{from, to, cap, flow});\n self->edge = new mf_graph::edge(mf_graph::edge{from, to, cap, flow});\n return 0;\n}\nstatic PyObject* MFGraphEdge_get_from(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLong(self->edge->from);\n}\nstatic PyObject* MFGraphEdge_get_to(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLong(self->edge->to);\n}\nstatic PyObject* MFGraphEdge_get_flow(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLongLong(self->edge->flow);\n}\nstatic PyObject* MFGraphEdge_get_cap(MFGraphEdge* self, PyObject* args){\n return PyLong_FromLongLong(self->edge->cap);\n}\nstatic PyObject* MFGraphEdge_repr(PyObject* self){\n MFGraphEdge* self_ = (MFGraphEdge*)self;\n PyObject* res = PyUnicode_FromFormat(\"MFGraphEdge(%2d -> %2d, %2lld / %2lld)\",\n self_->edge->from, self_->edge->to, self_->edge->flow, self_->edge->cap);\n return res;\n}\nPyGetSetDef MFGraphEdge_getsets[] = {\n {\"from_\", (getter)MFGraphEdge_get_from, NULL, NULL, NULL},\n {\"to\", (getter)MFGraphEdge_get_to, NULL, NULL, NULL},\n {\"flow\", (getter)MFGraphEdge_get_flow, NULL, NULL, NULL},\n {\"cap\", (getter)MFGraphEdge_get_cap, NULL, NULL, NULL},\n {NULL}\n};\nPyTypeObject MFGraphEdgeType = {\n PyObject_HEAD_INIT(NULL)\n \"atcoder.MFGraphEdge\", /*tp_name*/\n sizeof(MFGraphEdge), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n (destructor)MFGraphEdge_dealloc, /*tp_dealloc*/\n 0, /*tp_print*/\n 0, /*tp_getattr*/\n 0, /*tp_setattr*/\n 0, /*reserved*/\n MFGraphEdge_repr, /*tp_repr*/\n 0, /*tp_as_number*/\n 0, /*tp_as_sequence*/\n 0, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n 0, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /*tp_flags*/\n 0, /*tp_doc*/\n 0, /*tp_traverse*/\n 0, /*tp_clear*/\n 0, /*tp_richcompare*/\n 0, /*tp_weaklistoffset*/\n 0, /*tp_iter*/\n 0, /*tp_iternext*/\n 0, /*tp_methods*/\n 0, /*tp_members*/\n MFGraphEdge_getsets, /*tp_getset*/\n 0, /*tp_base*/\n 0, /*tp_dict*/\n 0, /*tp_descr_get*/\n 0, /*tp_descr_set*/\n 0, /*tp_dictoffset*/\n (initproc)MFGraphEdge_init, /*tp_init*/\n 0, /*tp_alloc*/\n MFGraphEdge_new, /*tp_new*/\n 0, /*tp_free*/\n 0, /*tp_is_gc*/\n 0, /*tp_bases*/\n 0, /*tp_mro*/\n 0, /*tp_cache*/\n 0, /*tp_subclasses*/\n 0, /*tp_weaklist*/\n 0, /*tp_del*/\n 0, /*tp_version_tag*/\n 0, /*tp_finalize*/\n};\n\n// <<< MFGraphEdge definition <<<\n\n\nstatic PyModuleDef atcodermodule = {\n PyModuleDef_HEAD_INIT,\n \"atcoder\",\n NULL,\n -1,\n};\n\nPyMODINIT_FUNC PyInit_atcoder(void)\n{\n PyObject* m;\n if(PyType_Ready(&MFGraphType) < 0) return NULL;\n if(PyType_Ready(&MFGraphEdgeType) < 0) return NULL;\n\n m = PyModule_Create(&atcodermodule);\n if(m == NULL) return NULL;\n\n Py_INCREF(&MFGraphType);\n if (PyModule_AddObject(m, \"MFGraph\", (PyObject*)&MFGraphType) < 0) {\n Py_DECREF(&MFGraphType);\n Py_DECREF(m);\n return NULL;\n }\n \n Py_INCREF(&MFGraphEdgeType);\n if (PyModule_AddObject(m, \"MFGraphEdge\", (PyObject*)&MFGraphEdgeType) < 0) {\n Py_DECREF(&MFGraphEdgeType);\n Py_DECREF(m);\n return NULL;\n }\n return m;\n}\n\"\"\"\ncode_mf_graph_setup = r\"\"\"\nfrom distutils.core import setup, Extension\nmodule = Extension(\n \"atcoder\",\n sources=[\"mf_graph.cpp\"],\n extra_compile_args=[\"-O3\", \"-march=native\", \"-std=c++14\"]\n)\nsetup(\n name=\"atcoder-library\",\n version=\"0.0.1\",\n description=\"wrapper for atcoder library\",\n ext_modules=[module]\n)\n\"\"\"\n\nimport os\nimport sys\n\nif sys.argv[-1] == \"ONLINE_JUDGE\" or os.getcwd() != \"/imojudge/sandbox\":\n with open(\"mf_graph.cpp\", \"w\") as f:\n f.write(code_mf_graph)\n with open(\"mf_graph_setup.py\", \"w\") as f:\n f.write(code_mf_graph_setup)\n os.system(f\"{sys.executable} mf_graph_setup.py build_ext --inplace\")\n\nfrom atcoder import MFGraph, MFGraphEdge\n\ndef yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)\n\ndef main():\n mod = 10**9+7\n mod2 = 998244353\n n, t = map(int, input().split())\n axy = [tuple(map(int, input().split())) for i in range(n)]\n bxy = [tuple(map(int, input().split())) for i in range(n)]\n bxydic = {bxy[i]: i for i in range(n)}\n mf = MFGraph(2*n+2)\n movedic = {(1, 0): 1, (1, 1): 2, (0, 1): 3, (-1, 1): 4,\n (-1, 0): 5, (-1, -1): 6, (0, -1): 7, (1, -1): 8}\n for i, (ax, ay) in enumerate(axy):\n for dx, dy in movedic.keys():\n if (ax+t*dx, ay+t*dy) in bxydic:\n mf.add_edge(i, bxydic[(ax+t*dx, ay+t*dy)]+n, 1)\n mf.add_edge(2*n, i, 1)\n mf.add_edge(i+n, 2*n+1, 1)\n ans=mf.flow(2*n, 2*n+1)\n g=mf.edges()\n if ans != n:\n yn(0)\n else:\n yn(1)\n anslist=[0]*n\n for e in g:\n if e.flow == 0 or e.from_ == 2*n or e.to == 2*n+1:\n continue\n i=e.from_\n w=e.to\n ax,ay=axy[i]\n bx,by=bxy[w-n]\n anslist[i]=movedic[((bx-ax)//t,(by-ay)//t)]\n print(*anslist) \n \n \nif __name__ == '__main__':\n main()\n" }, { "id": 412, "name": "078", "Crystal": "n, m = read_line.split.map(&.to_i)\ngraph = Array.new(n) { [] of Int32 }\nm.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph[a] << b\n graph[b] << a\nend\nputs graph.each_with_index.count { |a, i|\n a.one? { |j| i > j }\n}\n", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint N, M;\n\n\tcin >> N >> M;\n\n\tvector > G(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tint a, b;\n\n\t\tcin >> a >> b; --a, --b;\n\n\t\tG[a].push_back(b);\n\n\t\tG[b].push_back(a);\n\n\t}\n\n\tint answer = 0;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint cnt = 0;\n\n\t\tfor (int j : G[i]) {\n\n\t\t\tif (j < i) {\n\n\t\t\t\t++cnt;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (cnt == 1) {\n\n\t\t\t++answer;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}" }, { "id": 413, "name": "078", "Crystal": "n, m = read_line.split.map(&.to_i)\ngraph = Array.new(n) { [] of Int32 }\nm.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph[a] << b\n graph[b] << a\nend\nputs graph.each_with_index.count { |a, i|\n a.one? { |j| i > j }\n}\n", "Python": "n, m = map(int,input().split())\nans = [0] * n\nfor i in range(m):\n a, b = map(int,input().split())\n if a < b:\n ans[b - 1] += 1\n else:\n ans[a - 1] += 1\n\n# 自分より小さい頂点が１つしかないものをカウントする\nprint(ans.count(1))" }, { "id": 414, "name": "078", "Crystal": "n, m = read_line.split.map(&.to_i)\ngraph = Array.new(n) { [] of Int32 }\nm.times do\n a, b = read_line.split.map(&.to_i.pred)\n graph[a] << b\n graph[b] << a\nend\nputs graph.each_with_index.count { |a, i|\n a.one? { |j| i > j }\n}\n", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar nums: []int :: #[n]int\n\tfor i(0, m - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tif(a < b)\n\t\t\tdo nums[b] :+ 1\n\t\telse\n\t\t\tdo nums[a] :+ 1\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tif(nums[i] = 1)\n\t\t\tdo ans :+ 1\n\t\tend if\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 415, "name": "078", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint N, M;\n\n\tcin >> N >> M;\n\n\tvector > G(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tint a, b;\n\n\t\tcin >> a >> b; --a, --b;\n\n\t\tG[a].push_back(b);\n\n\t\tG[b].push_back(a);\n\n\t}\n\n\tint answer = 0;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint cnt = 0;\n\n\t\tfor (int j : G[i]) {\n\n\t\t\tif (j < i) {\n\n\t\t\t\t++cnt;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (cnt == 1) {\n\n\t\t\t++answer;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Python": "n, m = map(int,input().split())\nans = [0] * n\nfor i in range(m):\n a, b = map(int,input().split())\n if a < b:\n ans[b - 1] += 1\n else:\n ans[a - 1] += 1\n\n# 自分より小さい頂点が１つしかないものをカウントする\nprint(ans.count(1))" }, { "id": 416, "name": "078", "C++": "#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint N, M;\n\n\tcin >> N >> M;\n\n\tvector > G(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\n\t\tint a, b;\n\n\t\tcin >> a >> b; --a, --b;\n\n\t\tG[a].push_back(b);\n\n\t\tG[b].push_back(a);\n\n\t}\n\n\tint answer = 0;\n\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tint cnt = 0;\n\n\t\tfor (int j : G[i]) {\n\n\t\t\tif (j < i) {\n\n\t\t\t\t++cnt;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif (cnt == 1) {\n\n\t\t\t++answer;\n\n\t\t}\n\n\t}\n\n\tcout << answer << endl;\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar nums: []int :: #[n]int\n\tfor i(0, m - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tif(a < b)\n\t\t\tdo nums[b] :+ 1\n\t\telse\n\t\t\tdo nums[a] :+ 1\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tif(nums[i] = 1)\n\t\t\tdo ans :+ 1\n\t\tend if\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 417, "name": "078", "Python": "n, m = map(int,input().split())\nans = [0] * n\nfor i in range(m):\n a, b = map(int,input().split())\n if a < b:\n ans[b - 1] += 1\n else:\n ans[a - 1] += 1\n\n# 自分より小さい頂点が１つしかないものをカウントする\nprint(ans.count(1))", "Kuin": "func main()\n\tvar n: int :: cui@inputInt()\n\tvar m: int :: cui@inputInt()\n\tvar nums: []int :: #[n]int\n\tfor i(0, m - 1)\n\t\tvar a: int :: cui@inputInt() - 1\n\t\tvar b: int :: cui@inputInt() - 1\n\t\tif(a < b)\n\t\t\tdo nums[b] :+ 1\n\t\telse\n\t\t\tdo nums[a] :+ 1\n\t\tend if\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor i(0, n - 1)\n\t\tif(nums[i] = 1)\n\t\t\tdo ans :+ 1\n\t\tend if\n\tend for\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 418, "name": "079", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint H, W;\n\n\tcin >> H >> W;\n\n\tvector > A(H, vector(W)), B(H, vector(W));\n\n\tfor (int i = 0; i < H; ++i) {\n\n\t\tfor (int j = 0; j < W; ++j) {\n\n\t\t\tcin >> A[i][j];\n\n\t\t}\n\n\t}\n\n\tfor (int i = 0; i < H; ++i) {\n\n\t\tfor (int j = 0; j < W; ++j) {\n\n\t\t\tcin >> B[i][j];\n\n\t\t}\n\n\t}\n\n\tlong long ans = 0;\n\n\tfor (int i = 0; i < H - 1; ++i) {\n\n\t\tfor (int j = 0; j < W - 1; ++j) {\n\n\t\t\tint d = B[i][j] - A[i][j];\n\n\t\t\tA[i][j] += d;\n\n\t\t\tA[i][j + 1] += d;\n\n\t\t\tA[i + 1][j] += d;\n\n\t\t\tA[i + 1][j + 1] += d;\n\n\t\t\tans += abs(d);\n\n\t\t}\n\n\t}\n\n\tif (A == B) {\n\n\t\tcout << \"Yes\" << endl;\n\n\t\tcout << ans << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << \"No\" << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i64) }\nb = (1..h).map { read_line.split.map(&.to_i64) }\ncnt = (0...h - 1).sum { |i|\n (0...w - 1).sum { |j|\n x = b[i][j] - a[i][j]\n [i, i + 1].product([j, j + 1]) { |i2, j2|\n a[i2][j2] += x\n }\n x.abs\n }\n}\nif a == b\n puts \"Yes\", cnt\nelse\n puts \"No\"\nend\n" }, { "id": 419, "name": "079", "C++": "#include \n\n#include \n\n#include \n\nusing namespace std;\n\nint main() {\n\n\tint H, W;\n\n\tcin >> H >> W;\n\n\tvector > A(H, vector(W)), B(H, vector(W));\n\n\tfor (int i = 0; i < H; ++i) {\n\n\t\tfor (int j = 0; j < W; ++j) {\n\n\t\t\tcin >> A[i][j];\n\n\t\t}\n\n\t}\n\n\tfor (int i = 0; i < H; ++i) {\n\n\t\tfor (int j = 0; j < W; ++j) {\n\n\t\t\tcin >> B[i][j];\n\n\t\t}\n\n\t}\n\n\tlong long ans = 0;\n\n\tfor (int i = 0; i < H - 1; ++i) {\n\n\t\tfor (int j = 0; j < W - 1; ++j) {\n\n\t\t\tint d = B[i][j] - A[i][j];\n\n\t\t\tA[i][j] += d;\n\n\t\t\tA[i][j + 1] += d;\n\n\t\t\tA[i + 1][j] += d;\n\n\t\t\tA[i + 1][j + 1] += d;\n\n\t\t\tans += abs(d);\n\n\t\t}\n\n\t}\n\n\tif (A == B) {\n\n\t\tcout << \"Yes\" << endl;\n\n\t\tcout << ans << endl;\n\n\t}\n\n\telse {\n\n\t\tcout << \"No\" << endl;\n\n\t}\n\n\treturn 0;\n\n}", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar a: [][]int :: #[h, w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :: cui@inputInt()\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :- cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tif(x = w - 1 | y = h - 1)\n\t\t\t\tif(a[y][x] <> 0)\n\t\t\t\t\tdo cui@print(\"No\\n\")\n\t\t\t\t\tret\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tvar v: int :: a[y][x]\n\t\t\t\tdo ans :+ v.abs()\n\t\t\t\tdo a[y][x + 1] :- v\n\t\t\t\tdo a[y + 1][x] :- v\n\t\t\t\tdo a[y + 1][x + 1] :- v\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tdo cui@print(\"Yes\\n\")\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 420, "name": "079", "Crystal": "h, w = read_line.split.map(&.to_i)\na = (1..h).map { read_line.split.map(&.to_i64) }\nb = (1..h).map { read_line.split.map(&.to_i64) }\ncnt = (0...h - 1).sum { |i|\n (0...w - 1).sum { |j|\n x = b[i][j] - a[i][j]\n [i, i + 1].product([j, j + 1]) { |i2, j2|\n a[i2][j2] += x\n }\n x.abs\n }\n}\nif a == b\n puts \"Yes\", cnt\nelse\n puts \"No\"\nend\n", "Kuin": "func main()\n\tvar h: int :: cui@inputInt()\n\tvar w: int :: cui@inputInt()\n\tvar a: [][]int :: #[h, w]int\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :: cui@inputInt()\n\t\tend for\n\tend for\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tdo a[y][x] :- cui@inputInt()\n\t\tend for\n\tend for\n\t\n\tvar ans: int :: 0\n\tfor y(0, h - 1)\n\t\tfor x(0, w - 1)\n\t\t\tif(x = w - 1 | y = h - 1)\n\t\t\t\tif(a[y][x] <> 0)\n\t\t\t\t\tdo cui@print(\"No\\n\")\n\t\t\t\t\tret\n\t\t\t\tend if\n\t\t\telse\n\t\t\t\tvar v: int :: a[y][x]\n\t\t\t\tdo ans :+ v.abs()\n\t\t\t\tdo a[y][x + 1] :- v\n\t\t\t\tdo a[y + 1][x] :- v\n\t\t\t\tdo a[y + 1][x + 1] :- v\n\t\t\tend if\n\t\tend for\n\tend for\n\t\n\tdo cui@print(\"Yes\\n\")\n\tdo cui@print(\"\\{ans}\\n\")\nend func\n" }, { "id": 421, "name": "080", "Crystal": "n, d = read_line.split.map(&.to_i)\na = read_line.split.map(&.to_i64)\nputs (0...1 << n).sum { |bit|\n x = a.each_with_index.reduce(0i64) { |acc, (x, i)|\n bit.bit(i) == 1 ? acc | x : acc\n }.popcount\n y = 1i64 << (d - x)\n bit.popcount.even? ? y : -y\n}\n", "C++": "#include \nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n ll N, D;\n cin >> N >> D;\n vector A(N);\n for (ll i = 0; i < N; i++)\n {\n cin >> A.at(i);\n }\n \n // addB := d 番目のビットを立てたときに条件が満たされる i の集合\n vector addB(D, 0);\n for (ll d = 0; d < D; d++)\n {\n for (ll i = 0; i < N; i++)\n {\n if (A.at(i) & (1LL << d))\n addB.at(d) |= (1LL << i);\n }\n }\n\n // dp[d][b] := d 番目のビットまで立てるか立てないかを見たときの条件が満たされている i の集合が b であるようなビットの立て方の個数\n vector> dp(D + 1, vector((1LL << N), 0));\n dp.at(0).at(0) = 1;\n for (ll d = 0; d < D; d++)\n {\n for (ll b = 0; b < (1LL << N); b++)\n {\n // ビットを立てない\n dp.at(d + 1).at(b) += dp.at(d).at(b);\n\n // ビットを立てる\n ll nb = b | addB.at(d);\n dp.at(d + 1).at(nb) += dp.at(d).at(b);\n }\n }\n\n cout << dp.at(D).at((1LL << N) - 1) << endl;\n}\n" } ]