#580008 (Java21) No.1290 Addition and Subtraction Operation

提出ソース

結果

問題	No.1290 Addition and Subtraction Operation
ユーザー	uwi
提出日時	2020-11-14 02:47:48
言語	Java21 (openjdk 21)
結果	AC
実行時間	182 ms / 2,000 ms
コード長	11,935 bytes
コンパイル時間	4,901 ms
コンパイル使用メモリ	93,200 KB
実行使用メモリ	46,924 KB
最終ジャッジ日時	2024-07-22 22:40:27
合計ジャッジ時間	17,566 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	86 ms 38,076 KB
testcase_01	AC	85 ms 38,516 KB
testcase_02	AC	85 ms 38,152 KB
testcase_03	AC	86 ms 38,384 KB
testcase_04	AC	84 ms 38,264 KB
testcase_05	AC	86 ms 38,252 KB
testcase_06	AC	83 ms 38,112 KB
testcase_07	AC	89 ms 38,492 KB
testcase_08	AC	81 ms 37,976 KB
testcase_09	AC	79 ms 38,056 KB
testcase_10	AC	80 ms 38,412 KB
testcase_11	AC	78 ms 38,516 KB
testcase_12	AC	85 ms 37,948 KB
testcase_13	AC	79 ms 37,976 KB
testcase_14	AC	77 ms 38,112 KB
testcase_15	AC	79 ms 38,168 KB
testcase_16	AC	86 ms 38,520 KB
testcase_17	AC	85 ms 38,492 KB
testcase_18	AC	85 ms 38,456 KB
testcase_19	AC	79 ms 38,284 KB
testcase_20	AC	90 ms 38,244 KB
testcase_21	AC	92 ms 38,348 KB
testcase_22	AC	86 ms 38,192 KB
testcase_23	AC	78 ms 38,112 KB
testcase_24	AC	80 ms 38,620 KB
testcase_25	AC	80 ms 38,260 KB
testcase_26	AC	80 ms 38,336 KB
testcase_27	AC	81 ms 38,108 KB
testcase_28	AC	80 ms 38,248 KB
testcase_29	AC	79 ms 38,480 KB
testcase_30	AC	83 ms 38,352 KB
testcase_31	AC	79 ms 38,368 KB
testcase_32	AC	83 ms 37,984 KB
testcase_33	AC	91 ms 37,980 KB
testcase_34	AC	88 ms 38,200 KB
testcase_35	AC	82 ms 38,196 KB
testcase_36	AC	82 ms 38,272 KB
testcase_37	AC	81 ms 38,460 KB
testcase_38	AC	80 ms 38,200 KB
testcase_39	AC	79 ms 38,416 KB
testcase_40	AC	85 ms 38,300 KB
testcase_41	AC	79 ms 38,416 KB
testcase_42	AC	128 ms 41,916 KB
testcase_43	AC	131 ms 42,076 KB
testcase_44	AC	130 ms 41,772 KB
testcase_45	AC	131 ms 41,912 KB
testcase_46	AC	128 ms 42,036 KB
testcase_47	AC	131 ms 42,040 KB
testcase_48	AC	129 ms 41,932 KB
testcase_49	AC	128 ms 42,172 KB
testcase_50	AC	130 ms 42,072 KB
testcase_51	AC	129 ms 42,052 KB
testcase_52	AC	129 ms 42,004 KB
testcase_53	AC	130 ms 42,040 KB
testcase_54	AC	131 ms 41,772 KB
testcase_55	AC	129 ms 41,956 KB
testcase_56	AC	129 ms 42,012 KB
testcase_57	AC	139 ms 42,716 KB
testcase_58	AC	148 ms 42,700 KB
testcase_59	AC	148 ms 42,968 KB
testcase_60	AC	167 ms 46,572 KB
testcase_61	AC	157 ms 43,432 KB
testcase_62	AC	172 ms 44,612 KB
testcase_63	AC	147 ms 42,516 KB
testcase_64	AC	133 ms 42,532 KB
testcase_65	AC	130 ms 41,732 KB
testcase_66	AC	153 ms 43,352 KB
testcase_67	AC	164 ms 46,924 KB
testcase_68	AC	164 ms 44,592 KB
testcase_69	AC	147 ms 42,660 KB
testcase_70	AC	141 ms 42,672 KB
testcase_71	AC	160 ms 44,300 KB
testcase_72	AC	140 ms 41,664 KB
testcase_73	AC	169 ms 43,344 KB
testcase_74	AC	128 ms 41,908 KB
testcase_75	AC	131 ms 42,076 KB
testcase_76	AC	144 ms 42,708 KB
testcase_77	AC	162 ms 43,704 KB
testcase_78	AC	163 ms 43,636 KB
testcase_79	AC	150 ms 42,496 KB
testcase_80	AC	182 ms 46,476 KB
testcase_81	AC	164 ms 46,256 KB
testcase_82	AC	155 ms 43,248 KB
testcase_83	AC	172 ms 46,220 KB
testcase_84	AC	173 ms 44,148 KB
testcase_85	AC	147 ms 42,396 KB
testcase_86	AC	135 ms 41,692 KB

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

ソースコード

raw source code

package contest201113;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class F {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni(), m = ni();
		int[] B = na(n);
		int[][] rs = new int[m][];
		for(int i = 0;i < m;i++)rs[i] = new int[]{ni()-1, ni()-1};

		for(int i = 1;i < n;i+=2){
			B[i] = -B[i];
		}

		int[] ch = new int[n+1];
		for(int i = 0;i <= n;i++){
			ch[i] = (i < n ? B[i] : 0) - (i-1 >= 0 ? B[i-1] : 0);
		}

		DJSet ds = new DJSet(n+1);
		for(int[] r : rs){
			ds.union(r[0], r[1]+1);
		}

		long[] as = new long[n+1];
		for(int i = 0;i <= n;i++){
			as[ds.root(i)] += ch[i];
		}

		for(long v : as){
			if(v != 0){
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}

	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper) if (u < 0) ct++;
			return ct;
		}

		public int[][] toBucket() {
			int n = upper.length;
			int[][] ret = new int[n][];
			int[] rp = new int[n];
			for (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];
			for (int i = 0; i < n; i++) {
				int r = root(i);
				ret[r][rp[r]++] = i;
			}
			return ret;
		}
	}


	public static void main(String[] args) {
		new F().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 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(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 println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(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

結果

テストケース

ソースコード