結果
問題 | No.1121 Social Distancing in Cinema |
ユーザー | uwi |
提出日時 | 2020-07-22 23:36:14 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,389 bytes |
コンパイル時間 | 4,737 ms |
コンパイル使用メモリ | 79,532 KB |
実行使用メモリ | 67,684 KB |
最終ジャッジ日時 | 2023-09-05 05:03:45 |
合計ジャッジ時間 | 15,172 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
50,384 KB |
testcase_01 | AC | 72 ms
50,644 KB |
testcase_02 | AC | 69 ms
50,556 KB |
testcase_03 | AC | 68 ms
50,732 KB |
testcase_04 | AC | 66 ms
50,700 KB |
testcase_05 | AC | 67 ms
50,568 KB |
testcase_06 | AC | 69 ms
50,720 KB |
testcase_07 | AC | 71 ms
50,648 KB |
testcase_08 | AC | 71 ms
50,612 KB |
testcase_09 | AC | 72 ms
50,796 KB |
testcase_10 | AC | 68 ms
50,596 KB |
testcase_11 | AC | 71 ms
50,736 KB |
testcase_12 | AC | 71 ms
50,548 KB |
testcase_13 | AC | 68 ms
50,400 KB |
testcase_14 | AC | 72 ms
50,616 KB |
testcase_15 | AC | 82 ms
51,796 KB |
testcase_16 | AC | 120 ms
52,376 KB |
testcase_17 | AC | 174 ms
58,584 KB |
testcase_18 | AC | 219 ms
62,740 KB |
testcase_19 | AC | 217 ms
62,532 KB |
testcase_20 | AC | 80 ms
51,820 KB |
testcase_21 | AC | 80 ms
51,400 KB |
testcase_22 | AC | 80 ms
51,692 KB |
testcase_23 | AC | 75 ms
50,560 KB |
testcase_24 | AC | 70 ms
50,556 KB |
testcase_25 | AC | 143 ms
54,604 KB |
testcase_26 | AC | 147 ms
55,120 KB |
testcase_27 | AC | 94 ms
51,884 KB |
testcase_28 | AC | 220 ms
62,656 KB |
testcase_29 | AC | 149 ms
54,884 KB |
testcase_30 | AC | 140 ms
55,236 KB |
testcase_31 | AC | 224 ms
62,820 KB |
testcase_32 | AC | 204 ms
62,704 KB |
testcase_33 | AC | 143 ms
54,928 KB |
testcase_34 | AC | 143 ms
55,252 KB |
testcase_35 | AC | 211 ms
60,524 KB |
testcase_36 | AC | 228 ms
62,664 KB |
testcase_37 | AC | 133 ms
54,864 KB |
testcase_38 | AC | 148 ms
56,992 KB |
testcase_39 | AC | 246 ms
64,540 KB |
testcase_40 | AC | 132 ms
54,516 KB |
testcase_41 | AC | 103 ms
52,488 KB |
testcase_42 | AC | 262 ms
64,328 KB |
testcase_43 | AC | 249 ms
66,440 KB |
testcase_44 | AC | 457 ms
67,684 KB |
testcase_45 | AC | 435 ms
67,184 KB |
testcase_46 | WA | - |
testcase_47 | AC | 75 ms
50,688 KB |
testcase_48 | AC | 73 ms
50,776 KB |
ソースコード
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][]; 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+89)/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; } } } 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)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]); } 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)); } }