Esempio n. 1
0
        public override void Solve(ConsoleReader cr, ConsoleWriter cw)
        {
            int n    = cr;
            int q    = cr;
            var sums = new LongSums(cr.Repeat(n));

            for (int i = 0; i < q; i++)
            {
                int l = cr;
                int r = cr;
                cw.WriteLine(sums[l..r]);
        public void Native()
        {
            LongSums sums;
            var      seg = new SegtreeBeats <S, long, Op>(new S[10].Fill(new S(0)));

            seg.Apply(0, 8, 1);
            sums = new LongSums(new long[] { 1, 1, 1, 1, 1, 1, 1, 1, 0, 0 });
            for (int l = 0; l < 10; l++)
            {
                for (int r = l; r <= 10; r++)
                {
                    seg[l..r].sum.Should().Be(sums[l..r]);