QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #177948 | #6696. Three Dice | value0# | WA | 1ms | 3656kb | C++20 | 1.9kb | 2023-09-13 16:20:49 | 2023-09-13 16:20:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> pii;
#define fi first
#define se second
int n,m,k;
void solve()
{
ll a,b;
scanf("%lld %lld",&a,&b);
vector<int> black;
black.push_back(2);
black.push_back(3);
black.push_back(5);
black.push_back(6);
map<int,bool> q;
n = black.size();
for(int i = 0;i<n;i++)
{
for(int j = 0;j<n;j++)
{
for(int k = 0;k<n;k++)
{
int res = black[i] + black[j] + black[k];
q[res] = true;
}
}
}
map<int,int> s;
for(int i = 0;i<n;i++)
{
for(int j = 0;j<n;j++)
{
int res = black[i] + black[j];
s[res] = 1;
}
}
if(a == 0)
{
for(auto c : q)
{
if(c.fi == b)
{
puts("Yes");
return;
}
}
puts("No");
return;
}
else if(a == 1)
{
for(auto c : s)
{
if(c.fi == b)
{
puts("Yes");
return;
}
}
puts("No");
return;
}
else if(a == 4)
{
for(auto c : s)
{
if(c.fi == b)
{
puts("Yes");
return;
}
}
puts("No");
return;
}
else if(a == 2)
{
if(b == 2 || b == 3 || b == 5 || b == 6)
{
puts("Yes");
return;
}
else
{
puts("No");
return;
}
}
else if(a == 5)
{
if(b == 2 || b == 3 || b == 5 || b == 6)
{
puts("Yes");
return;
}
else
{
puts("No");
return;
}
}
else if(a == 8)
{
if(b == 2 || b == 3 || b == 5 || b == 6)
{
puts("Yes");
return;
}
else
{
puts("No");
return;
}
}
else if(a == 3)
{
if(b != 0)
{
puts("No");
return;
}
else
{
puts("Yes");
return;
}
}
else if(a == 12)
{
if(b != 0)
{
puts("No");
return;
}
else
{
puts("Yes");
return;
}
}
puts("No");
}
int main()
{
int t = 1;
// scanf("%d",&t);
while(t--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3544kb
input:
4 5
output:
Yes
result:
ok answer is YES
Test #2:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
3 0
output:
Yes
result:
ok answer is YES
Test #3:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
1 2
output:
No
result:
ok answer is NO
Test #4:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
0 0
output:
No
result:
ok answer is NO
Test #5:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
0 1
output:
No
result:
ok answer is NO
Test #6:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
0 2
output:
No
result:
ok answer is NO
Test #7:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
0 3
output:
No
result:
ok answer is NO
Test #8:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
0 4
output:
No
result:
ok answer is NO
Test #9:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
0 5
output:
No
result:
ok answer is NO
Test #10:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
0 6
output:
Yes
result:
ok answer is YES
Test #11:
score: 0
Accepted
time: 0ms
memory: 3480kb
input:
0 7
output:
Yes
result:
ok answer is YES
Test #12:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
0 8
output:
Yes
result:
ok answer is YES
Test #13:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
0 9
output:
Yes
result:
ok answer is YES
Test #14:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
0 10
output:
Yes
result:
ok answer is YES
Test #15:
score: 0
Accepted
time: 0ms
memory: 3504kb
input:
0 11
output:
Yes
result:
ok answer is YES
Test #16:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
0 12
output:
Yes
result:
ok answer is YES
Test #17:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
1 0
output:
No
result:
ok answer is NO
Test #18:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
1 1
output:
No
result:
ok answer is NO
Test #19:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
1 4
output:
Yes
result:
ok answer is YES
Test #20:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
1 6
output:
Yes
result:
ok answer is YES
Test #21:
score: 0
Accepted
time: 0ms
memory: 3484kb
input:
1 7
output:
Yes
result:
ok answer is YES
Test #22:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
1 8
output:
Yes
result:
ok answer is YES
Test #23:
score: 0
Accepted
time: 1ms
memory: 3616kb
input:
2 3
output:
Yes
result:
ok answer is YES
Test #24:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
2 4
output:
No
result:
ok answer is NO
Test #25:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
2 6
output:
Yes
result:
ok answer is YES
Test #26:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2 8
output:
No
result:
ok answer is NO
Test #27:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
3 1
output:
No
result:
ok answer is NO
Test #28:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
0 18
output:
Yes
result:
ok answer is YES
Test #29:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
4 12
output:
Yes
result:
ok answer is YES
Test #30:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
4 11
output:
Yes
result:
ok answer is YES
Test #31:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
5 2
output:
Yes
result:
ok answer is YES
Test #32:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
5 3
output:
Yes
result:
ok answer is YES
Test #33:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
5 4
output:
No
result:
ok answer is NO
Test #34:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
5 6
output:
Yes
result:
ok answer is YES
Test #35:
score: -100
Wrong Answer
time: 1ms
memory: 3532kb
input:
6 0
output:
No
result:
wrong answer expected YES, found NO