제출 #334735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334735		limabeans	Longest beautiful sequence (IZhO17_subsequence)	C++17	7 / 100	8 ms	492 KiB

subsequence

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

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;



int n;
int a[maxn];
int k[maxn];

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

    cin>>n;
    for (int i=0; i<n; i++) {
	cin>>a[i];
    }
    for (int i=0; i<n; i++) {
	cin>>k[i];
    }

    vector<int> ans;
    for (int mask=1; mask<1<<n; mask++) {
	vector<int> v;
	for (int i=0; i<n; i++) {
	    if (mask>>i&1) v.push_back(i);
	}
	bool ok = true;
	for (int i=1; i<(int)v.size(); i++) {
	    if (__builtin_popcount(a[v[i-1]]&a[v[i]]) == k[v[i]]) {
	    } else {
		ok = false;
	    }
	}

	if (ok) {
	    if (v.size()>ans.size()) ans=v;
	}
    }

    sort(ans.begin(),ans.end());
    cout<<ans.size()<<endl;
    for (int i: ans) cout<<i+1<<" ";
    cout<<endl;
    
    
    return 0;
}

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