Submission #3232029
Source Code Expand
import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashSet; import java.util.InputMismatchException; public class Main { InputStream is; int __t__ = 1; int __f__ = 0; int __FILE_DEBUG_FLAG__ = __f__; String __DEBUG_FILE_NAME__ = "src/B3"; FastScanner in; PrintWriter out; int MOD = 1000000007; public void solve() { int n = in.nextInt(); int[] a = in.nextIntArray(n); int[] b = in.nextIntArray(n); Arrays.sort(a); Arrays.sort(b); int aptr = 0, bptr = 0; long res = 1; while (aptr < n && bptr < n) { if (a[aptr] < b[bptr]) { if (aptr < bptr) { res = (res * (bptr - aptr)) % MOD; } aptr++; } else { if (bptr < aptr) { res = (res * (aptr - bptr)) % MOD; } bptr++; } } while (aptr < n) { res = (res * (n - aptr)) % MOD; aptr++; } while (bptr < n) { res = (res * (n - bptr)) % MOD; bptr++; } System.out.println(res); } public void run() { if (__FILE_DEBUG_FLAG__ == __t__) { try { is = new FileInputStream(__DEBUG_FILE_NAME__); } catch (FileNotFoundException e) { // TODO 自動生成された catch ブロック e.printStackTrace(); } System.out.println("FILE_INPUT!"); } else { is = System.in; } in = new FastScanner(is); out = new PrintWriter(System.out); solve(); } public static void main(final String[] args) { new Main().run(); } class FastScanner { private InputStream stream; private byte[] buf = new byte[1024]; private int curChar; private int numChars; public FastScanner(InputStream stream) { this.stream = stream; // stream = new FileInputStream(new File("dec.in")); } int read() { if (numChars == -1) throw new InputMismatchException(); if (curChar >= numChars) { curChar = 0; try { numChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (numChars <= 0) return -1; } return buf[curChar++]; } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } int[][] nextIntMap(int n, int m) { int[][] map = new int[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextIntArray(m); } return map; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } long[][] nextLongMap(int n, int m) { long[][] map = new long[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextLongArray(m); } return map; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } double[][] nextDoubleMap(int n, int m) { double[][] map = new double[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextDoubleArray(m); } return map; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | hiro116s |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 5581 Byte |
Status | AC |
Exec Time | 279 ms |
Memory | 43948 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 187 ms | 36980 KB |
001.txt | AC | 139 ms | 31184 KB |
002.txt | AC | 153 ms | 30788 KB |
003.txt | AC | 194 ms | 32240 KB |
004.txt | AC | 222 ms | 39768 KB |
005.txt | AC | 262 ms | 41620 KB |
006.txt | AC | 216 ms | 43348 KB |
007.txt | AC | 236 ms | 41176 KB |
008.txt | AC | 279 ms | 43736 KB |
009.txt | AC | 230 ms | 43948 KB |
010.txt | AC | 207 ms | 43576 KB |
011.txt | AC | 230 ms | 43532 KB |
example0.txt | AC | 67 ms | 19028 KB |
example1.txt | AC | 68 ms | 20436 KB |