結果

問題 No.190 Dry Wet Moist
ユーザー ぴろずぴろず
提出日時 2015-05-18 11:42:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 644 ms / 2,000 ms
コード長 4,618 bytes
コンパイル時間 2,395 ms
コンパイル使用メモリ 82,052 KB
実行使用メモリ 63,424 KB
最終ジャッジ日時 2023-09-20 09:48:20
合計ジャッジ時間 12,330 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
52,528 KB
testcase_01 AC 81 ms
52,720 KB
testcase_02 AC 79 ms
54,656 KB
testcase_03 AC 78 ms
52,832 KB
testcase_04 AC 79 ms
53,632 KB
testcase_05 AC 79 ms
52,608 KB
testcase_06 AC 80 ms
52,628 KB
testcase_07 AC 96 ms
52,740 KB
testcase_08 AC 92 ms
52,588 KB
testcase_09 AC 90 ms
53,656 KB
testcase_10 AC 84 ms
53,780 KB
testcase_11 AC 88 ms
52,804 KB
testcase_12 AC 336 ms
58,228 KB
testcase_13 AC 488 ms
58,680 KB
testcase_14 AC 341 ms
58,432 KB
testcase_15 AC 398 ms
60,596 KB
testcase_16 AC 524 ms
60,720 KB
testcase_17 AC 180 ms
56,616 KB
testcase_18 AC 316 ms
58,848 KB
testcase_19 AC 540 ms
60,984 KB
testcase_20 AC 410 ms
59,092 KB
testcase_21 AC 167 ms
55,120 KB
testcase_22 AC 636 ms
63,424 KB
testcase_23 AC 565 ms
62,984 KB
testcase_24 AC 644 ms
63,076 KB
testcase_25 AC 78 ms
53,420 KB
testcase_26 AC 79 ms
52,920 KB
testcase_27 AC 434 ms
61,036 KB
testcase_28 AC 270 ms
59,128 KB
testcase_29 AC 329 ms
58,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no190;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();
	public static void main(String[] args) {
		int n = io.nextInt();
		Integer[] a = new Integer[n*2];
		for(int i=0;i<n*2;i++) {
			a[i] = io.nextInt();
		}
		int dry = dry(a);
		int moist = moist(a);
		for(int i=0;i<n*2;i++) {
			a[i] *= -1;
		}
		int wet = dry(a);
		System.out.println(dry + " " + wet + " " + moist);
	}

	public static int moist(Integer[] a) {
		int n = a.length;
		Arrays.sort(a);
		int ans = 0;
		int i = 0;
		int j = n-1;
		while(i < j) {
			while(i < j && a[i] + a[j] > 0) {
				j--;
			}
			if (i < j && a[i] + a[j] == 0) {
				ans++;
				j--;
			}
			i++;
		}
		return ans;
	}

	public static int dry(Integer[] a) {
		int n = a.length;
		Arrays.sort(a);
		int ans = 0;
		int i = 0;
		int j = n-1;
		while(i < j) {
			while(i < j && a[i] + a[j] >= 0) {
				j--;
			}
			if (i < j && a[i] + a[j] < 0) {
				ans++;
				j--;
			}
			i++;
		}
		return ans;
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0