제출 #1135415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135415		lopkus	Longest beautiful sequence (IZhO17_subsequence)	C++20	7 / 100	6090 ms	328 KiB

subsequence

#include <bits/stdc++.h>

#define int long long

using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for(int i = 0; i < n; i++) {
        cin >> b[i];
    }
    vector<int> ans;
    for(int i = 0; i < (1LL << n); i++) {
        vector<int> current;
        int pret = - 1;
        int ok = 1;
        for(int j = 0; j < n; j++) {
            if(i & (1LL << j)) {
                if(pret != - 1 && __builtin_popcount((a[pret] & a[j])) != b[j]) {
                    ok = 0;
                    break;
                }
                pret = j;
                current.push_back(j + 1);
            }
        }
        if(ok && ans.size() < current.size()) {
            ans = current;
        }
    }
    cout << ans.size();
    cout << endl;
    for(auto it : ans) {
        cout << it << " ";
    }
}

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