제출 #502251

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502251		luka1234	Longest beautiful sequence (IZhO17_subsequence)	C++14	0 / 100	1 ms	332 KiB

subsequence

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
int n;
int a[100001],b[100001];
int d[257];
vector<int> ans[257];
int main(){
	cin>>n;
	for(int k=1;k<=n;k++)
	    cin>>a[k];
	for(int k=1;k<=n;k++)
	    cin>>b[k];
	d[a[1]]=1;
	ans[a[1]].push_back(1);
	for(int k=2;k<=n;k++){
		int cnt=0;
		int ind=0;
		for(int i=0;i<256;i++){
			int f=a[k]&i;
			f=__builtin_popcount(f);
			if(f==b[k]){
				if(d[i]+1>cnt){
					cnt=d[i]+1;
					ind=i;
				}
			}
		}
		if(d[a[k]]<cnt){
			d[a[k]]=cnt;
			ans[a[k]]=ans[ind];
			ans[a[k]].push_back(k);
		}
	}
	int mx=0;
	int ind=0;
	for(int k=0;k<256;k++){
		if(d[k]>mx){
			mx=d[k];
			ind=k;
		}
	}
	cout<<mx<<"\n";
	int sz=ans[ind].size();
	for(int k=0;k<sz;k++)
	    cout<<ans[ind][k]<<' ';
	return 0;
}

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