Submission #1191478
Source Code Expand
import java.io.*; import java.util.*; public class Main { private static Scanner sc; private static Printer pr; private static void solve() { final int MOD = 1_000_000_007; int n = sc.nextInt(); int[] x = new int[n]; for (int i = 0; i < n; i++) { x[i] = sc.nextInt(); } Arrays.sort(x); int cnt = 0; long ret = 1; for (int i = 0; i < n; i++) { if (x[i] < cnt * 2 + 1) { ret *= cnt + 1; ret %= MOD; } else { cnt++; } } for (int i = 2; i <= cnt; i++) { ret *= i; ret %= MOD; } pr.println(ret); } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | garnacha |
Language | Java8 (OpenJDK 1.8.0) |
Score | 900 |
Code Size | 4484 Byte |
Status | AC |
Exec Time | 141 ms |
Memory | 24396 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 400 / 400 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
Subtask | 0_00.txt, 0_01.txt, 0_02.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 |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 69 ms | 19412 KB |
0_01.txt | AC | 70 ms | 19540 KB |
0_02.txt | AC | 70 ms | 19156 KB |
0_03.txt | AC | 69 ms | 21460 KB |
1_00.txt | AC | 72 ms | 19156 KB |
1_01.txt | AC | 70 ms | 20948 KB |
1_02.txt | AC | 70 ms | 18004 KB |
1_03.txt | AC | 71 ms | 19156 KB |
1_04.txt | AC | 70 ms | 15956 KB |
1_05.txt | AC | 71 ms | 21204 KB |
1_06.txt | AC | 70 ms | 19284 KB |
1_07.txt | AC | 71 ms | 21204 KB |
1_08.txt | AC | 71 ms | 21588 KB |
1_09.txt | AC | 70 ms | 19668 KB |
1_10.txt | AC | 68 ms | 21332 KB |
2_00.txt | AC | 127 ms | 22100 KB |
2_01.txt | AC | 136 ms | 22292 KB |
2_02.txt | AC | 141 ms | 20816 KB |
2_03.txt | AC | 133 ms | 21588 KB |
2_04.txt | AC | 133 ms | 23764 KB |
2_05.txt | AC | 131 ms | 24020 KB |
2_06.txt | AC | 136 ms | 24148 KB |
2_07.txt | AC | 131 ms | 21972 KB |
2_08.txt | AC | 130 ms | 23716 KB |
2_09.txt | AC | 122 ms | 24224 KB |
2_10.txt | AC | 134 ms | 21588 KB |
2_11.txt | AC | 141 ms | 24396 KB |
2_12.txt | AC | 141 ms | 18516 KB |