제출 #35285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
35285		dqhungdl	Longest beautiful sequence (IZhO17_subsequence)	C++14	40 / 100	216 ms	3720 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
ii maxd[300];
int n,a[100005],b[100005],f[100005],Trace[100005];
vector<int> rs;

void Sub1()
{
    int res=0,id;
    for(int i=1; i<=n; i++)
    {
        f[i]=1;
        for(int j=1; j<i; j++)
            if(__builtin_popcount(a[i]&a[j])==b[i]&&f[i]<f[j]+1)
            {
                f[i]=f[j]+1;
                Trace[i]=j;
            }
        if(res<f[i])
        {
            res=f[i];
            id=i;
        }
    }
    while(id>0)
    {
        rs.push_back(id);
        id=Trace[id];
    }
    cout<<rs.size()<<"\n";
    for(int i=rs.size()-1;i>=0;i--)
        cout<<rs[i]<<' ';
}

void Sub2()
{
    int res=0,id;
    for(int i=1;i<=n;i++)
    {
        f[i]=1;
        for(int j=0;j<=255;j++)
            if(__builtin_popcount(a[i]&j)==b[i]&&f[i]<maxd[j].first+1)
            {
                f[i]=maxd[j].first+1;
                Trace[i]=maxd[j].second;
            }
        if(maxd[a[i]].first<f[i])
            maxd[a[i]]=ii(f[i],i);
        if(res<f[i])
        {
            res=f[i];
            id=i;
        }
    }
    while(id>0)
    {
        rs.push_back(id);
        id=Trace[id];
    }
    cout<<rs.size()<<"\n";
    for(int i=rs.size()-1;i>=0;i--)
        cout<<rs[i]<<' ';
}

int main()
{
    //freopen("TEST.INP","r",stdin);
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=n; i++)
        cin>>b[i];
    if(n<=5000)
        Sub1();
    else
        Sub2();
}

컴파일 시 표준 에러 (stderr) 메시지

subsequence.cpp: In function 'void Sub2()':
subsequence.cpp:39:15: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int res=0,id;
               ^

• Subtask 1: 7 / 7
• Subtask 2: 16 / 16
• Subtask 3: 17 / 17
• Subtask 4: 0 / 60