제출 #862781

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862781		Requiem	Longest beautiful sequence (IZhO17_subsequence)	C++17	40 / 100	100 ms	14428 KiB

subsequence

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define endl "\n"
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define pi 3.14159265359
#define TASKNAME "subsequence"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; } 
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; } 
using namespace std; 
typedef pair<int,int> ii; 
typedef pair<int,ii> iii; 
typedef vector<int> vi; 
const int MAXN = 2e5 + 9;
int a[MAXN],k[MAXN],n;
int dp[MAXN],trace[MAXN],mx=0,pos=0;
ii pre[MAXN];
main() 
{ 
    fast; 
    // freopen(TASKNAME".inp","r",stdin); 
    // freopen(TASKNAME".out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    } 
    for(int i=1;i<=n;i++){
        cin>>k[i];
    }
    if (n<=5000){
        for(int i=1;i<=n;i++){
            dp[i] = 1;
            trace[i] = -1;
            for(int j=i-1;j>=1;j--){
                int x = (a[i] & a[j]);
                if (__builtin_popcount(x) == k[i] and dp[i] < dp[j] + 1) {
                    dp[i] = dp[j] + 1;
                    trace[i] = j;
                }
            }
            if (dp[i] > mx){
                mx = dp[i];
                pos = i;
            }
        }
        vector<int> vt;
        while(pos != -1){
            vt.pb(pos);
            pos = trace[pos];
        }
        cout<<mx<<endl;
        for(int i=vt.size()-1;i>=0;i--){
            cout<<vt[i]<<' ';
        }
        cout<<endl;
    }
    else{
        int mx = 0, pos = 0;
        for(int i=0;i<=255;i++){
            pre[i] = ii(-1,-1);
        }
        for(int i=1;i<=n;i++){
            trace[i] = -1;
            dp[i] = 1;
            for(int j=0;j<=255;j++){
                if (pre[j].se == -1) continue;
                if (__builtin_popcount(a[i] & j) == k[i]) {
                    int pos = pre[j].se;
                    if (dp[i] < pre[j].fi + 1){
                        dp[i] = pre[j].fi + 1;
                        trace[i] = pre[j].se;
                    }
                }
            }
            pre[a[i]] = max(pre[a[i]],ii(dp[i],i));
            if (dp[i] > mx){
                mx = dp[i];
                pos = i;
            }
        }
        vector<int> vt;
        while(pos != -1){
            vt.pb(pos);
            pos = trace[pos];
        }
        cout<<mx<<endl;
        for(int i=vt.size()-1;i>=0;i--){
            cout<<vt[i]<<' ';
        }
        cout<<endl;

    }


    
} 

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

subsequence.cpp:25:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   25 | main()
      | ^~~~
subsequence.cpp: In function 'int main()':
subsequence.cpp:75:25: warning: unused variable 'pos' [-Wunused-variable]
   75 |                     int pos = pre[j].se;
      |                         ^~~

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