#826261 (Java21) No.5011 Better Mo's Algorithm is Needed!! (Weighted)

提出ソース

結果

問題	No.5011 Better Mo's Algorithm is Needed!! (Weighted)
ユーザー	uwi
提出日時	2022-12-17 00:32:27
言語	Java21 (openjdk 21)
結果	AC
実行時間	1,006 ms / 5,000 ms
コード長	12,612 bytes
コンパイル時間	4,704 ms
実行使用メモリ	55,644 KB
スコア	34,901,328,080
最終ジャッジ日時	2022-12-17 00:35:22
合計ジャッジ時間	162,620 ms
ジャッジサーバーID （参考情報）	judge10 / judge15
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	732 ms 53,512 KB
testcase_01	AC	915 ms 55,016 KB
testcase_02	AC	963 ms 54,224 KB
testcase_03	AC	875 ms 54,684 KB
testcase_04	AC	819 ms 53,604 KB
testcase_05	AC	981 ms 55,644 KB
testcase_06	AC	805 ms 53,548 KB
testcase_07	AC	908 ms 54,228 KB
testcase_08	AC	893 ms 54,232 KB
testcase_09	AC	914 ms 54,068 KB
testcase_10	AC	877 ms 54,152 KB
testcase_11	AC	832 ms 53,600 KB
testcase_12	AC	877 ms 54,476 KB
testcase_13	AC	840 ms 53,536 KB
testcase_14	AC	819 ms 53,560 KB
testcase_15	AC	880 ms 54,092 KB
testcase_16	AC	905 ms 54,268 KB
testcase_17	AC	804 ms 53,356 KB
testcase_18	AC	817 ms 53,388 KB
testcase_19	AC	826 ms 54,500 KB
testcase_20	AC	794 ms 53,560 KB
testcase_21	AC	773 ms 53,852 KB
testcase_22	AC	865 ms 54,340 KB
testcase_23	AC	943 ms 54,656 KB
testcase_24	AC	950 ms 55,444 KB
testcase_25	AC	790 ms 53,736 KB
testcase_26	AC	848 ms 54,032 KB
testcase_27	AC	918 ms 54,884 KB
testcase_28	AC	812 ms 53,840 KB
testcase_29	AC	775 ms 53,616 KB
testcase_30	AC	905 ms 53,688 KB
testcase_31	AC	788 ms 53,424 KB
testcase_32	AC	788 ms 53,952 KB
testcase_33	AC	851 ms 53,680 KB
testcase_34	AC	745 ms 53,516 KB
testcase_35	AC	742 ms 53,396 KB
testcase_36	AC	942 ms 54,500 KB
testcase_37	AC	925 ms 53,408 KB
testcase_38	AC	801 ms 53,584 KB
testcase_39	AC	957 ms 53,844 KB
testcase_40	AC	869 ms 54,584 KB
testcase_41	AC	814 ms 53,832 KB
testcase_42	AC	935 ms 54,540 KB
testcase_43	AC	815 ms 53,764 KB
testcase_44	AC	928 ms 53,780 KB
testcase_45	AC	875 ms 53,616 KB
testcase_46	AC	888 ms 54,016 KB
testcase_47	AC	849 ms 53,648 KB
testcase_48	AC	920 ms 54,132 KB
testcase_49	AC	911 ms 55,232 KB
testcase_50	AC	819 ms 53,884 KB
testcase_51	AC	932 ms 54,076 KB
testcase_52	AC	824 ms 53,636 KB
testcase_53	AC	838 ms 54,300 KB
testcase_54	AC	913 ms 53,984 KB
testcase_55	AC	963 ms 54,084 KB
testcase_56	AC	866 ms 53,956 KB
testcase_57	AC	916 ms 54,168 KB
testcase_58	AC	828 ms 54,084 KB
testcase_59	AC	837 ms 54,576 KB
testcase_60	AC	865 ms 54,472 KB
testcase_61	AC	913 ms 53,284 KB
testcase_62	AC	867 ms 53,768 KB
testcase_63	AC	960 ms 54,260 KB
testcase_64	AC	798 ms 53,896 KB
testcase_65	AC	922 ms 54,072 KB
testcase_66	AC	850 ms 53,444 KB
testcase_67	AC	876 ms 53,984 KB
testcase_68	AC	831 ms 53,676 KB
testcase_69	AC	795 ms 53,704 KB
testcase_70	AC	894 ms 54,140 KB
testcase_71	AC	794 ms 53,684 KB
testcase_72	AC	730 ms 53,604 KB
testcase_73	AC	926 ms 54,268 KB
testcase_74	AC	821 ms 53,180 KB
testcase_75	AC	853 ms 53,524 KB
testcase_76	AC	830 ms 54,268 KB
testcase_77	AC	845 ms 53,720 KB
testcase_78	AC	831 ms 53,720 KB
testcase_79	AC	890 ms 54,264 KB
testcase_80	AC	844 ms 54,984 KB
testcase_81	AC	867 ms 54,124 KB
testcase_82	AC	889 ms 53,756 KB
testcase_83	AC	950 ms 55,108 KB
testcase_84	AC	934 ms 54,288 KB
testcase_85	AC	768 ms 53,312 KB
testcase_86	AC	807 ms 53,812 KB
testcase_87	AC	838 ms 53,740 KB
testcase_88	AC	865 ms 53,724 KB
testcase_89	AC	955 ms 55,204 KB
testcase_90	AC	871 ms 53,712 KB
testcase_91	AC	778 ms 53,608 KB
testcase_92	AC	841 ms 54,104 KB
testcase_93	AC	891 ms 54,648 KB
testcase_94	AC	848 ms 54,904 KB
testcase_95	AC	1,006 ms 54,364 KB
testcase_96	AC	928 ms 54,544 KB
testcase_97	AC	845 ms 54,044 KB
testcase_98	AC	840 ms 53,656 KB
testcase_99	AC	863 ms 53,884 KB
testcase_100	AC	972 ms 54,208 KB
testcase_101	AC	969 ms 54,080 KB
testcase_102	AC	857 ms 53,432 KB
testcase_103	AC	856 ms 53,872 KB
testcase_104	AC	824 ms 53,952 KB
testcase_105	AC	905 ms 53,468 KB
testcase_106	AC	901 ms 53,628 KB
testcase_107	AC	773 ms 53,400 KB
testcase_108	AC	830 ms 53,512 KB
testcase_109	AC	818 ms 54,272 KB
testcase_110	AC	850 ms 53,872 KB
testcase_111	AC	899 ms 54,896 KB
testcase_112	AC	760 ms 53,360 KB
testcase_113	AC	862 ms 53,768 KB
testcase_114	AC	824 ms 53,768 KB
testcase_115	AC	907 ms 53,752 KB
testcase_116	AC	857 ms 53,512 KB
testcase_117	AC	779 ms 53,220 KB
testcase_118	AC	875 ms 54,612 KB
testcase_119	AC	904 ms 54,736 KB

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

