結果
問題 | No.947 ABC包囲網 |
ユーザー | uwi |
提出日時 | 2019-12-10 02:36:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 86 ms / 2,000 ms |
コード長 | 5,133 bytes |
コンパイル時間 | 4,221 ms |
コンパイル使用メモリ | 86,268 KB |
実行使用メモリ | 51,264 KB |
最終ジャッジ日時 | 2024-06-23 13:25:55 |
合計ジャッジ時間 | 9,526 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,272 KB |
testcase_01 | AC | 54 ms
50,180 KB |
testcase_02 | AC | 53 ms
50,068 KB |
testcase_03 | AC | 53 ms
50,192 KB |
testcase_04 | AC | 54 ms
50,340 KB |
testcase_05 | AC | 53 ms
50,204 KB |
testcase_06 | AC | 53 ms
50,224 KB |
testcase_07 | AC | 53 ms
50,264 KB |
testcase_08 | AC | 53 ms
50,476 KB |
testcase_09 | AC | 54 ms
50,300 KB |
testcase_10 | AC | 54 ms
50,024 KB |
testcase_11 | AC | 53 ms
50,364 KB |
testcase_12 | AC | 54 ms
50,208 KB |
testcase_13 | AC | 54 ms
49,980 KB |
testcase_14 | AC | 52 ms
50,208 KB |
testcase_15 | AC | 55 ms
50,280 KB |
testcase_16 | AC | 53 ms
50,388 KB |
testcase_17 | AC | 54 ms
49,976 KB |
testcase_18 | AC | 54 ms
50,260 KB |
testcase_19 | AC | 56 ms
49,876 KB |
testcase_20 | AC | 54 ms
49,876 KB |
testcase_21 | AC | 54 ms
50,368 KB |
testcase_22 | AC | 54 ms
49,936 KB |
testcase_23 | AC | 54 ms
49,976 KB |
testcase_24 | AC | 55 ms
50,464 KB |
testcase_25 | AC | 54 ms
50,216 KB |
testcase_26 | AC | 54 ms
50,232 KB |
testcase_27 | AC | 54 ms
50,232 KB |
testcase_28 | AC | 76 ms
51,208 KB |
testcase_29 | AC | 84 ms
51,220 KB |
testcase_30 | AC | 70 ms
50,920 KB |
testcase_31 | AC | 76 ms
51,144 KB |
testcase_32 | AC | 77 ms
50,732 KB |
testcase_33 | AC | 86 ms
51,260 KB |
testcase_34 | AC | 75 ms
51,052 KB |
testcase_35 | AC | 77 ms
50,816 KB |
testcase_36 | AC | 76 ms
51,256 KB |
testcase_37 | AC | 76 ms
50,912 KB |
testcase_38 | AC | 78 ms
50,988 KB |
testcase_39 | AC | 78 ms
51,256 KB |
testcase_40 | AC | 75 ms
51,044 KB |
testcase_41 | AC | 84 ms
51,184 KB |
testcase_42 | AC | 73 ms
51,244 KB |
testcase_43 | AC | 73 ms
51,260 KB |
testcase_44 | AC | 74 ms
51,012 KB |
testcase_45 | AC | 83 ms
51,264 KB |
testcase_46 | AC | 72 ms
51,168 KB |
testcase_47 | AC | 74 ms
50,832 KB |
testcase_48 | AC | 74 ms
50,744 KB |
testcase_49 | AC | 78 ms
50,872 KB |
testcase_50 | AC | 73 ms
50,820 KB |
testcase_51 | AC | 54 ms
50,372 KB |
testcase_52 | AC | 54 ms
50,168 KB |
testcase_53 | AC | 53 ms
50,328 KB |
testcase_54 | AC | 53 ms
49,940 KB |
testcase_55 | AC | 54 ms
49,980 KB |
testcase_56 | AC | 53 ms
50,336 KB |
testcase_57 | AC | 55 ms
49,840 KB |
testcase_58 | AC | 56 ms
50,292 KB |
testcase_59 | AC | 55 ms
50,400 KB |
ソースコード
package adv2019; 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 D10_4 { InputStream is; PrintWriter out; String INPUT = ""; // O(nlog n) void solve() { int n = ni(); int[][] co = new int[n][]; for(int i = 0;i < n;i++) { co[i] = na(2); } { int p = 0; for(int i = 0;i < n;i++) { if(co[i][0] == 0 && co[i][1] == 0)continue; co[p++] = co[i]; } co = Arrays.copyOf(co, p); n = p; } Arrays.sort(co, compArgi); long ans = 0; int[] ks = new int[n]; int[] ls = new int[n]; int k = 0, l = 0; int[] Z = {0, 0}; for(int i = 0;i < n;i++) { while(k < n && ccw(Z, co[i], co[k]) != 1)k++; while(l < n && (ccw(Z, co[i], co[l]) == -1 || isACB(Z, co[l], co[i])))l++; ks[i] = k; ls[i] = l; } int p = 0, q = 0; long lsum = 0; for(int i = 0;i < n;i++) { while(p < ls[i]) { lsum += ls[p]; p++; } while(q < n && ls[q] - ks[i] <= 0) { lsum -= ls[q]; q++; } ans += lsum - (long)(p-q) * ks[i]; } out.println(ans); } public static boolean isACB(long ax, long ay, long bx, long by, long cx, long cy) { return (cx-ax)*(by-ay)-(cy-ay)*(bx-ax)==0 && (cx-ax)*(cx-bx)+(cy-ay)*(cy-by) <= 0; } public static boolean isACB(long[] a, long[] b, long[] c) { return isACB(a[0], a[1], b[0], b[1], c[0], c[1]); } public static boolean isACB(int[] a, int[] b, int[] c) { return isACB(a[0], a[1], b[0], b[1], c[0], c[1]); } public static int ccw(long ax, long ay, long bx, long by, long tx, long ty){ return Long.signum((tx-ax)*(by-ay)-(bx-ax)*(ty-ay)); } public static int ccw(long[] a, long[] b, long[] t){ return Long.signum((t[0]-a[0])*(b[1]-a[1])-(b[0]-a[0])*(t[1]-a[1])); } public static int ccw(int[] a, int[] b, int[] t){ return Long.signum((long)(t[0]-a[0])*(b[1]-a[1])-(long)(b[0]-a[0])*(t[1]-a[1])); } public static Comparator<int[]> compArgi = new Comparator<int[]>(){ public int compare(int[] a, int[] b) { long ax = a[0], ay = a[1]; long bx = b[0], by = b[1]; int za = ay > 0 || ay == 0 && ax > 0 ? 0 : 1; int zb = by > 0 || by == 0 && bx > 0 ? 0 : 1; if(za != zb)return za - zb; if(ay*bx-ax*by != 0)return Long.signum(ay*bx-ax*by); return Long.signum((ax*ax+ay*ay)-(bx*bx+by*by)); } }; 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 D10_4().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)); } }