QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#301616 | #5475. Make a Loop | wxhtzdy | WA | 0ms | 1500kb | C++20 | 481b | 2024-01-10 03:48:47 | 2024-01-10 03:48:47 |
Judging History
answer
#include <stdio.h>
int min(int a, int b) { return a < b ? a : b; }
int n,x,s,a[101],dp[2][500002];
int main(){
scanf("%d",&n);
for(int i=1,s=0;i<=n;i++) scanf("%d",&a[i]),s+=a[i];
dp[0][0]=1;
int ns=0;
for(int i=1;i<=n;i++){
ns+=a[i];
for(int j=ns;j>=a[i];j--){
dp[0][j]=min(4,dp[0][j]+dp[1][j-a[i]]);
dp[1][j]=min(4,dp[1][j]+dp[0][j-a[i]]);
}
}
if(n%2==0&&s%2==0&&dp[0][s/2]>=4) printf("Yes\n"); else printf("No\n");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 1500kb
input:
4 1 1 1 1
output:
No
result:
wrong answer 1st lines differ - expected: 'Yes', found: 'No'