QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#779197 | #7986. 游戏 | ygl | WA | 20ms | 8772kb | C++20 | 913b | 2024-11-24 17:54:20 | 2024-11-24 17:54:21 |
Judging History
answer
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using i64 = long long;
typedef pair<i64, i64> PII;
constexpr int inf = 0x3f3f3f3f, V = 2000001;
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> e(n);
for (int i = 0; i < n - 1; i ++ ){
int u, v;
cin >> u >> v;
u --, v --;
e[u].push_back(v);
e[v].push_back(u);
}
auto dfs = [&](auto self, int u, int fa) -> bool{
bool ok = true;
int cnt = 0;
for (auto v: e[u]){
if (v == fa) continue;
cnt += self(self, v, u);
ok = false;
}
if (ok) return true;
return cnt > 1;
};
cout << (dfs(dfs, 0, -1) && n > 2 ? "You win, temporarily." : "Wasted.") << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3532kb
input:
6 1 2 2 3 2 4 1 5 5 6
output:
Wasted.
result:
ok single line: 'Wasted.'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
7 1 2 2 3 2 4 1 5 5 6 5 7
output:
You win, temporarily.
result:
ok single line: 'You win, temporarily.'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
1
output:
Wasted.
result:
ok single line: 'Wasted.'
Test #4:
score: 0
Accepted
time: 19ms
memory: 8636kb
input:
100000 86389 1 68115 86389 27661 68115 9669 27661 7343 9669 59420 7343 98078 59420 39321 98078 14847 39321 76863 14847 21104 14847 24241 39321 82708 39321 73282 82708 7424 39321 64358 7424 81481 39321 17105 81481 74205 17105 81202 98078 63636 81202 62429 63636 85827 62429 8648 62429 67963 63636 7287...
output:
You win, temporarily.
result:
ok single line: 'You win, temporarily.'
Test #5:
score: 0
Accepted
time: 16ms
memory: 8592kb
input:
100000 28424 1 91124 28424 70268 91124 99456 70268 80696 99456 72802 80696 69700 72802 77527 72802 3835 80696 83715 3835 6690 3835 63240 3835 87789 80696 29903 99456 21234 29903 92544 21234 87569 21234 67361 29903 18146 67361 22916 67361 7024 99456 62805 7024 24624 7024 37895 7024 29126 99456 13746 ...
output:
Wasted.
result:
ok single line: 'Wasted.'
Test #6:
score: 0
Accepted
time: 20ms
memory: 8772kb
input:
100000 40385 1 28939 40385 71739 28939 66436 71739 29540 66436 79210 29540 60766 29540 68309 66436 69492 68309 21819 68309 57705 71739 33098 57705 54050 33098 19349 33098 98912 33098 20261 57705 72108 71739 49433 72108 87548 49433 78576 49433 29257 49433 39468 72108 44720 39468 87329 39468 82036 721...
output:
You win, temporarily.
result:
ok single line: 'You win, temporarily.'
Test #7:
score: 0
Accepted
time: 19ms
memory: 8636kb
input:
100000 56256 1 19611 56256 63814 19611 13211 63814 40727 13211 15422 13211 41472 63814 61111 41472 41205 41472 7343 41472 4246 63814 61460 4246 47333 61460 6130 61460 76912 4246 95893 63814 4861 95893 32371 95893 53124 95893 87414 63814 83500 63814 89982 83500 26326 89982 50802 89982 15280 89982 584...
output:
Wasted.
result:
ok single line: 'Wasted.'
Test #8:
score: 0
Accepted
time: 19ms
memory: 8644kb
input:
100000 53790 1 72385 53790 72398 72385 89902 72398 52488 89902 46763 89902 33914 72398 31021 33914 7197 33914 6377 72398 67336 6377 81807 6377 28285 72398 66168 28285 72743 28285 78065 72398 51875 78065 50576 78065 91812 72398 91740 91812 31634 91812 47708 72398 63776 47708 95702 47708 43401 47708 6...
output:
You win, temporarily.
result:
ok single line: 'You win, temporarily.'
Test #9:
score: -100
Wrong Answer
time: 0ms
memory: 3548kb
input:
2 2 1
output:
Wasted.
result:
wrong answer 1st lines differ - expected: 'You win, temporarily.', found: 'Wasted.'