#88834 (Java21) No.365 ジェンガソート

• 問題: No.365 ジェンガソート
• ユーザー: ぴろず
• 提出日時: 2016-04-29 22:26:00
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 229 ms / 2,000 ms
• コード長: 4,068 bytes
• コンパイル時間: 2,540 ms
• コンパイル使用メモリ: 79,900 KB
• 実行使用メモリ: 43,928 KB
• 最終ジャッジ日時: 2024-04-20 06:28:43
• 合計ジャッジ時間: 8,803 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	58 ms; 36,756 KB
testcase_01	AC	56 ms; 37,028 KB
testcase_02	AC	56 ms; 36,920 KB
testcase_03	AC	57 ms; 36,856 KB
testcase_04	AC	57 ms; 37,180 KB
testcase_05	AC	57 ms; 36,856 KB
testcase_06	AC	56 ms; 37,020 KB
testcase_07	AC	56 ms; 36,980 KB
testcase_08	AC	56 ms; 36,572 KB
testcase_09	AC	56 ms; 36,728 KB
testcase_10	AC	56 ms; 36,604 KB
testcase_11	AC	55 ms; 37,024 KB
testcase_12	AC	54 ms; 36,856 KB
testcase_13	AC	54 ms; 36,612 KB
testcase_14	AC	56 ms; 36,948 KB
testcase_15	AC	56 ms; 37,088 KB
testcase_16	AC	190 ms; 43,040 KB
testcase_17	AC	183 ms; 43,260 KB
testcase_18	AC	92 ms; 38,140 KB
testcase_19	AC	156 ms; 41,644 KB
testcase_20	AC	90 ms; 38,816 KB
testcase_21	AC	128 ms; 39,544 KB
testcase_22	AC	190 ms; 42,504 KB
testcase_23	AC	151 ms; 40,768 KB
testcase_24	AC	188 ms; 42,752 KB
testcase_25	AC	126 ms; 40,112 KB
testcase_26	AC	166 ms; 41,528 KB
testcase_27	AC	225 ms; 43,640 KB
testcase_28	AC	168 ms; 41,876 KB
testcase_29	AC	215 ms; 43,200 KB
testcase_30	AC	174 ms; 41,920 KB
testcase_31	AC	133 ms; 40,180 KB
testcase_32	AC	132 ms; 40,156 KB
testcase_33	AC	228 ms; 43,404 KB
testcase_34	AC	119 ms; 39,284 KB
testcase_35	AC	189 ms; 42,868 KB
testcase_36	AC	121 ms; 41,540 KB
testcase_37	AC	123 ms; 41,212 KB
testcase_38	AC	229 ms; 43,928 KB
testcase_39	AC	118 ms; 41,468 KB
testcase_40	AC	143 ms; 41,820 KB

ソースコード

package no365;

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 {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		Integer[] a = new Integer[n];
		for(int i=0;i<n;i++) {
			a[i] = io.nextInt();
		}
		Integer[] b = Arrays.copyOf(a, n);
		Arrays.sort(b);
		int ind = n - 1;
		for(int i=n-1;i>=0;i--) {
			if (a[i] == b[ind]) {
				ind--;
			}
		}
		System.out.println(ind + 1);
	}

}
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) {}}
}