Submission #1350361
Source Code Expand
//Do what you can't. import java.io.*; import java.util.*; import java.math.BigInteger; public class Main { public static void main(String[] args) { InputReader in = new InputReader(System.in); PrintWriter w = new PrintWriter(System.out); int n = in.nextInt(); int[] p = in.nextIntArray(n); int[] a = new int[n], b = new int[n]; for (int i = 0; i < n; i++) { a[i] = i * n; b[n - 1 - i] = i * n; } for (int i = 0; i < n; i++) a[p[i] - 1] += i; for (int x : a) w.print(x + " "); w.println(); for (int x : b) w.print(x + " "); w.close(); } static class InputReader { private final InputStream stream; private final byte[] buf = new byte[8192]; private int curChar, snumChars; private SpaceCharFilter filter; public InputReader(InputStream stream) { this.stream = stream; } public int snext() { if (snumChars == -1) throw new InputMismatchException(); if (curChar >= snumChars) { curChar = 0; try { snumChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (snumChars <= 0) return -1; } return buf[curChar++]; } public int nextInt() { int c = snext(); while (isSpaceChar(c)) { c = snext(); } int sgn = 1; if (c == '-') { sgn = -1; c = snext(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res *= 10; res += c - '0'; c = snext(); } while (!isSpaceChar(c)); return res * sgn; } public long nextLong() { int c = snext(); while (isSpaceChar(c)) { c = snext(); } int sgn = 1; if (c == '-') { sgn = -1; c = snext(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res *= 10; res += c - '0'; c = snext(); } while (!isSpaceChar(c)); return res * sgn; } public int[] nextIntArray(int n) { int a[] = new int[n]; for (int i = 0; i < n; i++) { a[i] = nextInt(); } return a; } public String readString() { int c = snext(); while (isSpaceChar(c)) { c = snext(); } StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = snext(); } while (!isSpaceChar(c)); return res.toString(); } public String nextLine() { int c = snext(); while (isSpaceChar(c)) c = snext(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = snext(); } while (!isEndOfLine(c)); return res.toString(); } public boolean isSpaceChar(int c) { if (filter != null) return filter.isSpaceChar(c); return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } private boolean isEndOfLine(int c) { return c == '\n' || c == '\r' || c == -1; } public interface SpaceCharFilter { public boolean isSpaceChar(int ch); } } }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | ashubeckham |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 3403 Byte |
Status | WA |
Exec Time | 138 ms |
Memory | 31696 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.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, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | WA | 94 ms | 21328 KB |
001.txt | WA | 90 ms | 18900 KB |
002.txt | WA | 77 ms | 21460 KB |
003.txt | WA | 76 ms | 21204 KB |
004.txt | WA | 80 ms | 23252 KB |
005.txt | WA | 113 ms | 29268 KB |
006.txt | WA | 96 ms | 20692 KB |
007.txt | WA | 132 ms | 25040 KB |
008.txt | WA | 114 ms | 23124 KB |
009.txt | WA | 134 ms | 29492 KB |
010.txt | WA | 130 ms | 29384 KB |
011.txt | WA | 138 ms | 30548 KB |
012.txt | WA | 114 ms | 26196 KB |
013.txt | WA | 137 ms | 31696 KB |
014.txt | WA | 118 ms | 29268 KB |
015.txt | WA | 114 ms | 29268 KB |
016.txt | WA | 135 ms | 28628 KB |
017.txt | WA | 138 ms | 27348 KB |
018.txt | WA | 138 ms | 28628 KB |
example0.txt | WA | 78 ms | 21204 KB |
example1.txt | WA | 72 ms | 20948 KB |
example2.txt | WA | 74 ms | 21204 KB |