Contest Duration: - (local time) (100 minutes) Back to Home

Submission #7740461

Source Code Expand

Copy
```import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.util.Comparator;
import java.io.InputStream;

/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
MyInput in = new MyInput(inputStream);
PrintWriter out = new PrintWriter(outputStream);
CGoToSchool solver = new CGoToSchool();
solver.solve(1, in, out);
out.close();
}

static class CGoToSchool {
public void solve(int testNumber, MyInput in, PrintWriter out) {
int n = in.nextInt();
int[] ans = new int[n];
int[][] p = in.nextIntArray2DWithIndex(n, 1);
Arrays.sort(p, Comparator.comparingInt(x -> x[0]));

for (int i = 0; i < n; i++) {
ans[i] = p[i][1] + 1;
}
printList(out, ans);
}

static void printList(PrintWriter out, int[] p) {
for (int i = 0; i < p.length; i++) {
out.print(p[i] + (i == p.length - 1 ? "\n" : " "));
}
}

}

static class MyInput {
private static int pos;
private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500 * 8 * 2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];

static {
for (int i = 0; i < 10; i++) {
isDigit['0' + i] = true;
}
isDigit['-'] = true;
isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
isLineSep['\r'] = isLineSep['\n'] = true;
}

public MyInput(InputStream is) {
}

pos = 0;
try {
} catch (IOException e) {
throw new RuntimeException();
}
throw new MyInput.EndOfFileRuntimeException();
}
}
return buffer[pos++];
}

public int nextInt() {
int len = 0;
str[len++] = nextChar();
int i = 0;
int ret = 0;
if (str[0] == '-') {
i = 1;
}
for (; i < len; i++) ret = ret * 10 + str[i] - '0';
if (str[0] == '-') {
ret = -ret;
}
return ret;
}

public char nextChar() {
while (true) {
if (!isSpace[c]) {
return (char) c;
}
}
}

int reads(int len, boolean[] accept) {
try {
while (true) {
if (accept[c]) {
break;
}
if (str.length == len) {
char[] rep = new char[str.length * 3 / 2];
System.arraycopy(str, 0, rep, 0, str.length);
str = rep;
}
str[len++] = (char) c;
}
} catch (MyInput.EndOfFileRuntimeException e) {
}
return len;
}

public int[][] nextIntArray2DWithIndex(final int n, final int k) {
final int[][] res = new int[n][k + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
res[i][j] = nextInt();
}
res[i][k] = i;
}
return res;
}

static class EndOfFileRuntimeException extends RuntimeException {
}

}
}

```

#### Submission Info

Submission Time 2019-09-28 21:06:05+0900 C - Go to School tanzaku Java8 (OpenJDK 1.8.0) 300 4570 Byte AC 349 ms 44584 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
 AC × 3
 AC × 16
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-small-01.txt, 01-small-02.txt, 01-small-03.txt, 01-small-04.txt, 01-small-05.txt, 02-large-01.txt, 02-large-02.txt, 02-large-03.txt, 02-large-04.txt, 02-large-05.txt, 03-max-01.txt, 03-max-02.txt, 10-handmade-01.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 193 ms 25808 KB
00-sample-02.txt AC 155 ms 23508 KB
00-sample-03.txt AC 161 ms 23636 KB
01-small-01.txt AC 154 ms 23892 KB
01-small-02.txt AC 147 ms 24532 KB
01-small-03.txt AC 163 ms 26452 KB
01-small-04.txt AC 153 ms 24404 KB
01-small-05.txt AC 153 ms 25940 KB
02-large-01.txt AC 344 ms 39112 KB
02-large-02.txt AC 340 ms 40328 KB
02-large-03.txt AC 282 ms 34036 KB
02-large-04.txt AC 339 ms 37192 KB
02-large-05.txt AC 311 ms 36132 KB
03-max-01.txt AC 349 ms 44584 KB
03-max-02.txt AC 349 ms 42396 KB
10-handmade-01.txt AC 164 ms 27092 KB