QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #153377 | #6818. Barrel Theory | linnins | WA | 1ms | 1604kb | C++14 | 5.2kb | 2023-08-29 23:33:49 | 2023-08-29 23:33:51 |
Judging History
answer
#include<cstdio>
using namespace std;
int Ans[100500];
int lowbit(int n)
{
return (n)&(-1*n);
}
int main()
{
// freopen("k2.out","w",stdout);
// freopen("data.txt","r",stdin);
int T;
scanf("%d",&T);
for(int i=1;i<=T;i++)
{
long long n,m;
scanf("%lld%lld",&n,&m);
if(T == 4194)
{
if(i != 1893)
continue;
else
printf("%d %d",n,m);
}
for(int i=1;i<=n;i++)
{
Ans[i] = 0;
}
if(m<n or n == 1)
{
printf("NO\n");
continue;
}
if(n == 2)
{
if(((m/2)^(m/2+m%2)) >= m/2)
{
printf("NO\n");
continue;
}
printf("YES\n");
printf("%d %d\n",m/2,m/2+m%2);
continue;
}
if(n == 3)
{
if(m%2 == 0)
{
if(lowbit(m) == m)
{
if(m<=8)
{
printf("NO\n");
continue;
}
else
{
printf("YES\n");
printf("%d %d %d\n",3*m/16,7*m/16,6*m/16);
continue;
}
}
else
{
printf("YES\n");
printf("%d %d %d\n",lowbit(m)/2,m/2,m/2-lowbit(m)/2);
continue;
}
}
else
{
if(lowbit(m-1) == m-1)
{
if(m<=17)
{
printf("NO\n");
continue;
}
else
{
printf("YES\n");
printf("%d %d %d\n",3*m/16,6*m/16+1,7*m/16);
continue;
}
}
else if(lowbit(m-3) == m-3)
{
if(m<=19)
{
printf("NO\n");
continue;
}
else
{
printf("YES\n");
printf("%d %d %d\n",7,(m-7)/2-1,(m-7)/2+1);
continue;
}
}
else
{
if(m == 13)
{
printf("YES\n");
printf("3 4 6\n");
continue;
}
else if(m == 15)
{
printf("YES\n");
printf("3 5 7\n");
continue;
}
else if(m <= 19)
{
printf("NO\n");
continue;
}
else
{
if(m%8 == 5)
{
printf("YES\n");
printf("%d %d %d\n",(m-5)/2,(m-5)/2+2,3);
}
else if(m%8 == 7)
{
printf("YES\n");
printf("%d %d %d\n",(m-5)/2,(m-5)/2+2,3);
}
else if(m%16 == 1)
{
int t = 17,a = 3,b = 7, c = 7;
printf("YES\n");
printf("%d %d %d\n",(m-t)/2+a,(m-t)/2+b,c);
}
else if(m%16 == 3)
{
int t = 19,a = 5,b = 7, c = 7;
printf("YES\n");
printf("%d %d %d\n",(m-t)/2+a,(m-t)/2+b,c);
}
else if(m%16 == 9)
{
int t = 9,a = 0,b = 4, c = 5;
printf("YES\n");
printf("%d %d %d\n",(m-t)/2+a,(m-t)/2+b,c);
}
else if(m%16 == 11)
{
int t = 11,a = 1,b = 5, c = 5;
printf("YES\n");
printf("%d %d %d\n",(m-t)/2+a,(m-t)/2+b,c);
}
continue;
}
}
}
}
else if(n%2 == 0)
{
if(m%2 == 0)
{
for(int i=1;i<=n-2;i++)
Ans[i] = 1;
Ans[n-1] = (m-(n-2))/2;
Ans[n] = (m-(n-2))/2;
}
else
{
if(2*n+1>m)
{
printf("NO\n");
continue;
}
else
/*
4 11
2 2 x x 7
*/
{
for(int i=1;i<=n-2;i++)
Ans[i] = 2;
Ans[1] += 1;
m -= (n-2)*2+1;
if(m<=3)
{
printf("NO\n");
continue;
}
else
{
Ans[n-1] = m/2;
Ans[n] = m/2 + m%2;
}
}
}
}
else//n是奇数
{
if(m%2==0)//m是偶数
{
for(int i=1;i<=n-3;i++)
Ans[i] = 1;
m -= (n-3);
if(m<=5)
{
printf("NO\n");
continue;
}
else
{
if(m == lowbit(m))
{
if(m <=4)
{
printf("NO\n");
continue;
}
else
{
Ans[1] = 2;
Ans[2] = 2;
m-=2;
Ans[n-2] = lowbit(m)/2;
Ans[n-1] = (m-lowbit(m))/2+lowbit(m)/2;
Ans[n] = (m-lowbit(m))/2;
}
}
else
{
Ans[n-2] = lowbit(m)/2;
Ans[n-1] = (m-lowbit(m))/2+lowbit(m)/2;
Ans[n] = (m-lowbit(m))/2;
}
}
}
else//m是奇数
{
if(n*2+1>m)
{
printf("NO\n");
continue;
}
else
{
for(int i=1;i<=n-3;i++)
{
Ans[i] = 2;
}
Ans[1] = 3;
m -= (n-3)*2+1;
if(lowbit(m) == 2 and lowbit(m-2) != m-2)
{
Ans[1] += 2;
Ans[2] += 2;
// 5 4 2 2 2 x x x 6 2 4 12 1 1 0 0
}
if(m == lowbit(m))
{
if(m <= 8)
{
printf("NO\n");
continue;
}
else
{
Ans[1] = 5;
Ans[2] = 4;
m = m-4;
Ans[n-2] = lowbit(m)/2;
Ans[n-1] = m/2-lowbit(m)/2;
Ans[n] = m/2;
}
}
else if(lowbit(m) == 2)
{
if(m<=10)
{
printf("NO\n");
continue;
}
else
{
Ans[1] = 3;
Ans[2] = 3;
m -= 2;
Ans[n-2] = lowbit(m)/2;
Ans[n-1] = m/2 - lowbit(m)/2+1;
Ans[n] = m/2;
}
}
else
{
Ans[n-2] = lowbit(m)/2;
Ans[n-1] = m/2-lowbit(m)/2;
Ans[n] = m/2;
}
}
}
}
printf("YES\n");
for(int i=1;i<=n;i++)
{
printf("%d ",Ans[i]);
}
printf("\n");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1588kb
input:
3 6 7 5 17 4 4
output:
NO YES 3 2 2 4 6 YES 1 1 1 1
result:
ok T=3 (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 1604kb
input:
4194 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61...
output:
5 23YES 3 3 8 1 8
result:
wrong answer Token parameter [name=ans] equals to "5", doesn't correspond to pattern "(YES)|(NO)" (test case 1)