AtCoder Grand Contest 008

Submission #1044680

Source codeソースコード

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
	static final long C =  1000000007;
	static final int CY = 1000000000;
	static final int INF = Integer.MAX_VALUE/2;
	StringBuilder sb;
	//セット
	class Set<F,S> {
		F f;
		S s;
		Set(F f, S s) {this.f = f;this.s = s;}
	}
	char[][] c;
	int H;
	int W;
	public void calc() {
		sb = new StringBuilder();



		IO sc = new IO();
		int n = sc.nextInt();
		int[] x = sc.nextIntArray(n);

		boolean ans = true;

		int na[] = new int[n*n];
		int a[] = new int[n*n];
		for (int i=0; i < n;i++) {
			na[x[i]-1] = a[x[i]-1] = i+1;

		}
		int none = -1;
		LOOP:for (int i=0; i < n*n; i++) {
			if (a[i] == 0) {
				if (none == -1) {
					none = i;
				}
			}else {
				int xi =  a[i];
				for(int t=0; t < xi-1; t++) {
					if (none >= i) {
						ans = false;
						break LOOP;
					}
					if (none == -1) {
						ans = false;
						break LOOP;
					}else {
						if (a[none] != 0) {
							none++;
							t--;

							continue;
						}else {
							a[none] = xi;
							none++;
						}
					}
				}
			}
		}
		if (ans) {
			none = n*n;
			LOOP:for (int i=n*n-1; i >= 0; i--) {
				if (a[i] == 0) {
					if (none == n*n) {
						none = i;
					}
				}else if (na[i] != 0){
					int xi = a[i];
					for(int t=0; t < n- xi; t++) {
						if (none <= i) {
							ans = false;
							System.out.println(i +":" + none);
							break LOOP;

						}
						if (none == n*n) {
							ans = false;
							break LOOP;
						}else {
							if (a[none] != 0) {
								none--;
								t--;

								continue;
							}else {
								a[none] = xi;
								none--;
							}
						}
					}
				}
			}
		}


		System.out.println(ans?"Yes":"No");
		if (ans) {
			System.out.println(arrayToString(a));
		}

	}

	//配列の空白区切り文字化(最後にスペース無しの)
	StringBuilder arrayToString(int[] a) {
		StringBuilder s = new StringBuilder();

		for (int i=0; i < a.length; i++) {
			s.append( a[i]);
			if (i != a.length-1) {
				s.append(" ");
			}
		}
		return s ;
	}

	public static void main(String[] args) {
		Main main = new Main();
		main.calc();

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

Submission

Task問題 D - K-th K
User nameユーザ名 キーキ
Created time投稿日時
Language言語 Java8 (OpenJDK 1.8.0)
Status状態 WA
Score得点 0
Source lengthソースコード長 5964 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt
All 0 / 800 0_00.txt,0_01.txt,1_00.txt,1_01.txt,1_02.txt,1_03.txt,1_04.txt,1_05.txt,1_06.txt,1_07.txt,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt,1_20.txt,1_21.txt,1_22.txt,1_23.txt,1_24.txt,1_25.txt,1_26.txt,1_27.txt,1_28.txt,1_29.txt,1_30.txt,1_31.txt,1_32.txt,1_33.txt,1_34.txt,1_35.txt,1_36.txt,1_37.txt,1_38.txt,1_39.txt,1_40.txt,1_41.txt,1_42.txt,1_43.txt,1_44.txt,1_45.txt,1_46.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 94 ms 8148 KB
0_01.txt AC 93 ms 8148 KB
1_00.txt AC 95 ms 8016 KB
1_01.txt AC 188 ms 18596 KB
1_02.txt AC 185 ms 18736 KB
1_03.txt AC 198 ms 19568 KB
1_04.txt AC 204 ms 19720 KB
1_05.txt AC 185 ms 18744 KB
1_06.txt AC 186 ms 18716 KB
1_07.txt AC 187 ms 19508 KB
1_08.txt AC 185 ms 18816 KB
1_09.txt AC 97 ms 10196 KB
1_10.txt AC 107 ms 10960 KB
1_11.txt AC 99 ms 10324 KB
1_12.txt AC 99 ms 10320 KB
1_13.txt AC 108 ms 10960 KB
1_14.txt AC 99 ms 10320 KB
1_15.txt AC 178 ms 17872 KB
1_16.txt AC 111 ms 10756 KB
1_17.txt WA
1_18.txt AC 190 ms 18228 KB
1_19.txt AC 191 ms 19384 KB
1_20.txt AC 174 ms 17872 KB
1_21.txt AC 196 ms 19280 KB
1_22.txt AC 176 ms 18384 KB
1_23.txt WA
1_24.txt AC 180 ms 18264 KB
1_25.txt AC 177 ms 17744 KB
1_26.txt WA
1_27.txt WA
1_28.txt AC 100 ms 10192 KB
1_29.txt WA
1_30.txt AC 179 ms 18388 KB
1_31.txt AC 192 ms 19388 KB
1_32.txt AC 98 ms 9940 KB
1_33.txt AC 193 ms 19128 KB
1_34.txt AC 98 ms 10192 KB
1_35.txt WA
1_36.txt AC 209 ms 19376 KB
1_37.txt AC 184 ms 18972 KB
1_38.txt AC 193 ms 19580 KB
1_39.txt AC 97 ms 9932 KB
1_40.txt AC 152 ms 13832 KB
1_41.txt WA
1_42.txt AC 152 ms 14928 KB
1_43.txt AC 182 ms 18136 KB
1_44.txt AC 97 ms 9552 KB
1_45.txt AC 99 ms 10064 KB
1_46.txt AC 112 ms 10760 KB