#302155 (Java21) No.759 悪くない忘年会にしような！

提出ソース

結果

問題	No.759 悪くない忘年会にしような！
ユーザー	uwi
提出日時	2018-12-07 00:20:49
言語	Java21 (openjdk 21)
結果	AC
実行時間	445 ms / 2,000 ms
コード長	5,987 bytes
コンパイル時間	4,932 ms
コンパイル使用メモリ	85,296 KB
実行使用メモリ	60,408 KB
最終ジャッジ日時	2024-09-14 02:44:36
合計ジャッジ時間	16,555 ms
ジャッジサーバーID （参考情報）	judge6 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	56 ms 49,900 KB
testcase_01	AC	56 ms 50,236 KB
testcase_02	AC	56 ms 50,272 KB
testcase_03	AC	58 ms 50,276 KB
testcase_04	AC	58 ms 50,348 KB
testcase_05	AC	56 ms 50,352 KB
testcase_06	AC	56 ms 50,272 KB
testcase_07	AC	57 ms 50,140 KB
testcase_08	AC	56 ms 50,272 KB
testcase_09	AC	56 ms 49,824 KB
testcase_10	AC	56 ms 50,288 KB
testcase_11	AC	56 ms 50,212 KB
testcase_12	AC	56 ms 49,988 KB
testcase_13	AC	56 ms 49,940 KB
testcase_14	AC	58 ms 50,180 KB
testcase_15	AC	57 ms 49,964 KB
testcase_16	AC	54 ms 50,004 KB
testcase_17	AC	55 ms 50,212 KB
testcase_18	AC	55 ms 50,068 KB
testcase_19	AC	54 ms 49,884 KB
testcase_20	AC	55 ms 49,856 KB
testcase_21	AC	55 ms 50,256 KB
testcase_22	AC	56 ms 50,180 KB
testcase_23	AC	55 ms 50,084 KB
testcase_24	AC	57 ms 50,176 KB
testcase_25	AC	55 ms 50,136 KB
testcase_26	AC	55 ms 50,204 KB
testcase_27	AC	57 ms 50,332 KB
testcase_28	AC	56 ms 50,008 KB
testcase_29	AC	55 ms 50,264 KB
testcase_30	AC	56 ms 50,252 KB
testcase_31	AC	55 ms 49,736 KB
testcase_32	AC	55 ms 50,040 KB
testcase_33	AC	111 ms 51,560 KB
testcase_34	AC	64 ms 50,144 KB
testcase_35	AC	93 ms 51,660 KB
testcase_36	AC	98 ms 51,680 KB
testcase_37	AC	66 ms 49,848 KB
testcase_38	AC	116 ms 51,868 KB
testcase_39	AC	66 ms 50,304 KB
testcase_40	AC	102 ms 51,612 KB
testcase_41	AC	104 ms 51,264 KB
testcase_42	AC	116 ms 52,252 KB
testcase_43	AC	117 ms 51,572 KB
testcase_44	AC	333 ms 59,212 KB
testcase_45	AC	291 ms 59,628 KB
testcase_46	AC	310 ms 59,372 KB
testcase_47	AC	307 ms 59,488 KB
testcase_48	AC	310 ms 59,632 KB
testcase_49	AC	119 ms 52,000 KB
testcase_50	AC	119 ms 51,496 KB
testcase_51	AC	114 ms 52,048 KB
testcase_52	AC	117 ms 51,884 KB
testcase_53	AC	308 ms 59,752 KB
testcase_54	AC	309 ms 59,204 KB
testcase_55	AC	302 ms 59,784 KB
testcase_56	AC	291 ms 59,272 KB
testcase_57	AC	304 ms 59,352 KB
testcase_58	AC	312 ms 59,468 KB
testcase_59	AC	356 ms 59,784 KB
testcase_60	AC	310 ms 59,676 KB
testcase_61	AC	301 ms 59,784 KB
testcase_62	AC	299 ms 59,748 KB
testcase_63	AC	409 ms 59,936 KB
testcase_64	AC	424 ms 60,408 KB
testcase_65	AC	344 ms 59,556 KB
testcase_66	AC	445 ms 60,076 KB

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

ソースコード

raw source code

package adv2018;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class Day7_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] ss = new int[n][];
		for(int i = 0;i < n;i++) {
			ss[i] = new int[] {ni(), ni(), ni(), i};
		}
		
		int[] ans = new int[n];
		SegmentTreeRMQ st = new SegmentTreeRMQ(10001);
		Arrays.sort(ss, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				if(a[2] != b[2])return -(a[2] - b[2]);
				if(a[1] != b[1])return -(a[1] - b[1]);
				return -(a[0] - b[0]);
			}
		});
		for(int i = 0;i < n;i++) {
			if(i > 0 && ss[i][0] == ss[i-1][0] && ss[i][1]  == ss[i-1][1] && ss[i][2] == ss[i-1][2]) {
				ans[ss[i][3]] = 1;
				continue;
			}
			if(ss[i][1] > -st.minx(ss[i][0], 10001)) {
				ans[ss[i][3]] = 1;
			}
			if(-st.minx(ss[i][0], ss[i][0]+1) < ss[i][1]) {
				st.update(ss[i][0], -ss[i][1]);
			}
		}
		for(int i = 0;i < n;i++) {
			if(ans[i] == 1) {
				out.println(i+1);
			}
		}
	}
	
	public static class SegmentTreeRMQ {
		public int M, H, N;
		public int[] st;
		
		public SegmentTreeRMQ(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			Arrays.fill(st, 0, M, Integer.MAX_VALUE);
		}
		
		public SegmentTreeRMQ(int[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
			}
			Arrays.fill(st, H+N, M, Integer.MAX_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		public void update(int pos, int x)
		{
			st[H+pos] = x;
			for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
		}
		
		private void propagate(int i)
		{
			st[i] = Math.min(st[2*i], st[2*i+1]);
		}
		
		public int minx(int l, int r){
			int min = Integer.MAX_VALUE;
			if(l >= r)return min;
			while(l != 0){
				int f = l&-l;
				if(l+f > r)break;
				int v = st[(H+l)/f];
				if(v < min)min = v;
				l += f;
			}
			
			while(l < r){
				int f = r&-r;
				int v = st[(H+r)/f-1];
				if(v < min)min = v;
				r -= f;
			}
			return min;
		}
		
		public int min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
		
		private int min(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return st[cur];
			}else{
				int mid = cl+cr>>>1;
				int ret = Integer.MAX_VALUE;
				if(cl < r && l < mid){
					ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
				}
				if(mid < r && l < cr){
					ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
				}
				return ret;
			}
		}
		
		public int firstle(int l, int v) {
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur < H){
						cur = 2*cur;
					}else{
						return cur-H;
					}
				}else{
					cur++;
					if((cur&cur-1) == 0)return -1;
					if((cur&1)==0)cur>>>=1;
				}
			}
		}
		
		public int lastle(int l, int v) {
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur < H){
						cur = 2*cur+1;
					}else{
						return cur-H;
					}
				}else{
					if((cur&cur-1) == 0)return -1;
					cur--;
					if((cur&1)==1)cur>>>=1;
				}
			}
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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();
	}
	
	public static void main(String[] args) throws Exception { new Day7_2().run(); }
	
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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 ni() { return (int)nl(); }
	
	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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード