제출 #1294201

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

subsequence

//
// Created by liasa on 23/11/2025.
//
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v vector
#define lp(i, s, e) for (int i = s; i < e; ++i)

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  v<int> a(n), k(n);
  lp(i, 0, n) cin >> a[i];
  lp(i, 0, n) cin >> k[i];

  int ans = 0, idx = 0;
  v<int> dp(n + 1, 1), pr(n + 1, -1);

  lp(i, 1, n + 1) {
    dp[i] = 1;
    lp(j, 1, i) {
      int cnt_and = __builtin_popcount(a[i - 1] & a[j - 1]);
      if (cnt_and == k[i - 1] && dp[i] < dp[j] + 1) {
        dp[i] = max(dp[i], dp[j] + 1);
        pr[i] = j;
      }
    }
    if (ans < dp[i]) {
      ans = dp[i];
      idx = i;
    }
  }

  v<int> vec;

  while (idx != -1) {
    vec.push_back(idx);
    idx = pr[idx];
  }
  cout << ans<<'\n';
  reverse(vec.begin(), vec.end());
  for (auto it : vec) {
    cout << it << " ";
  }
}

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