제출 #1006755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006755		mohyay	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	48 ms	2812 KiB

subsequence

//
//  main1.cpp
//  problem1
//
//  Created by Mohammad Bashkail on 20/10/1445 AH.
//

#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
using ll = long long;
#define pb push_back
#define pF first
#define pS second
#define SP <<" "<<
vector<bitset<21>> a;
ll k[5050], dp[5050], par[5050];
int main() {
    ios::sync_with_stdio(0);cout.tie(0); cin.tie(0);
    ll n;
    cin>>n;
    for (int i=0; i<n; i++) {
        ll x;
        cin>>x;
        bitset<21> b(x);
        a.pb(b);
    }
    for (int i=0; i<n; i++) cin>>k[i];
    
    fill(dp, dp+n, 1);
    fill(par, par+n, -1);
    for (int i=0; i<n; i++) {
        for (int j=i-1; j>=0; j--) {
            bitset<21> b(a[i] & a[j]);
            if (b.count() == k[i]) {
                if (dp[j]+1 > dp[i]) {
                    par[i] = j;
                    dp[i] = dp[j]+1;
                }
            }
        }
    }
    pair<ll,ll> mx = {-1, 0};
    for (int i=0; i<n; i++) {
        if (dp[i] > mx.pF) {
            mx = {dp[i], i};
        }
    }
    cout << mx.pF << endl;
    ll i = mx.pS;
    vector<ll> ans;
    while(i != -1) {
        ans.pb(i);
        i = par[i];
    }
    reverse(ans.begin(), ans.end());
    for (ll i : ans) cout << i+1 << " ";
}

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

subsequence.cpp: In function 'int main()':
subsequence.cpp:36:27: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   36 |             if (b.count() == k[i]) {
      |                 ~~~~~~~~~~^~~~~~~

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