2021牛客国庆集训派对day3

2021牛客国庆集训派对day3

PACM Team

#include <iostream>
using namespace std;
#define N 40
int p[N],a[N],c[N],m[N],v[N],ans[N],dp[N][N][N][N];
long long pre[N][N][N][N];
int main()
{
    int n;
    cin >> n;
    for(int i=1;i<=n;i++)
        cin >> p[i] >> a[i] >> c[i] >> m[i] >> v[i];
    int P,A,C,M;
    cin >> P >> A >> C >> M;
    for(int id=1;id<=n;id++)
    {
        if(p[id]>P||a[id]>A||c[id]>C||m[id]>M)
            continue;
        for(int i=P;i>=p[id];i--)
        {
            for(int j=A;j>=a[id];j--)
            {
                for(int k=C;k>=c[id];k--)
                {
                    for(int l=M;l>=m[id];l--)
                    {
                        if(dp[i][j][k][l]<dp[i-p[id]][j-a[id]][k-c[id]][l-m[id]]+v[id])
                        {
                            dp[i][j][k][l]=dp[i-p[id]][j-a[id]][k-c[id]][l-m[id]]+v[id];
                            pre[i][j][k][l]=pre[i-p[id]][j-a[id]][k-c[id]][l-m[id]]|((long long)1<<id-1);
                        }
                    }
                }
            }
        }
    }
    int cnt=0;
    for(int i=0;i<n;i++)
        if(pre[P][A][C][M]&((long long)1<<i))
            ans[++cnt]=i;
    if(!cnt)
        cout << 0 << endl;
    else
    {
        cout << cnt << endl;
        for(int i=1;i<=cnt;i++)
        {
            if(i==1)
                cout << ans[i];
            else
                cout << " " << ans[i] << endl;
        }
        cout << endl;
    }
    return 0;
}

Shuffle Cards

#include <iostream>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
rope <int> r;
int main()
{
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=n;i++)
        r.push_back(i);
    while(m--)
    {
        int pos,len;
        cin >> pos >> len;
        pos--;
        r=r.substr(pos,len)+r.substr(0,pos)+r.substr(pos+len,n-pos-len);
    }
    for(int i=0;i<n;i++)
    {
        if(!i)
            cout << r[i];
        else
            cout << " " << r[i];
    }
    cout << endl;
    return 0;
}

Sort String

#include <iostream>
#include <cstring>
using namespace std;
#define N 1000005
char s[N];
int nx[N];
void getnext(char s[])
{
    for(int i=2,j=0;s[i];i++)
    {
        while(s[i]!=s[j+1]&&j>0)
            j=nx[j];
        if(s[i]==s[j+1])
            j++;
        nx[i]=j;
    }
}
int solve()
{
    getnext(s);
    int len=strlen(s+1);
    if(len%(len-nx[len]))
        return 1;
    else
        return len/(len-nx[len]);
}
int main()
{
    scanf("%s",s+1);
    int len=strlen(s+1);
    int cnt1=solve();//循环节个数
    int cnt2=len/cnt1;//循环节长度
    printf("%d\n",cnt2);
    for(int i=0;i<cnt2;i++)
    {
        printf("%d",cnt1);
        for(int j=0;j<cnt1;j++)
            printf(" %d",i+j*cnt2);
        printf("\n");
    }
    return 0;
}

Diff-prime Pairs

#include <iostream>
using namespace std;
#define N 1000005
int cnt,flag[10*N],prime[N],num[N];
long long sum[N];
void getprime(int n)
{
    for(int i=2;i<=n;i++)
    {
        if(!flag[i])
            prime[++cnt]=i;
        for(int j=1;prime[j]*i<=n;j++)
        {
            flag[prime[j]*i]=1;
            if(i%prime[j]==0)
                break;
        }
    }
}
int main()
{
    int n;
    cin >> n;
    getprime(n);
    for(int i=2;i<=cnt;i++)
        num[i]=n/prime[i];
    for(int i=2;i<=cnt;i++)
        sum[i]=sum[i-1]+num[i];
    long long ans=0;
    for(int i=1;i<cnt;i++)
        ans+=sum[cnt]-sum[i];
    cout << 2*ans << endl;
    return 0;
}