제출 #333674

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

subsequence

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k[N];
#define count __builtin_popcountll
void solve(int test_case){
	int i, j;
	cin >> n;
	for(i=0;i<n;i++){
		cin >> a[i];
	}
	for(i=0;i<n;i++){
		cin >> k[i];
	}
	vector<int> ans;
	int sz = 0;
	for(int mask = 0; mask < (1<<n); mask++){
		bool pos = true;
		int last = -1;
		for(i=0;i<n;i++){
			if(mask&(1<<i)){
				if(last == -1);
				else {
					if(!(count(a[i]&a[last]) == k[i])){
						pos = false;
					}
				}last = i;
			}
		}if(pos){
			if(sz < count(mask)){
				sz = count(mask);
				ans.clear();
				for(i=0;i<n;i++){
					if((1<<i)&mask){
						ans.pb(i+1);
					}
				}
			}
		}
	}
	cout << sz << '\n';
	for(auto x : ans)cout << x << ' ';
	cout << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

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

subsequence.cpp: In function 'void solve(long long int)':
subsequence.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
   17 |  int i, j;
      |         ^

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