結果
問題 | No.189 SUPER HAPPY DAY |
ユーザー | threepipes_s |
提出日時 | 2015-04-22 01:49:10 |
言語 | Java21 (openjdk 21) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,639 bytes |
コンパイル時間 | 3,617 ms |
コンパイル使用メモリ | 84,520 KB |
実行使用メモリ | 56,196 KB |
最終ジャッジ日時 | 2023-09-18 07:40:55 |
合計ジャッジ時間 | 4,851 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
ソースコード
import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.Deque; import java.util.HashSet; import java.util.LinkedList; import java.util.List; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { ContestScanner in = new ContestScanner(); int n = in.nextInt()*2; int[] a = new int[n]; for(int i=0; i<n; i++){ a[i] = in.nextInt(); } Arrays.sort(a); Deque<Integer> qu = new LinkedList<Integer>(); for(int i=0; i<n; i++){ qu.add(a[i]); } // List<Integer> list = new LinkedList<Integer>(); int count = 0; while(qu.size()>1){ if(qu.peekFirst() + qu.peekLast() < 0){ count++; qu.pollFirst(); qu.pollLast(); } else{ qu.pollLast(); } } System.out.print(count+" "); qu = new LinkedList<Integer>(); for(int i=0; i<n; i++){ qu.add(a[i]); } // List<Integer> list = new LinkedList<Integer>(); count = 0; while(qu.size()>1){ if(qu.peekFirst() + qu.peekLast() > 0){ count++; qu.pollFirst(); qu.pollLast(); } else{ qu.pollFirst(); } } System.out.print(count+" "); qu = new LinkedList<Integer>(); // list = new LinkedList<Integer>(); for(int i=0; i<n; i++){ qu.add(a[i]); } count = 0; while(qu.size()>1){ if(qu.peekFirst() + qu.peekLast() == 0){ count++; qu.pollFirst(); qu.pollLast(); }else if(qu.peekFirst() + qu.peekLast() < 0){ qu.pollFirst(); }else{ qu.pollLast(); } } System.out.println(count); } } class Node{ int id; HashSet<Node> edge = new HashSet<Node>(); public Node(int id) { this.id = id; } public void createEdge(Node node) { edge.add(node); } } class MyComp implements Comparator<int[]> { final int idx; public MyComp(int idx){ this.idx = idx; } public int compare(int[] a, int[] b) { return a[idx] - b[idx]; } } class Reverse implements Comparator<Integer> { public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } class ContestWriter { private PrintWriter out; public ContestWriter(String filename) throws IOException { out = new PrintWriter(new BufferedWriter(new FileWriter(filename))); } public ContestWriter() throws IOException { out = new PrintWriter(System.out); } public void println(String str) { out.println(str); } public void print(String str) { out.print(str); } public void close() { out.close(); } } class ContestScanner { private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException { reader = new BufferedReader(new InputStreamReader(System.in)); } public ContestScanner(String filename) throws FileNotFoundException { reader = new BufferedReader(new InputStreamReader(new FileInputStream( filename))); } public String nextToken() throws IOException { if (line == null || line.length <= idx) { line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public String readLine() throws IOException{ return reader.readLine(); } public long nextLong() throws IOException, NumberFormatException { return Long.parseLong(nextToken()); } public int nextInt() throws NumberFormatException, IOException { return (int) nextLong(); } public double nextDouble() throws NumberFormatException, IOException { return Double.parseDouble(nextToken()); } }