QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #782549 | #9784. Donkey and Puss in Boots | Bambibi | WA | 0ms | 3708kb | C++20 | 476b | 2024-11-25 20:26:53 | 2024-11-25 20:26:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, summ;
ll a[100010], b[100010];
int main()
{
cin>>n;
int a0=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
summ += a[i];
if(a[i]==0) a0++;
}
for(int i=1;i<=n;i++)
{
b[i] = summ-a[i];
if(b[i]<n)
{
cout<<"Donkey"<<endl;
return 0;
}
}
if(a0==n-1)
{
cout<<"Donkey"<<endl;
}
else
{
cout<<"Puss in Boots"<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
2 2 2
output:
Puss in Boots
result:
ok single line: 'Puss in Boots'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
4 0 47 0 0
output:
Donkey
result:
ok single line: 'Donkey'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
4 0 47 0 0
output:
Donkey
result:
ok single line: 'Donkey'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3644kb
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: 3692kb
input:
5 8 5 1 1 0
output:
Puss in Boots
result:
ok single line: 'Puss in Boots'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
9 5 13 1 0 0 0 0 0 0
output:
Donkey
result:
ok single line: 'Donkey'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
7 13 0 1 0 0 0 0
output:
Donkey
result:
ok single line: 'Donkey'
Test #8:
score: -100
Wrong Answer
time: 0ms
memory: 3568kb
input:
5 0 0 0 0 0
output:
Donkey
result:
wrong answer 1st lines differ - expected: 'Puss in Boots', found: 'Donkey'