QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #815295 | #9870. Items | zzuqy | WA | 25ms | 3808kb | C++14 | 1.5kb | 2024-12-15 11:55:47 | 2024-12-15 11:55:47 |
Judging History
answer
#include<bits/stdc++.h>
#define N 100009
#define D 100009
#define int long long
using namespace std;
int n,m,k,a[N];
bitset<D*2>ok,ok2;
int aabs(int x,int y){
return max(x-y,y-x);
}
void solve(){
scanf("%lld%lld",&n,&m);
unordered_set<int>s;int k=0;
for(int i=1;i<=n;i++){
int x;scanf("%lld",&x);
s.insert(x);
}
for(auto i:s)a[++k]=i;
sort(a+1,a+k+1);
a[0]=-10000000000000;
a[k+1]=10000000000000;
int tmp=m/n;
int pos=0;
for(int i=1;i<=k;i++){
if(a[i]<=tmp&&tmp<a[i+1])pos=i;
}
int c=0;
for(int i=0;i<=n;i++){
if(aabs(a[pos]*i+a[pos+1]*(n-i),m)<aabs(a[pos]*c+a[pos+1]*(n-c),m))c=i;
}
m-=a[pos]*c+a[pos+1]*(n-c);
if(aabs(m,0)>D){
cout<<"No";
return;
}
ok.reset();
ok[m+D]=1;
vector<int>p,q;
for(int i=1;i<=k;i++){
if(aabs(a[i],a[pos])<D/2-1&&i!=pos)p.push_back(a[i]-a[pos]);
if(aabs(a[i],a[pos+1])<D/2-1&&i!=pos+1)q.push_back(a[i]-a[pos+1]);
}
if(p.size())
for(int i=1;i<=min(100ll*n/(int)p.size(),c);i++){
ok2.reset();
for(auto x:p){
if(x<0)ok2|=(ok<<(-x));
else ok2|=(ok>>x);
}
ok=ok2|ok;
if(ok[D]){
cout<<"Yes"<<endl;
return;
}
}
if(q.size())
for(int i=1;i<=min(100ll*n/(int)q.size(),n-c);i++){
ok2.reset();
for(auto x:q){
if(x<0)ok2|=(ok<<(-x));
else ok2|=(ok>>x);
}
ok=ok2|ok;
if(ok[D]){
cout<<"Yes"<<endl;
return;
}
}
cout<<"No"<<endl;
}
signed main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int t;scanf("%lld",&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: 3744kb
input:
4 5 25 0 0 0 0 5 5 11 4 4 4 5 5 5 0 1 2 3 4 5 5 25 0 1 2 3 4
output:
Yes No No No
result:
ok 4 token(s): yes count is 1, no count is 3
Test #2:
score: -100
Wrong Answer
time: 25ms
memory: 3808kb
input:
1314 1 0 0 1 0 1 1 1 0 1 1 1 2 0 0 0 2 0 0 1 2 0 0 2 2 0 1 0 2 0 1 1 2 0 1 2 2 0 2 0 2 0 2 1 2 0 2 2 2 1 0 0 2 1 0 1 2 1 0 2 2 1 1 0 2 1 1 1 2 1 1 2 2 1 2 0 2 1 2 1 2 1 2 2 2 2 0 0 2 2 0 1 2 2 0 2 2 2 1 0 2 2 1 1 2 2 1 2 2 2 2 0 2 2 2 1 2 2 2 2 2 3 0 0 2 3 0 1 2 3 0 2 2 3 1 0 2 3 1 1 2 3 1 2 2 3 2 0...
output:
No No No No No Yes Yes Yes No No Yes No No No Yes No Yes No No No No No No Yes Yes Yes No Yes Yes Yes No No No No No No Yes No Yes No No No Yes No No Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No No Yes No No No Yes No No No Yes Yes Yes Yes Y...
result:
wrong answer expected YES, found NO [1st token]