#1191776 (C#) No.749 クエリ全部盛り

• 問題: No.749 クエリ全部盛り
• ユーザー: 👑 kakel-san
• 提出日時: 2026-10-06 22:08:50
• 言語: C# (.NET 10.0.400 + ACL)
• 結果: AC
• 実行時間: 1,473 ms / 3,000 ms
• コード長: 4,734 bytes
• コンパイル時間: 6,838 ms
• コンパイル使用メモリ: 172,788 KB
• 実行使用メモリ: 271,596 KB
• 最終ジャッジ日時: 2026-10-06 22:09:13
• 合計ジャッジ時間: 17,598 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_1

ファイルパターン	結果
other	AC * 20

コンパイルメッセージ

  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (176 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net10.0/main.dll
  main -> /home/judge/data/code/bin/Release/net10.0/publish/

ソースコード

using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, q) = (c[0], c[1]);
        var query = NArr(q);
        WriteLine(string.Join("\n", Queries(n, q, query)));
    }
    static List<long> Queries(int n, int q, int[][] query)
    {
        var init = new Info[n];
        for (var i = 0; i < n; ++i) init[i] = new Info(0, i, 0, 1);
        {
            var fib = new long[n];
            if (n > 1) fib[1] = 1;
            for (var i = 2; i < n; ++i) fib[i] = (fib[i - 2] + fib[i - 1]) % mod;
            FibDic.Add(fib);
        }
        var width = 2;
        while (width <= n)
        {
            var prev = FibDic[^1];
            var nfib = new long[n];
            for (var i = 0; i < nfib.Length; i += width)
            {
                if (i + width / 2 < n) nfib[i] = (prev[i] + prev[i + width / 2]) % mod;
                else nfib[i] = prev[i];
            }
            FibDic.Add(nfib);
            width <<= 1;
        }
        // foreach (var f in FibDic) WriteLine(string.Join(" ", f));
        var seg = new AtCoder.LazySegtree<Info, Func, SegOp>(init);
        var ans = new List<long>();
        for (var i = 0; i < q; ++i)
        {
            var qk = query[i][0];
            var ql = query[i][1];
            var qr = query[i][2] + 1;
            var qx = query[i][3];
            if (qk == 0)
            {
                ans.Add(seg.Prod(ql, qr).Value * qx % mod);
            }
            else if (qk == 1)
            {
                seg.Apply(ql, qr, new Func(qx, 0, 1, 0));
            }
            else if (qk == 2)
            {
                seg.Apply(ql, qr, new Func(-1, qx, 1, 0));
            }
            else if (qk == 3)
            {
                seg.Apply(ql, qr, new Func(-1, 0, qx, 0));
            }
            else
            {
                seg.Apply(ql, qr, new Func(-1, 0, 1, qx));
            }
        }
        return ans;
    }
    static int mod = 1_000_000_007;
    static List<long[]> FibDic = new List<long[]>();
    struct Info
    {
        public long Value;
        public int Left;
        public int Level;
        public int Length;
        public Info(long value, int left, int level, int length)
        {
            Value = value; Left = left; Level = level; Length = length;
        }
    }
    struct Func
    {
        public long Upd;
        public long Add;
        public long Mul;
        public long Fib;
        public Func(long upd, long add, long mul, long fib)
        {
            Upd = upd; Add = add; Mul = mul; Fib = fib;
        }
    }
    struct SegOp : AtCoder.ILazySegtreeOperator<Info, Func>
    {
        public Info Identity => new Info(0, 0, -1, 0);
        public Func FIdentity => new Func(-1, 0, 1, 0);
        public Func Composition(Func nf, Func cf)
        {
            if (nf.Upd == FIdentity.Upd && nf.Add == FIdentity.Add && nf.Mul == FIdentity.Mul && nf.Fib == FIdentity.Fib) return cf;
            if (cf.Upd == FIdentity.Upd && cf.Add == FIdentity.Add && cf.Mul == FIdentity.Mul && cf.Fib == FIdentity.Fib) return nf;
            if (nf.Upd >= 0) return nf;
            return new Func(
                cf.Upd,
                (cf.Add * nf.Mul + nf.Add) % mod,
                cf.Mul * nf.Mul % mod,
                (cf.Fib * nf.Mul + nf.Fib) % mod);
        }
        public Info Mapping(Func f, Info x)
        {
            if (x.Level < 0) return x;
            if (f.Upd == FIdentity.Upd && f.Add == FIdentity.Add && f.Mul == FIdentity.Mul && f.Fib == FIdentity.Fib) return x;
            if (f.Upd >= 0) return new Info(((f.Upd * f.Mul % mod + f.Add) * x.Length % mod + f.Fib * FibDic[x.Level][x.Left]) % mod, x.Left, x.Level, x.Length);
            if (f.Fib == 0) return new Info((x.Value * f.Mul + f.Add * x.Length) % mod, x.Left, x.Level, x.Length);
            return new Info((x.Value * f.Mul % mod + f.Add * x.Length % mod + f.Fib * FibDic[x.Level][x.Left]) % mod, x.Left, x.Level, x.Length);
        }
        public Info Operate(Info x, Info y)
        {
            if (y.Level < 0) return new Info(x.Value, x.Left, x.Level + 1, x.Length);
            return new Info((x.Value + y.Value) % mod, x.Left, x.Level + 1, x.Length + y.Length);
        }
    }
}