結果

問題 No.1172 Add Recursive Sequence
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2021-03-03 02:09:33
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 2,346 ms / 4,000 ms
コード長 4,880 bytes
コンパイル時間 1,123 ms
コンパイル使用メモリ 118,812 KB
実行使用メモリ 43,464 KB
最終ジャッジ日時 2024-04-14 05:48:55
合計ジャッジ時間 8,271 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
24,256 KB
testcase_01 AC 28 ms
24,332 KB
testcase_02 AC 29 ms
23,996 KB
testcase_03 AC 28 ms
26,504 KB
testcase_04 AC 31 ms
24,368 KB
testcase_05 AC 30 ms
28,292 KB
testcase_06 AC 33 ms
24,364 KB
testcase_07 AC 31 ms
26,036 KB
testcase_08 AC 32 ms
24,188 KB
testcase_09 AC 33 ms
24,120 KB
testcase_10 AC 72 ms
30,180 KB
testcase_11 AC 66 ms
28,284 KB
testcase_12 AC 69 ms
31,724 KB
testcase_13 AC 64 ms
27,468 KB
testcase_14 AC 324 ms
43,464 KB
testcase_15 AC 258 ms
40,156 KB
testcase_16 AC 2,346 ms
42,324 KB
testcase_17 AC 1,959 ms
40,660 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
//using nint=System.Int32;
static class Program{
	const int mod=(int)1e9+7;
	static void Main(){
		Sc sc=new Sc();
		var (k,n,m)=sc.Tp3<int>();
		var a=sc.La;
		var c=sc.La;
		Array.Reverse(c);
		var h=new Mint[n+k];
		for(int i = 0;i<k;i++) {h[i]=a[i];}
		for(int i = k;i<n+k;i++) {
			for(int j = 0;j<k;j++) {h[i]+=h[i-k+j]*c[j];}
		}
		var d=new int[n+1];
		var li=new List<int>[n+1];
		for(int i = 0;i<=n;i++) {li[i]=new List<int>();}
		for(int i = 0;i<m;i++) {
			var e=sc.Ia;
			d[e[0]]++;
			li[e[1]].Add(e[1]-e[0]);
		}
		var s=new Mint[n+k];
		StringBuilder sb=new StringBuilder();
		for (int i = 0;i<n;i++) {
			for (int j = 0;j<k;j++) {s[i+k]+=s[j+i]*c[j];}
			if(d[i]!=0){
				for (int j = 0;j<k;j++) {s[j+i+1]+=h[j]*d[i];}
			}
			for(int l = 0;l<li[i].Count;l++) {
				for (int j = 0;j<k;j++) {s[j+i+1]-=h[li[i][l]+j];}
			}
			sb.Append(s[i+1]+"\n");
		}
		Console.Write(sb);
	}
}
public struct Mint{
	const int mod=(int)1e9+7;//998244353;
	private long d;
	public Mint(long d){this.d=d;}
	public static implicit operator Mint(long d){return new Mint(d%mod);}
	public static explicit operator long(Mint d){return d.d;}
	public override string ToString(){return d.ToString();}
	public static Mint operator+(Mint a,long b){a.d=(a.d+b)%mod;return a;}
	public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;}
	public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b)%mod;return a;}
	public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;}
	public static Mint operator*(Mint a,long b){a.d=(a.d*b)%mod;return a;}
	public static Mint operator*(Mint a,Mint b){a.d=(a.d*b.d)%mod;return a;}
	public static Mint operator/(Mint a,long b){a.d=(a.d*Mi(b))%mod;return a;}
	public static Mint operator/(Mint a,Mint b){a.d=(a.d*Mi(b.d))%mod;return a;}
	public static bool operator==(Mint a,long b){return (long)a==b;}
	public static bool operator!=(Mint a,long b){return (long)a!=b;}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
	public static long Mi(long a){
		a=(a+mod)%mod;
		long b=mod,u=1,v=0;
		while(b>0){
			long t=a/b;
			a-=t*b;(a,b)=(b,a);
			u-=t*v;(u,v)=(v,u);
		}
		u%=mod;
		if(u<0){u+=mod;}
		return u%mod;
	}
}
public class Sc{
	public int I{get{return int.Parse(Console.ReadLine());}}
	public long L{get{return long.Parse(Console.ReadLine());}}
	public double D{get{return double.Parse(Console.ReadLine());}}
	public string S{get{return Console.ReadLine();}}
	public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
	public string[] Sa{get{return Console.ReadLine().Split();}}
	public object[] Oa{get{return Console.ReadLine().Split();}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),double.Parse);}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<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;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
	public (T,T) Tp2<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]));}
	public (T,T,T) Tp3<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
}
0