#655297 (Java21) No.1502 Many Simple Additions

提出ソース

結果

問題	No.1502 Many Simple Additions
ユーザー	uwi
提出日時	2021-05-07 22:55:01
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	15,011 bytes
コンパイル時間	5,121 ms
コンパイル使用メモリ	93,716 KB
実行使用メモリ	59,104 KB
最終ジャッジ日時	2024-09-15 11:01:17
合計ジャッジ時間	12,425 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	72 ms 38,000 KB
testcase_01	AC	71 ms 37,684 KB
testcase_02	AC	70 ms 37,968 KB
testcase_03	AC	69 ms 37,856 KB
testcase_04	AC	72 ms 37,928 KB
testcase_05	WA	-
testcase_06	AC	71 ms 37,580 KB
testcase_07	WA	-
testcase_08	AC	71 ms 37,536 KB
testcase_09	AC	73 ms 37,416 KB
testcase_10	AC	70 ms 37,568 KB
testcase_11	WA	-
testcase_12	AC	68 ms 37,916 KB
testcase_13	AC	70 ms 37,716 KB
testcase_14	AC	72 ms 37,792 KB
testcase_15	AC	69 ms 37,944 KB
testcase_16	AC	70 ms 37,848 KB
testcase_17	AC	71 ms 37,668 KB
testcase_18	AC	71 ms 37,592 KB
testcase_19	AC	69 ms 37,708 KB
testcase_20	AC	68 ms 37,796 KB
testcase_21	AC	77 ms 37,664 KB
testcase_22	AC	70 ms 37,908 KB
testcase_23	AC	91 ms 37,932 KB
testcase_24	AC	72 ms 37,848 KB
testcase_25	AC	67 ms 37,252 KB
testcase_26	AC	67 ms 37,936 KB
testcase_27	AC	266 ms 55,808 KB
testcase_28	AC	262 ms 56,352 KB
testcase_29	AC	145 ms 48,920 KB
testcase_30	AC	337 ms 59,104 KB
testcase_31	AC	315 ms 58,768 KB
testcase_32	AC	313 ms 58,716 KB
testcase_33	AC	221 ms 53,420 KB
testcase_34	AC	222 ms 54,136 KB
testcase_35	AC	224 ms 53,712 KB
testcase_36	AC	199 ms 47,920 KB
testcase_37	AC	201 ms 47,848 KB
testcase_38	AC	208 ms 49,124 KB
testcase_39	AC	166 ms 47,840 KB
testcase_40	AC	176 ms 46,992 KB
testcase_41	AC	107 ms 41,524 KB
testcase_42	AC	227 ms 53,856 KB
testcase_43	AC	70 ms 37,584 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest210507;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class D {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		// odd-cycleがあるとその連結成分については確定
		// even-cycleの場合は整合性を見る?みなくてもいいかも
		// 1点をxとして決め打ち

		int n = ni(), m = ni(), K = ni();
		int[] from = new int[m];
		int[] to = new int[m];
		int[] ws = new int[m];
		for(int i = 0;i < m;i++){
		    from[i] = ni()-1;
		    to[i] = ni()-1;
		    ws[i] = ni();
		}
		int[][][] g = packWU(n, from, to, ws);
		int[] roots = new int[n];
		int[] sl = new int[n];
		long[] in = new long[n];
		for(int i = 0;i < n;i++){
			if(sl[i] == 0) {
				sl[i] = 1;
				in[i] = 0;
				dfs(i, g, sl, in, i, roots);
			}
		}
		long[] vals = new long[n];
		Arrays.fill(vals, Long.MAX_VALUE);
		for(int i = 0;i < n;i++){
			for(int[] e : g[i]){
				if(sl[e[0]] + sl[i] != 0){
					long lsl = sl[e[0]] + sl[i];
					long lin = e[1] - (in[e[0]] + in[i]);
					// lsl*x + lin = e[1]
					if(lin % 2 != 0){
						out.println(0);
						return;
					}
					long X = lin/lsl;
					if(vals[roots[i]] == X || vals[roots[i]] == Long.MAX_VALUE){
						vals[roots[i]] = X;
					}else{
						out.println(0);
						return;
					}
				}
			}
		}
		long[] pmax = new long[n];
		long[] pmin = new long[n];
		long[] nmax = new long[n];
		long[] nmin = new long[n];
		Arrays.fill(pmax, Long.MIN_VALUE / 10);
		Arrays.fill(nmax, Long.MIN_VALUE / 10);
		Arrays.fill(nmin, Long.MAX_VALUE / 10);
		boolean foundk = false;
		for(int i = 0;i < n;i++){
			if(vals[roots[i]] != Long.MAX_VALUE){
				vals[i] = sl[i] * vals[roots[i]] + in[i];
				if(!(1 <= vals[i] && vals[i] <= K)){
					out.println(0);
					return;
				}
				if(vals[i] == K)foundk = true;
			}else{
				if(sl[i] == 1){
					pmax[roots[i]] = Math.max(pmax[roots[i]], in[i]);
					pmin[roots[i]] = Math.min(pmin[roots[i]], in[i]);
				}else{
					nmax[roots[i]] = Math.max(nmax[roots[i]], in[i]);
					nmin[roots[i]] = Math.min(nmin[roots[i]], in[i]);
				}
			}
		}
		// x+pmax <= K
		// -x+nmax <= K
		// -x+nmin >= 1
		long dpk = 0;
		long dpn = 1;
		final int mod = 1000000007;
		for(int i = 0;i < n;i++){
			if(roots[i] == i && vals[i] == Long.MAX_VALUE){
				long xmax = Math.min(K-pmax[i], nmin[i]-1);
				long xmin = Math.max(1-pmin[i], nmax[i]-K);
				if(xmin > xmax){
					out.println(0);
					return;
				}
				long inn = xmax-xmin+1;
				long ink = 0;
				if(xmin == xmax) {
					if (K - pmax[i] == xmax || xmin == nmax[i] - K) {
						ink = 1;
					}
				}else{
//					tr(pmax[i], nmax[i], xmax);
					if (K - pmax[i] == xmax)ink++;
					if(xmin == nmax[i] -K)ink++;
				}
				long ndpn = dpn * (inn-ink+mod) % mod;
				long ndpk = (dpk * inn + dpn * ink) % mod;
				dpk = ndpk;
				dpn = ndpn;
			}
		}
		if(foundk){
			out.println(dpn);
		}else{
			out.println(dpk);
		}
	}

	void dfs(int cur, int[][][] g, int[] sl, long[] in, int r, int[] roots)
	{
		roots[cur] = r;
		for(int[] e : g[cur]){
			if(sl[e[0]] == 0){
				sl[e[0]] = -sl[cur];
				in[e[0]] = -in[cur] + e[1];
				dfs(e[0], g, sl, in, r, roots);
			}
		}
	}


	public static int[][][] packWU(int n, int[] from, int[] to, int[] w) {
		return packWU(n, from, to, w, from.length);
	}

	public static int[][][] packWU(int n, int[] from, int[] to, int[] w, int sup) {
		int[][][] g = new int[n][][];
		int[] p = new int[n];
		for (int i = 0; i < sup; i++) p[from[i]]++;
		for (int i = 0; i < sup; i++) p[to[i]]++;
		for (int i = 0; i < n; i++) g[i] = new int[p[i]][2];
		for (int i = 0; i < sup; i++) {
			--p[from[i]];
			g[from[i]][p[from[i]]][0] = to[i];
			g[from[i]][p[from[i]]][1] = w[i];
			--p[to[i]];
			g[to[i]][p[to[i]]][0] = from[i];
			g[to[i]][p[to[i]]][1] = w[i];
		}
		return g;
	}


	public static void main(String[] args) {
		new D().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[] 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

結果

テストケース

ソースコード