結果

問題 No.335 門松宝くじ
ユーザー ぴろずぴろず
提出日時 2016-01-15 23:30:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 765 ms / 2,000 ms
コード長 7,044 bytes
コンパイル時間 2,333 ms
コンパイル使用メモリ 91,980 KB
実行使用メモリ 57,340 KB
最終ジャッジ日時 2024-09-19 19:31:06
合計ジャッジ時間 8,694 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,568 KB
testcase_01 AC 52 ms
50,600 KB
testcase_02 AC 57 ms
50,256 KB
testcase_03 AC 56 ms
50,568 KB
testcase_04 AC 54 ms
50,560 KB
testcase_05 AC 300 ms
56,480 KB
testcase_06 AC 365 ms
56,436 KB
testcase_07 AC 533 ms
56,536 KB
testcase_08 AC 538 ms
56,408 KB
testcase_09 AC 732 ms
56,444 KB
testcase_10 AC 757 ms
57,340 KB
testcase_11 AC 765 ms
57,036 KB
testcase_12 AC 754 ms
57,108 KB
testcase_13 AC 721 ms
56,444 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no335;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int m = io.nextInt();
		Pair[] p = new Pair[m];
		for(int ee=0;ee<m;ee++) {
			int[] a = io.nextIntArray(n);
			RangeMaximumQuery maxq = new RangeMaximumQuery(n);
			RangeMinimumQuery minq = new RangeMinimumQuery(n);
			for(int i=0;i<n;i++) {
				maxq.set(i, a[i]);
				minq.set(i, a[i]);
			}
			int exp = 0;
			for(int i=0;i<n;i++) {
				for(int j=i+1;j<n;j++) {
					int x = a[i];
					int y = a[j];
					long max = 0;
					int xymax = Math.max(x, y);
					long lmax = maxq.max(0, i);
					long cmax = maxq.max(i+1,j);
					long rmax = maxq.max(j+1, n);
					long lmin = minq.min(0, i);
					long cmin = minq.min(i+1,j);
					long rmin = minq.min(j+1, n);
					if (x > y && lmin > x && rmax < y && cmin > y && cmax < x) {
						continue;
					}
					if (x < y && lmax < x && rmin > y && cmin > x && cmin < y) {
						continue;
					}
					max = xymax;
					if (cmax > xymax) {
						max = Math.max(max, cmax);
					}
					if (x < y && lmax > xymax) {
						max = Math.max(max, lmax);
					}
					if (x > y && rmax > xymax) {
						max = Math.max(max, rmax);
					}
					exp += max;
				}
			}
			p[ee] = new Pair(ee,exp);
		}
		Arrays.sort(p,(x,y)->{
			if (x.exp != y.exp) {
				return -Integer.compare(x.exp, y.exp);
			}
			return Integer.compare(x.id, y.id);
		});
		System.out.println(p[0].id);
	}
}
class Pair {
	int id, exp;
	public Pair(int id,int exp) {
		this.id = id;
		this.exp = exp;
	}
}
class RangeMinimumQuery {
	public static final long INF = (1L<<60);
	private int size,n = 1;
	private long[] data;
	public RangeMinimumQuery(int size) {
		this.size = size;
		while(this.n<this.size) {
			this.n*=2;
		}
		data = new long[n*2-1];
		this.init();
	}

	private void init() {
		Arrays.fill(data, INF);
	}

	public void set(int i,long x) {
		i+=n-1;
		data[i] = x;
		while(i>0) {
			i=(i-1)/2;
			data[i] = Math.min(data[i*2+1],data[i*2+2]);
		}
	}

	public long get(int i) {
		return data[i+n-1];
	}

	public long min(long begin,long end) {
		return query(begin,end,0,0,n);
	}

	private long query(long a,long b,int k,int l,int r) {
		if (r<=a || b<=l) {
			return INF;
		}
		if (a<=l && r<=b) {
			return data[k];
		}else{
			return Math.min(query(a,b,k*2+1,l,(l+r)/2),query(a,b,k*2+2,(l+r)/2,r));
		}
	}

	public String toString() {
		return Arrays.toString(Arrays.copyOfRange(data, n-1, size+n-1));
	}
}
class RangeMaximumQuery {
	public static final long INF = (1L<<60);
	private int size,n = 1;
	private long[] data;
	public RangeMaximumQuery(int size) {
		this.size = size;
		while(this.n<this.size) {
			this.n*=2;
		}
		data = new long[n*2-1];
		this.init();
	}

	private void init() {
		Arrays.fill(data, -INF);
	}

	public void set(int i,long x) {
		i+=n-1;
		data[i] = x;
		while(i>0) {
			i=(i-1)/2;
			data[i] = Math.max(data[i*2+1],data[i*2+2]);
		}
	}

	public long get(int i) {
		return data[i+n-1];
	}

	public long max(long begin,long end) {
		return query(begin,end,0,0,n);
	}

	private long query(long a,long b,int k,int l,int r) {
		if (r<=a || b<=l) {
			return -INF;
		}
		if (a<=l && r<=b) {
			return data[k];
		}else{
			return Math.max(query(a,b,k*2+1,l,(l+r)/2),query(a,b,k*2+2,(l+r)/2,r));
		}
	}

	public String toString() {
		return Arrays.toString(Arrays.copyOfRange(data, n-1, size+n-1));
	}
}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0