結果

問題 No.1950 片道きゃっちぼーる
コンテスト
ユーザー fgwiebfaoish
提出日時 2022-05-22 14:09:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 696 ms / 3,000 ms
コード長 9,361 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,067 ms
コンパイル使用メモリ 121,956 KB
実行使用メモリ 149,352 KB
最終ジャッジ日時 2024-09-20 12:34:59
合計ジャッジ時間 13,818 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
raw source code 

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;
static class Program{
	const int mod=998244353;
	static Sc sc=new Sc();
	static void Main(){
		Pt pt=new Pt(Solve);
		pt.Sm();
	}
	static void Solve(Pt pt) {
		var n=sc.I;
		var x=sc.Ia2;
		var a=sc.Ia2;
		var li=new List<int>[n+1];
		var b=new bool[n+1];
		var h=new int[n+1];
		var hs=new Dictionary<int,int>();
		for(int i=1;i<=n;i++){
			li[i]=new List<int>();
			hs.Add(x[i],i);
		}
		for(int i = 1;i <= n;i++) {
			if(hs.ContainsKey(x[i]+a[i])) {li[i].Add(hs[x[i]+a[i]]);}
			if(hs.ContainsKey(x[i]-a[i])) {li[i].Add(hs[x[i]-a[i]]);}
		}
		var scc=new Scc(li);
		var ans=new int[scc.m+1];
		for(int i = scc.m;i > 0;i--) {
			for(int j = 0;j < scc.da[i].Length;j++) {ans[i]=Max(ans[i],a[scc.da[i][j]]+x[scc.da[i][j]]);}
			for(int j = 0;j < scc.li[i].Count;j++) {ans[i]=Max(ans[i],ans[scc.li[i][j]]);}
		}
		for(int i = 1;i <= n;i++) {
			pt.Wl(ans[scc.h[i]]-x[i]);
		}
	}
}
public class Scc{
	private const int o=1;
	public List<int>[] li;
	public int[][] da;
	public int[] h;
	public readonly int m;
	public Scc(List<int>[] lim){
		int n=lim.Length,p=1;
		var b=new bool[n];
		var b2=new bool[n];
		var b3=new bool[n];
		var low=new int[n];
		h=new int[n];
		var sk=new Stack<int>();
		var lid=new List<List<int>>();
		for(int i = o;i<n;i++) {if(!b[i]){Fud(i);}}
		void Fud(int a){
			b[a]=true;
			low[a]=p++;
			sk.Push(a);
			for(int i=0;i<lim[a].Count;i++){
				if(b2[lim[a][i]]){continue;}
				if(!b[lim[a][i]]){Fud(lim[a][i]);}
				if(low[a]>low[lim[a][i]]){
					low[a]=low[lim[a][i]];
					b3[a]=true;
				}
			}
			if(b3[a]){return;}
			int v=-1;
			lid.Add(new List<int>());
			while(v!=a){
				v=sk.Pop();
				lid[lid.Count-1].Add(v);
				b2[v]=true;
				h[v]=lid.Count-1;
			}
		}
		m=lid.Count+o;
		li=new List<int>[m];
		da=new int[m][];
		for(int i = o;i<m;i++) {li[i]=new List<int>();}
		for(int i = o;i<n;i++) {h[i]=lid.Count-h[i]-1+o;}
		for(int i = lid.Count-1;i>=0;i--) {
			int e=m-i-1;
			da[e]=lid[i].ToArray();
			for(int j = 0;j<da[e].Length;j++) {
				for(int k = 0;k<lim[da[e][j]].Count;k++) {
					if(h[lim[da[e][j]][k]]!=e){li[e].Add(h[lim[da[e][j]][k]]);}
				}
			}
		}
		for(int i = o;i<m;i++) {li[i]=li[i].Distinct().ToList();}
		m-=o;
	}
}
public class Pt{
	private StringBuilder sb=new StringBuilder();
	public Pt(Action<Pt> f){f(this);}
	public void W(int s){sb.Append(s);}
	public void W(long s){sb.Append(s);}
	public void W(double s){sb.Append(s);}
	public void W(decimal s){sb.Append(s);}
	public void W(char s){sb.Append(s);}
	public void W(string s){sb.Append(s);}
	public void W(object s){sb.Append(s);}
	public void W(string f,int s){sb.Append(s.ToString(f));}
	public void W(string f,long s){sb.Append(s.ToString(f));}
	public void W(string f,double s){sb.Append(s.ToString(f));}
	public void W(string f,decimal s){sb.Append(s.ToString(f));}
	public void Wl(int s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(long s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(double s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(decimal s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(char s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(object s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string f,int s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,long s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,double s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,decimal s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(int[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(long[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(double[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(string[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(object[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(){sb.Append(Environment.NewLine);}
	public void Sm(){Console.Write(sb);}
	public static bool operator==(Pt a,Pt b){return a.sb.ToString()==b.sb.ToString();}
	public static bool operator!=(Pt a,Pt b){return a.sb.ToString()!=b.sb.ToString();}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
}
public class Sc{
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string Rl(){return Console.ReadLine();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string[] Sp(string st){return st.Split();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
	public virtual int I{get{return int.Parse(Rl());}}
	public virtual long L{get{return long.Parse(Rl());}}
	public virtual double D{get{return double.Parse(Rl());}}
	public virtual string S{get{return Rl();}}
	public int[] Ia{get{return Array.ConvertAll(Sp(Rl()),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Sp(Rl()),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Sp(Rl()),double.Parse);}}
	public string[] Sa{get{return Sp(Rl());}}
	public object[] Oa{get{return Sp(Rl());}}
	public int[] Ia2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),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(Sp(Rl()));}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,Sp(Rl()));}return a;}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T) Tp2<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T) Tp3<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T) Tp4<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T) Tp5<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T,T) Tp6<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]),Ct<T>(s[5]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T2) Tp2<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
}
public class Scr:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	private bool bo=false;
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){
		if(bo){return li[l++%li.Count];}
		li.Add(Console.ReadLine());
		return li[li.Count-1];
	}
	public void Again(){bo=true;}
}
public class Sc2:Sc{
	private string[] sps=new string[]{" ","　","\t"};
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string[] Sp(string st){return st.Split(sps,StringSplitOptions.RemoveEmptyEntries);}
	public override int I{get{return int.Parse(Sp(Rl())[0]);}}
	public override long L{get{return long.Parse(Sp(Rl())[0]);}}
	public override double D{get{return double.Parse(Sp(Rl())[0]);}}
	public override string S{get{return Sp(Rl())[0];}}
}
public class Sct:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	public void Add(int s){li.Add(s.ToString());}
	public void Add(long s){li.Add(s.ToString());}
	public void Add(double s){li.Add(s.ToString());}
	public void Add(string s){li.Add(s.ToString());}
	public void Add(object s){li.Add(s.ToString());}
	public void Add(int[] s){li.Add(string.Join(" ",s));}
	public void Add(long[] s){li.Add(string.Join(" ",s));}
	public void Add(double[] s){li.Add(string.Join(" ",s));}
	public void Add(string[] s){li.Add(string.Join(" ",s));}
	public void Add(object[] s){li.Add(string.Join(" ",s));}
	protected override string Rl(){return li[l++];}
	public void Clear(){li.Clear();l=0;}
	public void Again(){l=0;}
	public void Pf(){Console.WriteLine(string.Join("\n",li));}
}
0