結果

問題 No.190 Dry Wet Moist
ユーザー threepipes_sthreepipes_s
提出日時 2015-04-22 00:40:01
言語 Java19
(openjdk 21)
結果
AC  
実行時間 718 ms / 2,000 ms
コード長 3,639 bytes
コンパイル時間 3,743 ms
コンパイル使用メモリ 84,156 KB
実行使用メモリ 83,208 KB
最終ジャッジ日時 2023-09-18 04:26:15
合計ジャッジ時間 11,723 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
50,444 KB
testcase_01 AC 66 ms
50,456 KB
testcase_02 AC 66 ms
50,592 KB
testcase_03 AC 66 ms
50,452 KB
testcase_04 AC 67 ms
50,976 KB
testcase_05 AC 71 ms
50,412 KB
testcase_06 AC 67 ms
50,860 KB
testcase_07 AC 86 ms
51,756 KB
testcase_08 AC 80 ms
50,620 KB
testcase_09 AC 77 ms
50,908 KB
testcase_10 AC 88 ms
52,424 KB
testcase_11 AC 76 ms
50,664 KB
testcase_12 AC 348 ms
64,000 KB
testcase_13 AC 399 ms
67,728 KB
testcase_14 AC 356 ms
66,992 KB
testcase_15 AC 442 ms
67,536 KB
testcase_16 AC 522 ms
83,032 KB
testcase_17 AC 194 ms
56,568 KB
testcase_18 AC 320 ms
64,736 KB
testcase_19 AC 518 ms
83,208 KB
testcase_20 AC 394 ms
68,340 KB
testcase_21 AC 165 ms
56,320 KB
testcase_22 AC 649 ms
77,772 KB
testcase_23 AC 624 ms
77,476 KB
testcase_24 AC 718 ms
80,108 KB
testcase_25 AC 65 ms
50,600 KB
testcase_26 AC 71 ms
50,888 KB
testcase_27 AC 446 ms
68,480 KB
testcase_28 AC 269 ms
62,080 KB
testcase_29 AC 319 ms
62,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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());
	}
}
0