22/7/6

1，cf Knapsack

题意：

给你n和w，再给出n个wi，使得你所选点wi的和在w/2上取整，和w之间；⌈W/2⌉≤C≤W

存在方案，输出选的个数和索引，否则输出-1；

思路：之间排序，从小到大开始选；但是坑点，并不是碰到>=mid就结束了，需要特判使得sum>w

的那个wi，如果wi<W,那么wi肯定也大于mid，不然没法使sumi-1在加上wi后>mid且>w，所以此时，只选wi就是一种方案；

还有奇怪的bug。。，

const int N=2e6+10;

LL n,W;
struct node
{
    LL w,id;
}a[N];
bool cmp(node a,node b)
{
    return a.w<b.w;
}
vector<LL>ans;
void solve()
{
    LL sum=0;
    ans.clear();
    ans.reserve(N);
    cin>>n>>W;
    LL mid=1+W>>1;
    rep2(i,1,n)
    {
        LL x;cin>>x;
        a[i]={x,(LL)i};
    }
    sort(a+1,a+n+1,cmp);
    bool f=0;
    rep2(i,1,n)
    {
        sum+=a[i].w;
        ans.pb(a[i].id);
        if(sum>=mid)
        {
            if(sum<=W)
            {
                int siz=ans.size();
                cout<<siz<<endl;
                rep1(i,0,siz)cout<<ans[i]<<" ";
                cout<<endl;
                f=1;
            }
            else if(a[i].w<=W)
            {
                cout<<1<<endl<<a[i].id<<endl;
                f=1;
            }
            break;
        }
    }
    if(!f)cout<<-1<<endl;
}

该代码可以过；但是下面的就不可以；return直接结束函数有问题貌似，待研究；

const int N=2e6+10;

LL n,W;
struct node
{
    LL w,id;
}a[N];
bool cmp(node a,node b)
{
    return a.w<b.w;
}
vector<LL>ans;
void solve()
{
    LL sum=0;
    ans.clear();
    ans.reserve(N);
    cin>>n>>W;
    LL mid=1+W>>1;
    rep2(i,1,n)
    {
        LL x;cin>>x;
        a[i]={x,(LL)i};
    }
    sort(a+1,a+n+1,cmp);
    bool f=0;
    rep2(i,1,n)
    {
        sum+=a[i].w;
        ans.pb(a[i].id);
        if(sum>=mid)
        {
            if(sum<=W)
            {
                int siz=ans.size();
                cout<<siz<<endl;
                rep1(i,0,siz)cout<<ans[i]<<" ";
                cout<<endl;
                return ;
            }
            else if(a[i].w<=W)
            {
                cout<<1<<endl<<a[i].id<<endl;
                return;
            }
            else
            {
                cout<<-1<<endl;
                return;
            }
        }
    }
}

还有一种思路就是从大到小取，不用考虑特判，这么取一定对；

#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rep1(i,a,n) for(register int i=(a);i<(n);++i) 
#define rep2(i,a,n) for(register int i=(a);i<=(n);++i) 
#define per1(i,n,a) for(register int i=(n);i>(a);i--) 
#define per2(i,n,a) for(register int i=(n);i>=(a);i--)
#define quick_cin() cin.tie(0),cout.tie(0),ios::sync_with_stdio(false)
#define memset(a,i,b) memset((a),(i),sizeof (b))
#define memcpy(a,i,b) memcpy((a),(i),sizeof (b))
#define pro_q priority_queue
#define pb push_back
#define pf push_front
#define endl "\n"
#define lowbit(m) ((-m)&(m))
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define yes cout<<"yes\n"
#define no cout<<"no\n"
#define yi first
#define er second
#define INF 0x3f3f3f3f
#define tulun() int e[N],ne[N],h[N],w[N],idx;
#define add2(a,b) e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define add3(a,b,c) w[idx]=c,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
using namespace std;

typedef long long LL;
typedef double dob;
const int N=2e6+10;

LL n,W;
struct node
{
    LL w,id;
}a[N];
bool cmp(node a,node b)
{
    return a.w>b.w;
}
vector<LL>ans;
void solve()
{
    LL sum=0;
    ans.clear();
    ans.reserve(N);
    cin>>n>>W;
    LL mid=1+W>>1;
    rep2(i,1,n)
    {
        LL x;cin>>x;
        a[i]={x,(LL)i};
    }
    sort(a+1,a+n+1,cmp);
    bool f=0;
    rep2(i,1,n)
    {
        sum+=a[i].w;
        if(sum>W)
        {
            sum-=a[i].w;
            continue;
        }
        ans.pb(a[i].id);
        if(sum>=mid)break;
    }
    if(sum>=mid&&sum<=W)
    {
        cout<<ans.size()<<endl;
        rep1(i,0,ans.size())cout<<ans[i]<<" ";
        cout<<endl;
    }
    else cout<<-1<<endl;
}
signed main()
{
    quick_cin();
    int T;
    cin>>T;
    while (T--)
    {
        solve();
    }
    
    return 0;
}