結果

問題 No.241 出席番号(1)
ユーザー suigingin
提出日時 2015-07-10 23:23:06
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 116 ms
コード長 4,166 Byte
コンパイル時間 2,779 ms
使用メモリ 21,452 KB
最終ジャッジ日時 2019-10-13 05:49:24

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
99_system_test1.txt AC 116 ms
21,352 KB
99_system_test2.txt AC 114 ms
21,292 KB
99_system_test3.txt AC 113 ms
21,172 KB
99_system_test4.txt AC 113 ms
21,360 KB
99_system_test5.txt AC 114 ms
21,228 KB
99_system_test6.txt AC 112 ms
21,120 KB
99_system_test7.txt AC 110 ms
21,168 KB
99_system_test8.txt AC 109 ms
21,160 KB
challenge01.txt AC 110 ms
21,164 KB
challenge02.txt AC 110 ms
21,164 KB
sample1.txt AC 110 ms
21,132 KB
sample2.txt AC 111 ms
21,196 KB
sample3.txt AC 110 ms
21,164 KB
system_test1.txt AC 110 ms
21,236 KB
system_test2.txt AC 113 ms
21,284 KB
system_test3.txt AC 114 ms
21,452 KB
test1.txt AC 110 ms
21,132 KB
test2.txt AC 109 ms
21,128 KB
test3.txt AC 113 ms
21,356 KB
test4.txt AC 113 ms
21,356 KB
test5.txt AC 110 ms
21,128 KB
test6.txt AC 110 ms
21,204 KB
test7.txt AC 109 ms
21,132 KB
test8.txt AC 112 ms
21,200 KB
test9.txt AC 114 ms
21,224 KB
test10.txt AC 115 ms
21,452 KB
test11.txt AC 113 ms
21,264 KB
test12.txt AC 111 ms
21,264 KB
test13.txt AC 113 ms
21,300 KB
test14.txt AC 113 ms
21,268 KB
test15.txt AC 112 ms
21,260 KB
test16.txt AC 113 ms
21,228 KB
テストケース一括ダウンロード

ソースコード

diff #
import java.util.Arrays;
import java.util.Scanner;

public class Main_origin {
	MyScanner sc = new MyScanner();
	Scanner sc2 = new Scanner(System.in);
	long start = System.currentTimeMillis();
	long fin = System.currentTimeMillis();
	final int MOD = 1000000007;
	int[] dx = { 1, 0, 0, -1 };
	int[] dy = { 0, 1, -1, 0 };

	void run() {
		int N = sc.nextInt();
		int[] A = sc.nextIntArray(N);
		boolean[] use = new boolean[51];
		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < N; i++) {
			int out = A[i];
			Pair[] p = new Pair[51];
			for (int j = 0; j <= 50; j++) p[j] = new Pair(0, j);
			for (int j = i + 1; j < N; j++) p[A[j]].cnt++;
			Arrays.sort(p);
			boolean fix = false;
			for (int j = 50; j >= 0; j--) {
				if (out != p[j].dislike && !use[p[j].dislike] && p[j].dislike <= N - 1) {
					use[p[j].dislike] = true;
					sb.append(p[j].dislike + "\n");
					fix = true;
					break;
				}
			}
			if (!fix) {
				System.out.println(-1);
				return;
			}
		}
		System.out.print(sb);
	}

	class Pair implements Comparable<Pair> {

		int cnt;
		int dislike;

		public Pair() {
			super();
			this.cnt = 0;
			this.dislike = 0;
		}

		public Pair(int cnt, int dislike) {
			super();
			this.cnt = cnt;
			this.dislike = dislike;
		}

		@Override
		public int compareTo(Pair arg0) {
			if (this.cnt == arg0.cnt) {
				return this.dislike - arg0.dislike;
			}
			return this.cnt - arg0.cnt;
		}

		void show() {
			System.out.println("first = " + this.cnt + " second = "
					+ this.dislike);
		}
	}

	public static void main(String[] args) {
		new Main_origin().run();
	}

	void debug(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	void debug2(int[][] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array[i].length; j++) {
				System.out.print(array[i][j]);
			}
			System.out.println();
		}
	}

	boolean inner(int h, int w, int limH, int limW) {
		return 0 <= h && h < limH && 0 <= w && w < limW;
	}

	void swap(int[] x, int a, int b) {
		int tmp = x[a];
		x[a] = x[b];
		x[b] = tmp;
	}

	// find minimum i (a[i] >= border)
	int lower_bound(int a[], int border) {
		int l = -1;
		int r = a.length;
		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (border <= a[mid]) {
				r = mid;
			} else {
				l = mid;
			}
		}
		// r = l + 1
		return r;
	}

	boolean palindrome(String s) {
		for (int i = 0; i < s.length() / 2; i++) {
			if (s.charAt(i) != s.charAt(s.length() - 1 - i)) {
				return false;
			}
		}
		return true;
	}

	class MyScanner {
		int nextInt() {
			try {
				int c = System.in.read();
				while (c != '-' && (c < '0' || '9' < c))
					c = System.in.read();
				if (c == '-')
					return -nextInt();
				int res = 0;
				do {
					res *= 10;
					res += c - '0';
					c = System.in.read();
				} while ('0' <= c && c <= '9');
				return res;
			} catch (Exception e) {
				return -1;
			}
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String next() {
			try {
				StringBuilder res = new StringBuilder("");
				int c = System.in.read();
				while (Character.isWhitespace(c))
					c = System.in.read();
				do {
					res.append((char) c);
				} while (!Character.isWhitespace(c = System.in.read()));
				return res.toString();
			} catch (Exception e) {
				return null;
			}
		}

		int[] nextIntArray(int n) {
			int[] in = new int[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextInt();
			}
			return in;
		}

		int[][] nextInt2dArray(int n, int m) {
			int[][] in = new int[n][m];
			for (int i = 0; i < n; i++) {
				in[i] = nextIntArray(m);
			}
			return in;
		}

		double[] nextDoubleArray(int n) {
			double[] in = new double[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextDouble();
			}
			return in;
		}

		long[] nextLongArray(int n) {
			long[] in = new long[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextLong();
			}
			return in;
		}

		char[][] nextCharField(int n, int m) {
			char[][] in = new char[n][m];
			for (int i = 0; i < n; i++) {
				String s = sc.next();
				for (int j = 0; j < m; j++) {
					in[i][j] = s.charAt(j);
				}
			}
			return in;
		}
	}
}
0