結果
| 問題 | No.190 Dry Wet Moist |
| ユーザー |
 yuya178
|
| 提出日時 | 2017-10-17 23:51:17 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 536 ms / 2,000 ms |
| コード長 | 5,436 bytes |
| コンパイル時間 | 2,436 ms |
| コンパイル使用メモリ | 92,956 KB |
| 実行使用メモリ | 82,996 KB |
| 最終ジャッジ日時 | 2024-11-18 08:18:10 |
| 合計ジャッジ時間 | 11,726 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 28 |
ソースコード
import java.io.*;import java.util.*;public class Main {static InputStream is;static PrintWriter out;static String INPUT = "";static long[][] a;static int min = Integer.MAX_VALUE;static int townsize;static int[] town;static void solve(){int n = ni()*2;int[] a = new int[n];for(int i = 0; i < n; i++){a[i] = ni();}Arrays.sort(a);int[] ans = new int[3];int j = n-1;for(int i = 0; i < n; i++){while(a[i] + a[j] >= 0 && i < j) j--;if(i < j){ans[0]++;j--;}}j = 0;for(int i = n-1; i >= 0; i--){while(a[i] + a[j] <= 0 && i > j) j++;if(i > j){ans[1]++;j++;}}HashMap<Integer, Integer> map = new HashMap<>();Set<Integer> set = new HashSet<>();for (int i = 0; i < n; i++) {int v = a[i];map.merge(v, 1, (x, y) -> x + y);set.add(v);}for(int i : set){if(i > 0) continue;if(i == 0){ans[2] += map.get(0)/2;}if(i < 0){ans[2] += Math.min(map.getOrDefault(i,0),map.getOrDefault(-i,0));}}out.println(ans[0]+" "+ans[1]+" "+ans[2]);}public static void main(String[] args) throws Exception{long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-S+"ms");}private static boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private static byte[] inbuf = new byte[1024];static int lenbuf = 0, ptrbuf = 0;private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private static double nd() { return Double.parseDouble(ns()); }private static char nc() { return (char)skip(); }private static String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){sb.appendCodePoint(b);b = readByte();}return sb.toString();}private static 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 static 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 static int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private static int ni(){int num = 0, 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 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }private static int[] nsi(){char[] s = ns().toCharArray();int[] a = new int[s.length];for(int j = 0; j < s.length; j++){a[j] = s[j] - '0';}return a;}}