Submission #2868131

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;

namespace AtCoder
{
    class Program
    {
        private static string Read() { return Console.ReadLine(); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }

        static int Solve(int N, int[] T, int[] A)
        {
            int[] mins = Enumerable.Repeat(int.MinValue, N).ToArray();
            int[] maxs = Enumerable.Repeat(int.MaxValue, N).ToArray();

            mins[0] = Math.Max(T[0], mins[0]);
            maxs[0] = Math.Min(T[0], maxs[0]);
            for (int i = 1; i < N; ++i)
            {
                if (T[i] > T[i - 1])
                {
                    mins[i] = Math.Max(T[i], mins[i]);
                    maxs[i] = Math.Min(T[i], maxs[i]);
                }
                else if (T[i] == T[i - 1])
                {
                    mins[i] = Math.Max(1, mins[i]);
                    maxs[i] = Math.Min(T[i], maxs[i]);
                }
                else
                {
                    return 0;
                }
            }

            mins[N - 1] = Math.Max(A[N - 1], mins[N - 1]);
            maxs[N - 1] = Math.Min(A[N - 1], maxs[N - 1]);
            for (int i = N - 2; i >= 0; --i)
            {
                if (A[i] > A[i + 1])
                {
                    mins[i] = Math.Max(A[i], mins[i]);
                    maxs[i] = Math.Min(A[i], maxs[i]);
                }
                else if (A[i] == A[i + 1])
                {
                    mins[i] = Math.Max(1, mins[i]);
                    maxs[i] = Math.Min(A[i], maxs[i]);
                }
                else
                {
                    return 0;
                }
            }

            long prod = 1;
            for (int i = 0; i < N; ++i)
            {
                if (mins[i] <= maxs[i])
                {
                    prod *= maxs[i] - mins[i] + 1;
                    prod %= 1000000007;
                }
                else
                {
                    return 0;
                }
            }
            return (int)prod;
        }
        static void Main(string[] args)
        {
            int N = ReadInt();
            int[] T = ReadInts();
            int[] A = ReadInts();
            Console.WriteLine(Solve(N, T, A));
        }
    }
}

Submission Info

Judge Result