ソースコード

raw source code

package advent;
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 Day17B {
	InputStream is;
	FastWriter out;

	String INPUT = "";

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

		int S = (int)Math.sqrt(n);
		Arrays.sort(rs, (x, y) -> {
			if(x[0]/S != y[0]/S)return x[0]/S - y[0]/S;
			return x[0]/S% 2 == 0 ? x[1] - y[1] : y[1] - x[1];
		});

		int[] P = new int[Q];
		for(int i = 0;i < Q;i++){
			P[i] = rs[i][2];
		}

//		tr(score(rs, P, ws));
		for(int i = 0;i < Q;i++){
			out.print(P[i]+1 + " ");
		}
		out.println();
	}

	long score(int[][] rs, int[] P, int[] ws)
	{
		int n = ws.length;
		long[] cum = new long[n+1];
		for(int i = 0;i < n;i++){
			cum[i+1] = cum[i] + ws[i];
		}

		long T = 0;
		T += cum[rs[P[0]][1]+1] - cum[rs[P[0]][0]];
		for(int i = 1;i < P.length;i++){
			{
				int l = rs[P[i]][1];
				int r = rs[P[i - 1]][1];
				if(l > r){
					int d = l; l = r; r = d;
				}
				T += cum[r+1] - cum[l+1];
			}
			{
				int l = rs[P[i]][0];
				int r = rs[P[i - 1]][0];
				if(l > r){
					int d = l; l = r; r = d;
				}
				T += cum[r] - cum[l];
			}
		}
		return T;
	}

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

結果

テストケース

ソースコード