結果
| 問題 | No.977 アリス仕掛けの摩天楼 |
| ユーザー |
 Oland
|
| 提出日時 | 2020-02-01 07:07:38 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,502 bytes |
| コンパイル時間 | 2,132 ms |
| コンパイル使用メモリ | 80,356 KB |
| 実行使用メモリ | 65,352 KB |
| 最終ジャッジ日時 | 2024-09-18 19:41:54 |
| 合計ジャッジ時間 | 6,601 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 47 ms
44,424 KB |
| testcase_01 | AC | 48 ms
44,140 KB |
| testcase_02 | AC | 48 ms
44,316 KB |
| testcase_03 | AC | 48 ms
44,216 KB |
| testcase_04 | AC | 46 ms
44,784 KB |
| testcase_05 | AC | 46 ms
44,304 KB |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 46 ms
44,400 KB |
| testcase_09 | AC | 47 ms
44,316 KB |
| testcase_10 | AC | 48 ms
44,100 KB |
| testcase_11 | AC | 47 ms
44,392 KB |
| testcase_12 | AC | 46 ms
44,244 KB |
| testcase_13 | AC | 102 ms
46,772 KB |
| testcase_14 | AC | 98 ms
46,144 KB |
| testcase_15 | AC | 107 ms
46,636 KB |
| testcase_16 | AC | 109 ms
46,780 KB |
| testcase_17 | AC | 108 ms
46,696 KB |
| testcase_18 | AC | 166 ms
51,104 KB |
| testcase_19 | AC | 172 ms
51,048 KB |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | AC | 304 ms
58,988 KB |
| testcase_24 | AC | 353 ms
65,352 KB |
| testcase_25 | AC | 375 ms
60,648 KB |
ソースコード
import java.util.*;
import java.io.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
int MOD = (int)1e9+7;
long ceil(long a, long b){return (a + b - 1) / b;}
long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
long lcm(long a, long b){return a / gcd(a, b) * b;}
void solve(){
int N = in.nextInt();
int[] num = new int[N];
ArrayList<ArrayList<Integer>> g = new ArrayList<>();
for(int i = 0; i < N; i++) g.add(new ArrayList<>());
for(int i = 0; i < N - 1; i++){
int a = in.nextInt(), b = in.nextInt();
g.get(a).add(b);
g.get(b).add(a);
num[a]++;
num[b]++;
}
int lessTwo = 0;
for(int i = 0; i < N; i++) if(num[i] < 2) lessTwo++;
out.println(!isConnected(g) && lessTwo >= 2 ? "Alice" : "Bob");
}
boolean isConnected(ArrayList<ArrayList<Integer>> g){
boolean[] visited = new boolean[g.size()];
ArrayDeque<Integer> queue = new ArrayDeque<Integer>();
queue.addLast(0);
visited[0] = true;
while(!queue.isEmpty()){
int v = queue.removeFirst();
for(int next : g.get(v)){
if(!visited[next]){
visited[next] = true;
queue.addLast(next);
}
}
}
for(boolean v : visited) if(!v) return false;
return true;
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}