#946764 (Java21) No.2617 容量3のナップザック

提出ソース
結果

問題	No.2617 容量3のナップザック
ユーザー	uwi
提出日時	2024-01-26 23:03:33
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	15,163 bytes
コンパイル時間	5,784 ms
コンパイル使用メモリ	95,808 KB
実行使用メモリ	137,856 KB
最終ジャッジ日時	2024-01-26 23:04:26
合計ジャッジ時間	43,649 ms
ジャッジサーバーID （参考情報）	judge11 / judge13
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	74 ms 61,464 KB
testcase_01	AC	80 ms 54,780 KB
testcase_02	AC	76 ms 54,660 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	74 ms 54,652 KB
testcase_06	WA	-
testcase_07	AC	80 ms 54,672 KB
testcase_08	AC	77 ms 54,664 KB
testcase_09	AC	79 ms 54,668 KB
testcase_10	AC	78 ms 54,656 KB
testcase_11	AC	82 ms 54,660 KB
testcase_12	TLE	-
testcase_13	AC	988 ms 123,108 KB
testcase_14	TLE	-
testcase_15	AC	1,135 ms 103,992 KB
testcase_16	TLE	-
testcase_17	TLE	-
testcase_18	AC	1,863 ms 113,388 KB
testcase_19	AC	343 ms 65,764 KB
testcase_20	AC	1,038 ms 122,784 KB
testcase_21	AC	1,274 ms 87,648 KB
testcase_22	AC	1,186 ms 130,072 KB
testcase_23	TLE	-
testcase_24	AC	255 ms 61,316 KB
testcase_25	WA	-
testcase_26	TLE	-
testcase_27	AC	1,107 ms 78,564 KB
testcase_28	AC	260 ms 60,648 KB
testcase_29	WA	-
testcase_30	AC	1,422 ms 120,112 KB
testcase_31	AC	1,928 ms 111,032 KB
testcase_32	TLE	-
testcase_33	TLE	-
testcase_34	TLE	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
権限があれば一括ダウンロードができます
ソースコード

raw source code
package contest240126.contest240126;
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class D {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		// 3
		// 2+1
		// 1+1+1
		// 2
		// 1+1
		// 1

		int n = ni();
		int K = ni();
		long seed = ni();
		long a = nl(), b = nl(), m = nl();
		long[] f = new long[2*n];
		f[0] = seed;
		for(int i = 1;i < 2*n;i++){
			f[i] = (a*f[i-1]+b)%m;
		}
		long[] w = new long[n];
		long[] v = new long[n];
		for(int i = 0;i < n;i++){
			w[i] = f[i] % 3 + 1;
			v[i] = w[i] * f[n+i];
		}
//		tr(w);
//		tr(v);

		List<List<Long>> ws = new ArrayList<>();
		for(int i = 0;i < 4;i++){
			ws.add(new ArrayList<>());
		}
		for(int i = 0;i  < n;i++){
			ws.get((int)w[i]).add(v[i]);
		}

		for(int i = 0;i < 4;i++){
			Collections.sort(ws.get(i));
			Collections.reverse(ws.get(i));
		}

		long[] twocum = new long[ws.get(2).size()+1];
		for(int i = 0;i < ws.get(2).size();i++){
			twocum[i+1] = twocum[i] + ws.get(2).get(i);
		}

		long[] threecum = new long[ws.get(3).size()+1];
		for(int i = 0;i < ws.get(3).size();i++){
			threecum[i+1] = threecum[i] + ws.get(3).get(i);
		}

		long[][] otcum = new long[2][K+1];
		long[][] ot = new long[2][K];
		for(int k = 0;k < 2;k++) {
			for (int i = 0; i < K; i++) {
				ot[k][i] = (i*2 + k < ws.get(1).size() ? ws.get(1).get(i * 2 + k) : 0)
						+ (i*2+1 + k < ws.get(1).size() ? ws.get(1).get(i * 2 + 1 + k) :  0);;
				otcum[k][i + 1] = otcum[k][i] + ot[k][i];
			}
		}
		
		long[] onecum = new long[K+1];
		for(int i = 0;i < K;i++){
			onecum[i+1] = onecum[i] + (i < ws.get(1).size() ? ws.get(1).get(i) : 0);
		}

		long ans = 0;
		for(int three = 0;three <= K && three <= ws.get(3).size();three++){
			long sum = threecum[three] + onecum[K-three];
//			tr(three, sum);
			long low = -1, high = 2000000007;
//			tr(ws.get(2));
//			tr(ot[K - three & 1]);
			while(high - low > 1) {
				long h = high + low >> 1;
				int ind2 = Math.min(K - three, rlowerBound(ws.get(2), h));
				int ind1 = Math.min(K - three, rlowerBound(ot[K - three & 1], h) - (K - three) / 2);
//				tr(ind2, ind1, h, K-three);
				if (ind2 + ind1 >= (K - three)) {
					low = h;
				} else {
					high = h;
				}
			}
			long h = low;
			int ind2 = Math.min(K - three, rlowerBound(ws.get(2), h));
			int ind1 = Math.min(K - three, rlowerBound(ot[K - three & 1], h) - (K - three) / 2);
			ind2 = Math.min(ind2, K-three - ind1);
			int ind = Math.min(K-three+(K-three)/2, rlowerBound(ot[K-three&1], h));
//			tr(ind2, ind, (K-three)/2, K, otcum[1]);
			ans = Math.max(ans, sum + twocum[ind2] + otcum[K-three&1][ind] - otcum[K-three&1][(K-three)/2]);
		}
		out.println(ans);

		// a1,a2,a3
		// a1+2a2+3a3 = 3k
		// a2+a3 <= k
	}

	public static int lowerBound(List<Integer> a, int v){ return lowerBound(a, 0, a.size(), v); }
	public static int lowerBound(List<Integer> a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.size())throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a.get(h) >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	public static int rlowerBound(List<Long> a, long v){ return rlowerBound(a, 0, a.size(), v); }
	public static int rlowerBound(List<Long> a, int l, int r, long v)
	{
		if(l > r || l < 0 || r > a.size())throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a.get(h) <= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	public static int rlowerBound(long[] a, long v){ return rlowerBound(a, 0, a.length, v); }
	public static int rlowerBound(long[] a, int l, int r, long v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] <= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	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[][] 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

結果

テストケース

ソースコード
