QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #774531 | #9784. Donkey and Puss in Boots | ucup-team5697# | WA | 0ms | 3824kb | C++14 | 551b | 2024-11-23 13:23:57 | 2024-11-23 13:23:57 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#define mems(x, v) memset(x, v, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef long double wisdom;
map <int, int> cnt;
int main() {
int n; scanf("%d", &n);
for (int i = 1, x; i <= n; i++) scanf("%d", &x), cnt[x]++;
if (cnt[0] == n - 1) return puts("Donkey"), 0; puts("Puss in Boots");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
input:
2 2 2
output:
Puss in Boots
result:
ok single line: 'Puss in Boots'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
4 0 47 0 0
output:
Donkey
result:
ok single line: 'Donkey'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
4 0 47 0 0
output:
Donkey
result:
ok single line: 'Donkey'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
10 5 7 3 0 2 0 0 1 0 0
output:
Puss in Boots
result:
ok single line: 'Puss in Boots'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
5 8 5 1 1 0
output:
Puss in Boots
result:
ok single line: 'Puss in Boots'
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3756kb
input:
9 5 13 1 0 0 0 0 0 0
output:
Puss in Boots
result:
wrong answer 1st lines differ - expected: 'Donkey', found: 'Puss in Boots'