結果

問題 No.1121 Social Distancing in Cinema
ユーザー uwiuwi
提出日時 2020-07-22 23:49:57
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 6,173 bytes
コンパイル時間 5,457 ms
コンパイル使用メモリ 87,048 KB
実行使用メモリ 77,844 KB
最終ジャッジ日時 2024-06-23 02:03:26
合計ジャッジ時間 18,273 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
43,440 KB
testcase_01 AC 73 ms
37,808 KB
testcase_02 AC 72 ms
37,864 KB
testcase_03 AC 70 ms
37,936 KB
testcase_04 AC 71 ms
37,708 KB
testcase_05 AC 71 ms
37,632 KB
testcase_06 AC 72 ms
37,800 KB
testcase_07 AC 70 ms
37,812 KB
testcase_08 AC 71 ms
38,020 KB
testcase_09 AC 70 ms
37,676 KB
testcase_10 AC 72 ms
37,788 KB
testcase_11 AC 71 ms
37,936 KB
testcase_12 AC 71 ms
37,740 KB
testcase_13 AC 72 ms
37,924 KB
testcase_14 AC 74 ms
37,624 KB
testcase_15 AC 89 ms
38,104 KB
testcase_16 AC 128 ms
40,272 KB
testcase_17 AC 194 ms
47,444 KB
testcase_18 AC 232 ms
52,096 KB
testcase_19 AC 243 ms
52,108 KB
testcase_20 AC 91 ms
38,180 KB
testcase_21 AC 89 ms
37,932 KB
testcase_22 AC 86 ms
37,980 KB
testcase_23 AC 77 ms
37,572 KB
testcase_24 AC 74 ms
37,632 KB
testcase_25 AC 160 ms
42,552 KB
testcase_26 AC 166 ms
43,316 KB
testcase_27 AC 108 ms
37,968 KB
testcase_28 AC 234 ms
51,920 KB
testcase_29 AC 168 ms
43,020 KB
testcase_30 AC 157 ms
42,176 KB
testcase_31 AC 240 ms
51,968 KB
testcase_32 AC 219 ms
50,896 KB
testcase_33 AC 163 ms
43,052 KB
testcase_34 AC 156 ms
42,708 KB
testcase_35 AC 226 ms
51,456 KB
testcase_36 AC 242 ms
52,256 KB
testcase_37 AC 147 ms
41,172 KB
testcase_38 AC 167 ms
46,120 KB
testcase_39 AC 254 ms
53,772 KB
testcase_40 AC 141 ms
40,660 KB
testcase_41 AC 113 ms
39,212 KB
testcase_42 AC 271 ms
53,616 KB
testcase_43 AC 275 ms
53,964 KB
testcase_44 AC 450 ms
56,388 KB
testcase_45 AC 440 ms
56,100 KB
testcase_46 TLE -
testcase_47 -- -
testcase_48 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
import java.util.Random;

public class C2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] co = new int[n][];
		for(int i = 0;i < n;i++){
			co[i] = new int[]{ni(), ni(), i};
		}
		for(int K = 0;K < 4;K++){
			int[][] seled = go(co);
			if(seled.length >= (n)/90){
				int p = seled.length;
				out.println(p);
				for(int i = 0;i < p;i++){
					out.print(seled[i][2]+1 + " ");
				}
				out.println();
				return;
			}
			for(int[] c : co){
				int d = c[0]; c[0] = c[1]; c[1] = -d;
			}
		}
		for(int i = 0;i < n;i++){
			co[i][1] = -co[i][1];
		}
		for(int K = 0;K < 4;K++){
			int[][] seled = go(co);
			if(seled.length >= (n)/90){
				int p = seled.length;
				out.println(p);
				for(int i = 0;i < p;i++){
					out.print(seled[i][2]+1 + " ");
				}
				out.println();
				return;
			}
			for(int[] c : co){
				int d = c[0]; c[0] = c[1]; c[1] = -d;
			}
		}
		
		Random gen = new Random();
		double[][] xco = new double[n][3];
		while(true){
//			double[][] xco = new double[n][];
			double theta = gen.nextDouble() * Math.PI * 2;
			double st = Math.sin(theta);
			double ct = Math.cos(theta);
			for(int i = 0;i < n;i++){
				xco[i][0] = ct * co[i][0] - st * co[i][1];
				xco[i][1] = st * co[i][0] + ct * co[i][1];
				xco[i][2] = i;
//				xco[i] = new double[]{
//						ct * co[i][0] - st * co[i][1],
//						st * co[i][0] + ct * co[i][1],
//						i
//				};
			}
			
			double[][] seled = go(xco);
			if(seled.length >= (n+89)/90){
				int p = seled.length;
				out.println(p);
				for(int i = 0;i < p;i++){
					out.print((int)seled[i][2]+1 + " ");
				}
				out.println();
				return;
			}
		}
	}
	
	int[][] go(int[][] co)
	{
		int n = co.length;
		int[][] seled = new int[n][];
		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-1e-9)continue outer;
			}
			seled[p++] = co[i];
		}
		return Arrays.copyOf(seled, p);
	}
	
	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]); }
	
	double[][] go(double[][] co)
	{
		int n = co.length;
		double[][] seled = new double[n][];
		Arrays.sort(co, new Comparator<double[]>() {
			public int compare(double[] a, double[] b) {
				return Double.compare(a[0], b[0]);
			}
		});

		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-1e-9)continue outer;
			}
			seled[p++] = co[i];
		}
		return Arrays.copyOf(seled, p);
	}
	
	public static double d2(double[] a, double[] p)
	{
		return ((a[0]-p[0])*(a[0]-p[0])+(a[1]-p[1])*(a[1]-p[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 C2().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)); }
}
0