結果

問題 No.1680 Sum and Difference
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2021-09-17 23:05:06
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 26 ms / 1,000 ms
コード長 4,953 bytes
コンパイル時間 3,367 ms
コンパイル使用メモリ 110,720 KB
実行使用メモリ 18,304 KB
最終ジャッジ日時 2024-06-29 21:52:12
合計ジャッジ時間 4,310 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
18,176 KB
testcase_01 AC 25 ms
18,048 KB
testcase_02 AC 25 ms
18,176 KB
testcase_03 AC 25 ms
18,176 KB
testcase_04 AC 25 ms
18,048 KB
testcase_05 AC 26 ms
18,304 KB
testcase_06 AC 25 ms
17,920 KB
testcase_07 AC 24 ms
18,304 KB
testcase_08 AC 25 ms
18,304 KB
testcase_09 AC 26 ms
17,920 KB
testcase_10 AC 25 ms
18,176 KB
testcase_11 AC 25 ms
18,048 KB
testcase_12 AC 25 ms
18,048 KB
testcase_13 AC 24 ms
18,048 KB
testcase_14 AC 25 ms
18,048 KB
testcase_15 AC 25 ms
18,048 KB
testcase_16 AC 25 ms
17,920 KB
testcase_17 AC 25 ms
17,920 KB
testcase_18 AC 25 ms
18,048 KB
testcase_19 AC 24 ms
17,920 KB
testcase_20 AC 25 ms
17,920 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.Text.RegularExpressions;
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 (a,b)=sc.Tp2<long>();
		const long inf=long.MaxValue>>1;
		var z=Fu(0);
		long lb = 0, ub = inf, mid = 0;
		while(lb+1!=ub) {
			mid=(ub+lb)/2;
			if(Fu(mid)<=0) { ub=mid; }
			else { lb=mid; }
		}
		var rr=lb;
		lb = 0;ub = inf;
		while(lb+1!=ub) {
			mid=(ub+lb)/2;
			if(Fu(mid)<z) { ub=mid; }
			else { lb=mid; }
		}
		var ll=ub;
		Mint ans2=Ap(Fu(rr),2,rr-ll+1)*2;
		ans2+=z*(Mint)((ll-1)*2+1);
		long Fu(long x) {
			var l=Max(-a-x,x-b);
			var r=Min(a-x,x+b);
			return r-l+1;
		}
		Console.WriteLine("{0}",ans2);
	}
	static Mint Ap(long a,long d,Mint n){return (n*((a<<1)+(n-1)*d))/2;}
}
public struct Mint{
	const int mod=(int)1e9+7;
	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=(mod+a.d+b%mod)%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)%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=b%mod*a.d%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 (T,T,T,T) Tp4<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	public (T1,T2) Tp2<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	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