QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#300674 | #4896. Alice、Bob 与 DFS | zyc070419 | 20 | 28ms | 16696kb | C++14 | 3.8kb | 2024-01-08 16:27:12 | 2024-01-08 16:27:12 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
inline int read() {
char ch = getchar(); int x = 0;
while (!isdigit(ch)) {ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
return x;
}
int n, c[N];
vector<int> g[N], vec;
namespace subtask1 {
bool dp[N], ans;
bool check() {
for (int i = 1; i <= n; ++i)
if (c[i] == 1) return false;
return true;
}
void solve() {
for (int x = n; x >= 1; --x) {
dp[x] = 1;
for (auto y : g[x]) dp[x] ^= dp[y];
}
for (auto r : vec) ans ^= dp[r];
puts(ans ? "Alice" : "Bob");
}
}
namespace subtask2 {
int dp[N];
bool check() {return vec.size() == 1;}
void solve() {
for (int x = n; x >= 1; --x) {
if (g[x].empty()) dp[x] = 1;
else {
int val = 1;
for (auto y : g[x]) {
if (val == 0) {
if (dp[y] == 0) val = 0;
else if (dp[y] == 1) val = 1;
else {
val = dp[y];
break;
}
}else {
if (dp[y] == 0) val = 1;
else if (dp[y] == 1) val = 0;
else {
val = dp[y] ^ 1;
break;
}
}
}
if (c[x] == 0) dp[x] = val;
else {
if (val == 3) dp[x] = 1;
else if (val == 0) dp[x] = 2;
else dp[x] = val;
}
}
}
puts((dp[vec[0]] == 1 || dp[vec[0]] == 2) ? "Alice" : "Bob");
}
}
namespace subtask3 {
int cnt, val[N], sg[2000];
vector<int> now, to[2000], tmp;
vector< vector<int> > tot;
bool check() {
int m = 0;
for (int x = 1; x <= n; ++x) m += g[x].size();
return (n <= 10 && m <= 10);
}
void dfs(int x) {
now.push_back(x);
tot.push_back(now);
for (auto y : g[x]) dfs(y);
now.pop_back();
}
void solve() {
for (int x = 1; x <= n; ++x) {
tot.clear(); dfs(x); tot.push_back(now);
for (int i = 0; i < tot.size(); ++i) to[i].clear();
for (int i = 0; i + 1 < tot.size(); ++i) to[i].push_back(i + 1);
for (int i = 0; i < tot.size(); ++i) {
if (tot[i].empty() || c[tot[i].back()] == 0) continue;
for (int j = i + 1; j < tot.size(); ++j)
if (tot[j].size() < tot[i].size() || tot[j][tot[i].size() - 1] != tot[i].back()) {to[i].push_back(j); break;}
}
for (int i = tot.size() - 1; i >= 0; --i) {
tmp.clear();
for (auto j : to[i]) tmp.push_back(sg[j]);
sort(tmp.begin(), tmp.end());
int ans = 0;
while (ans < tmp.size() && ans == tmp[ans]) ans++;
sg[i] = ans;
}
val[x] = sg[0];
}
int fin = 0;
for (auto x : vec) fin ^= val[x];
puts(fin ? "Alice" : "Bob");
}
}
int main() {
n = read();
for (int i = 1; i <= n; ++i) c[i] = read();
for (int x = 1, m, y; x <= n; ++x) {
m = read();
while (m--) {
y = read();
g[x].push_back(y);
}
}
int k = read(), x;
while (k--) x = read(), vec.push_back(x);
if (subtask1 :: check()) subtask1 :: solve();
else if (subtask2 :: check()) subtask2 :: solve();
else if (subtask3 :: check()) subtask3 :: solve();
}
詳細信息
Subtask #1:
score: 5
Accepted
Test #1:
score: 5
Accepted
time: 2ms
memory: 9732kb
input:
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Alice
result:
ok "Alice"
Test #2:
score: 0
Accepted
time: 2ms
memory: 9736kb
input:
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #3:
score: 0
Accepted
time: 2ms
memory: 8616kb
input:
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Alice
result:
ok "Alice"
Test #4:
score: 0
Accepted
time: 0ms
memory: 9912kb
input:
10 0 0 0 0 0 0 0 0 0 0 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 0 1 1
output:
Bob
result:
ok "Bob"
Test #5:
score: 0
Accepted
time: 2ms
memory: 8332kb
input:
11 0 0 0 0 0 0 0 0 0 0 0 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 0 0 2 1 11
output:
Alice
result:
ok "Alice"
Test #6:
score: 0
Accepted
time: 7ms
memory: 15880kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #7:
score: 0
Accepted
time: 11ms
memory: 15832kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #8:
score: 0
Accepted
time: 12ms
memory: 15752kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Alice
result:
ok "Alice"
Test #9:
score: 0
Accepted
time: 24ms
memory: 15212kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #10:
score: 0
Accepted
time: 28ms
memory: 15440kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #11:
score: 0
Accepted
time: 15ms
memory: 13352kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #12:
score: 0
Accepted
time: 15ms
memory: 14532kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #13:
score: 0
Accepted
time: 11ms
memory: 13404kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Alice
result:
ok "Alice"
Test #14:
score: 0
Accepted
time: 18ms
memory: 13004kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #15:
score: 0
Accepted
time: 0ms
memory: 8204kb
input:
1 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #16:
score: 0
Accepted
time: 2ms
memory: 9952kb
input:
3 0 0 0 1 2 1 3 0 1 1
output:
Alice
result:
ok "Alice"
Test #17:
score: 0
Accepted
time: 0ms
memory: 8300kb
input:
4 0 0 0 0 1 2 1 3 0 0 2 1 4
output:
Bob
result:
ok "Bob"
Subtask #2:
score: 15
Accepted
Test #18:
score: 15
Accepted
time: 2ms
memory: 9872kb
input:
7 0 0 1 1 0 1 1 1 2 2 3 4 0 2 5 6 0 1 7 0 1 1
output:
Bob
result:
ok "Bob"
Test #19:
score: 0
Accepted
time: 1ms
memory: 9664kb
input:
6 0 1 0 0 1 0 2 2 6 3 3 4 5 0 0 0 0 1 1
output:
Bob
result:
ok "Bob"
Test #20:
score: 0
Accepted
time: 1ms
memory: 9664kb
input:
3 0 1 0 1 2 1 3 0 1 1
output:
Bob
result:
ok "Bob"
Test #21:
score: 0
Accepted
time: 1ms
memory: 9676kb
input:
10 1 1 1 1 1 1 1 1 1 1 1 2 4 3 5 7 8 1 4 0 1 6 0 0 1 9 1 10 0 1 1
output:
Alice
result:
ok "Alice"
Test #22:
score: 0
Accepted
time: 0ms
memory: 9732kb
input:
10 1 0 0 1 1 1 0 0 1 0 2 2 3 0 1 4 1 5 1 6 3 7 9 10 1 8 0 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #23:
score: 0
Accepted
time: 1ms
memory: 8448kb
input:
10 1 1 1 1 1 1 1 1 1 1 4 2 3 4 10 0 0 1 5 1 6 2 7 8 0 1 9 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #24:
score: 0
Accepted
time: 0ms
memory: 9948kb
input:
52 0 0 1 0 1 0 1 0 0 0 1 1 1 1 1 0 0 1 0 1 1 0 0 1 0 1 0 0 1 0 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 0 0 0 0 0 1 0 1 2 2 3 4 0 3 5 6 8 0 1 7 0 2 9 48 2 10 11 0 1 12 2 13 14 0 1 15 1 16 3 17 42 47 4 18 22 33 41 1 19 2 20 21 0 0 3 23 24 26 0 1 25 0 1 27 2 28 31 1 29 1 30 0 1 32 0 1 34 3 35 37 38 1 36 0 0 1 39...
output:
Bob
result:
ok "Bob"
Test #25:
score: 0
Accepted
time: 1ms
memory: 8860kb
input:
98 0 1 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 1 0 1 1 0 0 1 0 0 1 0 1 1 1 1 0 1 1 1 0 0 1 1 1 0 0 0 0 1 1 1 0 0 0 1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 0 0 0 1 1 0 1 2 1 3 1 4 4 5 6 11 12 0 1 7 2 8 9 0 1 10 0 0 1 13 1 14 2 15 54 11 16 17 18 41 42 45 46 47 50 52 53 ...
output:
Bob
result:
ok "Bob"
Test #26:
score: 0
Accepted
time: 0ms
memory: 8256kb
input:
100 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 6 2 3 4 6 99 100 0 0 1 5 0 1 7 1 8 1 9 2 10 13 2 11 12 0 0 3 14 97 98 1 15 1 16 1 17 1 18 2 19 2...
output:
Bob
result:
ok "Bob"
Test #27:
score: 0
Accepted
time: 1ms
memory: 9660kb
input:
8 0 0 0 1 1 0 1 1 1 2 1 3 1 4 3 5 6 7 0 0 1 8 0 1 1
output:
Bob
result:
ok "Bob"
Test #28:
score: 0
Accepted
time: 1ms
memory: 8224kb
input:
100 0 0 0 1 1 0 1 0 0 1 0 1 0 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 1 0 0 0 0 1 0 0 0 0 1 1 0 1 0 1 1 0 0 1 0 0 1 0 0 1 1 1 0 0 1 1 1 0 1 1 0 0 1 1 1 0 1 0 1 0 0 1 1 0 1 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 1 1 1 9 2 3 80 88 89 95 96 97 99 0 1 4 3 5 78 79 3 6 7 8 0 0 5 9 10 11 75 76 0 0 2 12 71 1 13 1 14 3 1...
output:
Bob
result:
ok "Bob"
Test #29:
score: 0
Accepted
time: 0ms
memory: 9632kb
input:
100 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 0 0 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 0 1 0 1 1 1 1 1 1 1 0 0 1 1 17 2 3 4 9 10 12 13 14 15 16 19 64 66 70 71 99 100 0 0 1 5 2 6 7 0 1 8 0 0 1 11 0 0 0 0 0 1 17 1...
output:
Alice
result:
ok "Alice"
Test #30:
score: 0
Accepted
time: 1ms
memory: 9668kb
input:
1000 1 0 0 1 1 0 1 0 1 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 0 0 1 1 0 0 1 0 1 0 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 1 0 0 0 0 0 0 1 1 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 1 0 1 0 1 0 0 1 1 0 0 0 0 0 1 0 1 0 0 0 1 1 0 0 1 1 0 1 0 0 0 1 1 0 1 1 1 1 0 0...
output:
Alice
result:
ok "Alice"
Test #31:
score: 0
Accepted
time: 0ms
memory: 8188kb
input:
777 0 1 0 0 0 1 1 0 0 1 1 0 1 1 0 0 1 0 1 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 0 0 1 0 1 1 1 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 0 0 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 1 ...
output:
Bob
result:
ok "Bob"
Test #32:
score: 0
Accepted
time: 2ms
memory: 9632kb
input:
960 0 1 0 1 0 1 0 0 1 0 1 1 1 0 0 0 1 0 1 1 1 0 0 0 1 0 1 1 1 0 1 1 1 1 0 1 0 1 1 1 1 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 1 1 0 0 0 1 0 0 1 0 1 0 1 0 1 1 1 1 1 1 0 1 1 1 0 1 0 1 0 1 0 0 0 1 1 0 0 1 1 1 0 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 0 0 1 1 1 1 1 0 1 1 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 0 0 0 1 0 0 ...
output:
Bob
result:
ok "Bob"
Test #33:
score: 0
Accepted
time: 0ms
memory: 12352kb
input:
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
Alice
result:
ok "Alice"
Test #34:
score: 0
Accepted
time: 2ms
memory: 8732kb
input:
10 0 0 0 0 0 0 0 0 0 0 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 0 1 1
output:
Bob
result:
ok "Bob"
Test #35:
score: 0
Accepted
time: 0ms
memory: 8528kb
input:
10 1 1 1 1 1 1 1 1 1 1 9 2 3 4 5 6 7 8 9 10 0 0 0 0 0 0 0 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #36:
score: 0
Accepted
time: 8ms
memory: 11172kb
input:
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
Alice
result:
ok "Alice"
Test #37:
score: 0
Accepted
time: 0ms
memory: 8244kb
input:
10 0 1 0 0 1 1 1 1 0 0 3 2 8 9 1 3 2 4 6 1 5 0 1 7 0 0 1 10 0 1 1
output:
Bob
result:
ok "Bob"
Test #38:
score: 0
Accepted
time: 2ms
memory: 8456kb
input:
2 0 1 1 2 0 1 1
output:
Bob
result:
ok "Bob"
Test #39:
score: 0
Accepted
time: 11ms
memory: 16696kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #40:
score: 0
Accepted
time: 9ms
memory: 11312kb
input:
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
Alice
result:
ok "Alice"
Test #41:
score: 0
Accepted
time: 25ms
memory: 15508kb
input:
200000 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 1 1...
output:
Alice
result:
ok "Alice"
Test #42:
score: 0
Accepted
time: 21ms
memory: 14960kb
input:
199285 0 1 0 1 1 0 0 0 0 1 0 1 0 0 1 1 1 0 0 0 1 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 0 1 0 1 1 0 1 1 1 1 0 0 1 0 0 1 1 1 0 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 1 1 0 0 1 1 1 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 1 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #43:
score: 0
Accepted
time: 21ms
memory: 15080kb
input:
200000 1 0 1 1 1 1 1 1 1 1 1 1 0 0 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 1 1 0 0 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 0 1 0 1 1 1 1 0 0 1 1 0 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0 1 1 1 0 0 1 1 0 1 1 0 1 0 0 1 1 1 1 1 1 0 1 0 0 0 1 0 0 1 0 1 0 1 0 1 1 1 1 0 0 0 1 1 0 1 1 0 1 1 0...
output:
Alice
result:
ok "Alice"
Test #44:
score: 0
Accepted
time: 16ms
memory: 13644kb
input:
200000 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 1 1 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 1 0 1 1 1 1 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1 0 1 0 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 0 0 1 0 1 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 0 1 0...
output:
Alice
result:
ok "Alice"
Test #45:
score: 0
Accepted
time: 20ms
memory: 13652kb
input:
200000 1 0 1 1 1 0 0 0 1 0 1 0 1 1 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 0 1 0 1 0 0 1 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 1 0 1 1 1 1 0 1 1 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 0 1 0 0 1 0 0 0 1 1...
output:
Alice
result:
ok "Alice"
Test #46:
score: 0
Accepted
time: 15ms
memory: 14404kb
input:
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
Bob
result:
ok "Bob"
Test #47:
score: 0
Accepted
time: 2ms
memory: 8544kb
input:
3 0 1 0 2 2 3 1 3 0 1 1
output:
Bob
result:
ok "Bob"
Test #48:
score: 0
Accepted
time: 2ms
memory: 8476kb
input:
2 1 0 2 2 2 0 1 1
output:
Alice
result:
ok "Alice"
Test #49:
score: 0
Accepted
time: 0ms
memory: 9696kb
input:
3 1 1 1 1 2 1 3 0 1 1
output:
Alice
result:
ok "Alice"
Test #50:
score: 0
Accepted
time: 2ms
memory: 9612kb
input:
15 1 1 1 1 0 0 1 0 1 1 1 0 0 1 0 2 2 9 2 3 6 2 4 5 0 0 2 7 8 0 0 2 10 13 2 11 12 0 0 2 14 15 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #51:
score: 0
Accepted
time: 0ms
memory: 9672kb
input:
27 1 1 1 1 0 0 0 1 1 1 0 1 1 1 1 0 0 1 0 1 1 1 0 0 1 0 0 2 2 8 2 3 6 2 4 5 0 0 2 12 7 0 2 9 11 2 10 12 0 2 12 27 2 13 20 2 14 17 2 15 16 0 0 2 18 19 0 0 2 21 24 2 22 23 0 0 2 25 26 0 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #52:
score: 0
Accepted
time: 2ms
memory: 8416kb
input:
1 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #53:
score: 0
Accepted
time: 1ms
memory: 8784kb
input:
1 1 0 1 1
output:
Alice
result:
ok "Alice"
Test #54:
score: 0
Accepted
time: 2ms
memory: 8468kb
input:
3 0 0 0 1 2 1 3 0 1 1
output:
Alice
result:
ok "Alice"
Subtask #3:
score: 0
Wrong Answer
Test #55:
score: 15
Accepted
time: 0ms
memory: 8304kb
input:
7 0 0 1 1 0 1 1 1 2 2 3 4 0 2 5 6 0 1 7 0 1 1
output:
Bob
result:
ok "Bob"
Test #56:
score: 0
Accepted
time: 1ms
memory: 9616kb
input:
6 0 1 0 0 1 0 2 2 6 3 3 4 5 0 0 0 0 1 1
output:
Bob
result:
ok "Bob"
Test #57:
score: 0
Accepted
time: 0ms
memory: 8792kb
input:
3 0 1 0 1 2 1 3 0 1 1
output:
Bob
result:
ok "Bob"
Test #58:
score: 0
Accepted
time: 2ms
memory: 9496kb
input:
10 1 1 1 1 1 1 1 1 1 1 1 2 4 3 5 7 8 1 4 0 1 6 0 0 1 9 1 10 0 1 1
output:
Alice
result:
ok "Alice"
Test #59:
score: 0
Accepted
time: 2ms
memory: 9688kb
input:
10 1 0 0 1 1 1 0 0 1 0 2 2 3 0 1 4 1 5 1 6 3 7 9 10 1 8 0 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #60:
score: 0
Accepted
time: 0ms
memory: 9672kb
input:
10 1 1 1 1 1 1 1 1 1 1 4 2 3 4 10 0 0 1 5 1 6 2 7 8 0 1 9 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #61:
score: -15
Wrong Answer
time: 2ms
memory: 9624kb
input:
10 1 1 1 1 1 1 1 1 1 1 2 2 7 1 3 2 4 6 1 5 0 0 0 1 9 0 0 10 8 10 10 8 10 8 10 10 1 8
output:
Bob
result:
wrong answer 1st words differ - expected: 'Alice', found: 'Bob'
Subtask #4:
score: 0
Wrong Answer
Test #103:
score: 20
Accepted
time: 0ms
memory: 9672kb
input:
10 1 1 1 1 1 1 1 1 1 1 1 2 4 3 5 7 8 1 4 0 1 6 0 0 1 9 1 10 0 1 1
output:
Alice
result:
ok "Alice"
Test #104:
score: 0
Accepted
time: 0ms
memory: 9600kb
input:
10 1 1 1 1 1 1 1 1 1 1 4 2 3 4 10 0 0 1 5 1 6 2 7 8 0 1 9 0 0 1 1
output:
Alice
result:
ok "Alice"
Test #105:
score: -20
Wrong Answer
time: 2ms
memory: 8632kb
input:
10 1 1 1 1 1 1 1 1 1 1 2 2 7 1 3 2 4 6 1 5 0 0 0 1 9 0 0 10 8 10 10 8 10 8 10 10 1 8
output:
Bob
result:
wrong answer 1st words differ - expected: 'Alice', found: 'Bob'
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
0%