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

Submission #1470992

Source Code Expand

Copy
```import java.io.*;
import java.util.*;

public class Main {

private static Scanner sc;
private static Printer pr;

private static void solve() {
int n = sc.nextInt();
int m = sc.nextInt();

List<List<Integer>> edges = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
edges.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
edges.get(a).add(b);
edges.get(b).add(a);
}

for (int e : edges.get(0)) {
if (edges.get(e).contains(n - 1)) {
pr.println("POSSIBLE");
return;
}
}

pr.println("IMPOSSIBLE");
}

// ---------------------------------------------------
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 2017-07-30 09:14:18+0900 C - Cat Snuke and a Voyage garnacha Java8 (OpenJDK 1.8.0) 300 4528 Byte AC 297 ms 58976 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example0, example1, example2, example3
All 300 / 300 example0, example1, example2, example3, last0, last1, many0, many1, rand0, rand1, rand2
Case Name Status Exec Time Memory
example0 71 ms 19540 KB
example1 69 ms 19412 KB
example2 95 ms 21204 KB
example3 69 ms 21460 KB
last0 288 ms 58376 KB
last1 297 ms 57048 KB
many0 291 ms 51020 KB
many1 274 ms 54324 KB
rand0 245 ms 58976 KB
rand1 282 ms 56548 KB
rand2 242 ms 54704 KB