結果
問題 | No.464 PPAP |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-12-15 23:02:37 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 7,195 bytes |
コンパイル時間 | 1,227 ms |
コンパイル使用メモリ | 111,488 KB |
実行使用メモリ | 17,664 KB |
最終ジャッジ日時 | 2024-11-30 08:55:02 |
合計ジャッジ時間 | 2,758 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 22 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Point = System.Numerics.Complex; using Number = System.Int64; using C = System.Int32; namespace Program { public class Solver { public void Solve() { var s = sc.Scan(); var n = s.Length; var plen = StringEx.ManacherWithEven(s); Debug.WriteLine(plen.AsJoinedString()); var pl = new long[n+1]; var pp = new long[n+1]; var pr = new long[n+3]; for (int i = 0; i < n; i++) { var odd = plen[i * 2]; for (int k = 0; k < odd; k++) { var l = i - k; var r = i + k; if (l == 0) pl[r]++; if (l > 0) pp[r] += pl[l - 1]; if (r == n - 1) pr[l]++; } var even = plen[i * 2 + 1]; for (int k = 0; k < even; k++) { var l = i - k; var r = i+k+1; if (l == 0) pl[r]++; if (l > 0) pp[r] += pl[l - 1]; if (r == n - 1) pr[l]++; } } Debug.WriteLine(pl.AsJoinedString()); Debug.WriteLine(pp.AsJoinedString()); Debug.WriteLine(pr.AsJoinedString()); for (int i = n - 1; i >= 0; i--) pr[i] += pr[i + 1]; var ans = 0L; for (int i = 0; i < n; i++) ans += pp[i] * pr[i + 2]; IO.Printer.Out.WriteLine(ans); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer: StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region Manacher static public partial class StringEx { /// <summary>s[i]を中心とする最長回文の半径を求める.O(|S|)</summary> /// <returns>R[i]=iを中心とする最長回文の半径</returns> static public int[] Manacher(string s) { var R = new int[s.Length]; int i = 0, j = 0; while (i < s.Length) { while (i - j >= 0 && i + j < s.Length && s[i - j] == s[i + j]) ++j; R[i] = j; int k = 1; while (i - k >= 0 && i + k < s.Length && k + R[i - k] < j) { R[i + k] = R[i - k]; ++k; } i += k; j -= k; } return R; } /// <summary>s[i]を中心とする最長回文の半径を(偶数長のものも含めて)求める.O(|S|)</summary> /// <returns>ret[i]=i/2を中心とする最長回文の半径.iが奇数のときは偶数長</returns> static public int[] ManacherWithEven(string s) { var sb = new System.Text.StringBuilder(); foreach (var x in s) { sb.Append(x); sb.Append('$'); } var t = sb.ToString(); Debug.WriteLine(t); var ret = Manacher(t); for (int i = 1; i < ret.Length; i += 2) ret[i] = ret[i] / 2; var ret2 = Manacher(s); for (int i = 0; i < ret.Length; i += 2) ret[i] = ret2[i / 2]; return ret; } } #endregion