#942228 (Java21) No.2523 Trick Flower

提出ソース
結果

問題	No.2523 Trick Flower
ユーザー	uwi
提出日時	2024-01-08 13:22:35
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	14,544 bytes
コンパイル時間	7,747 ms
コンパイル使用メモリ	94,008 KB
実行使用メモリ	66,216 KB
最終ジャッジ日時	2024-01-08 13:22:53
合計ジャッジ時間	16,133 ms
ジャッジサーバーID （参考情報）	judge15 / judge11
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	68 ms 54,612 KB
testcase_01	AC	67 ms 54,624 KB
testcase_02	AC	70 ms 54,628 KB
testcase_03	AC	68 ms 54,628 KB
testcase_04	AC	69 ms 54,636 KB
testcase_05	AC	70 ms 54,608 KB
testcase_06	AC	69 ms 54,636 KB
testcase_07	WA	-
testcase_08	AC	74 ms 54,628 KB
testcase_09	AC	73 ms 54,628 KB
testcase_10	AC	70 ms 54,632 KB
testcase_11	AC	80 ms 54,648 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	72 ms 54,628 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	233 ms 62,260 KB
testcase_18	AC	229 ms 64,600 KB
testcase_19	AC	276 ms 64,560 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	334 ms 63,756 KB
testcase_26	WA	-
testcase_27	AC	270 ms 65,320 KB
testcase_28	WA	-
testcase_29	AC	145 ms 58,964 KB
testcase_30	AC	213 ms 62,308 KB
testcase_31	AC	98 ms 54,888 KB
testcase_32	AC	203 ms 61,108 KB
testcase_33	WA	-
権限があれば一括ダウンロードができます
ソースコード

raw source code
package no2xxx;

import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class No2523 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] b = na(n);
		int[] c = na(n);
		for(int i = 0;i < n;i++){
			c[i]--;
		}

		AnalyzeResult ar = analyze(c);

		long as = 0;
		for(int i = 0;i < n;i++){
			as += a[i];
		}
		long bs = 0;
		for(int i = 0;i < n;i++){
			bs += b[i];
		}

		long low = 0, high = as/bs+2;
		while(high - low > 1){
			long h = high+low>>1;
			if(ok(h, a, b, c, ar)){
				low = h;
			}else{
				high = h;
			}
		}
		out.println(low);
	}

	boolean ok(long h, int[] a, int[] b, int[] c, AnalyzeResult ar)
	{
		int n = a.length;
		long[] dp = new long[n];
		for(int i = ar.ord.length-1;i >= 0;i--){
			int cur = ar.ord[i];
			dp[cur] += -b[cur] * h + a[cur];
			if(!ar.incycle[cur] && dp[cur] < 0){
				dp[ar.f[cur]] += dp[cur];
			}
		}
		for(int[] cy : ar.cycles){
			long bal = 0;
			for(int x : cy){
				bal += dp[x] - b[x]* h + a[x];
			}
			if(bal < 0)return false;
		}
		return true;
	}

	/**
	 * f: 元の写像
	 * dep: 根からの深さ
	 * roots: 根
	 * clus: 各頂点が属する連結成分の番号。cyclesに対応している。
	 * ord: トポロジカル順。ただしサイクル内の頂点は含まない
	 * cycles: サイクルのリスト
	 * incycle: サイクルに含まれるか
	 * iind: サイクル内でのindex
	 * @verified https://leetcode.com/contest/weekly-contest-365/problems/count-visited-nodes-in-a-directed-graph/
	 */
	public static class AnalyzeResult
	{
		int[] f, dep, roots, clus, ord;
		List<int[]> cycles;
		boolean[] incycle;
		int[] iind;

		public AnalyzeResult(int[] f, int[] dep, int[] roots, int[] clus, int[] ord, List<int[]> cycles, boolean[] incycle, int[] iind) {
			this.f = f;
			this.dep = dep;
			this.roots = roots;
			this.clus = clus;
			this.ord = ord;
			this.cycles = cycles;
			this.incycle = incycle;
			this.iind = iind;
		}
	}

	public static AnalyzeResult analyze(int[] f)
	{
		int n = f.length;

		// sort topologicaly
		int[] deg = new int[n];
		for(int v : f)deg[v]++;
		int[] ord = new int[n];
		int p = 0;
		for(int i = 0;i < n;i++){
			if(deg[i] == 0)ord[p++] = i;
		}
		for(int i = 0;i < p;i++){
			int cur = ord[i];
			if(--deg[f[cur]] == 0)ord[p++] = f[cur];
		}
		ord = Arrays.copyOf(ord, p);

		boolean[] incycle = new boolean[n];
		Arrays.fill(incycle, true);
		for(int v : ord)incycle[v] = false;

		List<int[]> cycles = new ArrayList<>();
		int[] clus = new int[n];
		Arrays.fill(clus, -1);
		int[] cyc = new int[n];
		int[] iind = new int[n];
		Arrays.fill(iind, -1);
		for(int i = 0;i < n;i++){
			if(deg[i] > 0){
				int q = 0;
				for(int cur = i;deg[cur] > 0;cur = f[cur]){
					iind[cur] = q;
					cyc[q++] = cur;
					clus[cur] = cycles.size();
					deg[cur] = 0;
				}
				cycles.add(Arrays.copyOf(cyc, q));
			}
		}

		int[] roots = new int[n];
		Arrays.fill(roots, -1);
		int[] dep = new int[n];
		for(int i = 0;i < n;i++){
			if(incycle[i])roots[i] = i;
		}
		for(int i = ord.length-1;i >= 0;i--){
			int cur = ord[i];
			clus[cur] = clus[f[cur]];
			dep[cur] = dep[f[cur]]+1;
			roots[cur] = roots[f[cur]];
		}

		return new AnalyzeResult(f, dep, roots, clus, ord, cycles, incycle, iind);
	}


	public static void main(String[] args) {
		new No2523().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
		//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
		//			@Override
		//			public void run() {
		//				long s = System.currentTimeMillis();
		//				solve();
		//				out.flush();
		//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
		//			}
		//		};
		//		t.start();
		//		t.join();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;

	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}

	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	//	private boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }

	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}

	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}

	private int[][] nmi(int n, int m)
	{
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}

	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}

	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}

	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){ return write(c).writeln(); }
		public FastWriter writeln(int x){ return write(x).writeln(); }
		public FastWriter writeln(long x){ return write(x).writeln(); }
		public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(x));
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs) { return write(xs).writeln(); }
		public FastWriter writeln(long... xs) { return write(xs).writeln(); }
		public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(char[] line) { return write(line).writeln(); }
		public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
		public FastWriter writeln(String s) { return write(s).writeln(); }

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
yukicoder

結果

テストケース

ソースコード
