#516746 (Java21) No.1121 Social Distancing in Cinema

提出ソース

結果

問題	No.1121 Social Distancing in Cinema
ユーザー	uwi
提出日時	2020-07-22 23:32:47
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,087 bytes
コンパイル時間	3,959 ms
コンパイル使用メモリ	83,548 KB
実行使用メモリ	62,956 KB
最終ジャッジ日時	2024-06-23 01:28:27
合計ジャッジ時間	12,709 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	65 ms 50,864 KB
testcase_01	AC	65 ms 50,656 KB
testcase_02	AC	61 ms 50,684 KB
testcase_03	AC	63 ms 50,708 KB
testcase_04	AC	68 ms 50,536 KB
testcase_05	AC	71 ms 50,888 KB
testcase_06	AC	65 ms 50,784 KB
testcase_07	AC	65 ms 50,660 KB
testcase_08	AC	63 ms 50,636 KB
testcase_09	AC	62 ms 50,772 KB
testcase_10	AC	65 ms 50,928 KB
testcase_11	AC	66 ms 50,892 KB
testcase_12	AC	65 ms 50,520 KB
testcase_13	AC	66 ms 50,528 KB
testcase_14	AC	64 ms 50,556 KB
testcase_15	AC	79 ms 50,644 KB
testcase_16	AC	117 ms 51,788 KB
testcase_17	AC	188 ms 58,276 KB
testcase_18	AC	197 ms 62,504 KB
testcase_19	AC	217 ms 62,384 KB
testcase_20	AC	78 ms 50,780 KB
testcase_21	AC	80 ms 50,992 KB
testcase_22	AC	79 ms 50,784 KB
testcase_23	AC	72 ms 50,740 KB
testcase_24	AC	67 ms 50,836 KB
testcase_25	AC	137 ms 54,220 KB
testcase_26	AC	151 ms 55,200 KB
testcase_27	AC	95 ms 50,876 KB
testcase_28	AC	213 ms 62,600 KB
testcase_29	AC	153 ms 54,260 KB
testcase_30	AC	131 ms 53,880 KB
testcase_31	AC	204 ms 62,456 KB
testcase_32	AC	187 ms 62,372 KB
testcase_33	AC	140 ms 54,796 KB
testcase_34	AC	137 ms 54,344 KB
testcase_35	AC	197 ms 62,392 KB
testcase_36	AC	215 ms 62,392 KB
testcase_37	AC	127 ms 54,120 KB
testcase_38	AC	147 ms 56,864 KB
testcase_39	AC	205 ms 62,372 KB
testcase_40	AC	134 ms 54,304 KB
testcase_41	AC	104 ms 51,788 KB
testcase_42	AC	207 ms 62,484 KB
testcase_43	AC	203 ms 62,252 KB
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	AC	64 ms 50,848 KB
testcase_48	AC	64 ms 50,884 KB

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

ソースコード

raw source code

package contest200722;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] co = new int[n][];
		int[][] seled = new int[n][];
		for(int i = 0;i < n;i++){
			co[i] = new int[]{ni(), ni(), i};
		}
		Arrays.sort(co, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				if(a[0] != b[0])return a[0] - b[0];
				return a[1] - b[1];
			}
		});

		int p = 0;
		int k = 0;
		outer:
		for(int i = 0;i < n;i++){
			for(int j = k;j < p;j++){
				if(seled[j][0] <= co[i][0] - 10){
					k++;
					continue;
				}
				if(d2(co[i], seled[j]) < 100)continue outer;
			}
			seled[p++] = co[i];
		}
		out.println(p);
		for(int i = 0;i < p;i++){
			out.print(seled[i][2]+1 + " ");
		}
		out.println();
	}
	
	public static long d2(int[] a, int[] b) { return (long)(b[0]-a[0])*(b[0]-a[0])+(long)(b[1]-a[1])*(b[1]-a[1]); }

	
	void run() throws Exception
	{
//		int n = 500, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n*n + " ");
//		for (int i = 0; i < n; i++) {
//			for(int j = 0;j < n;j++){
//				sb.append(i + " " + j + "\n");
//			}
//		}
//		INPUT = sb.toString();

		
		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 C().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

結果

テストケース

ソースコード