제출 #502165

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

subsequence

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

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n, m, k, x, y, l, r, o, ans, res, ok, mx, mn = INF;
int a[N], b[N], dp[N], pr[N];
vec<int>s;

void print(int v){
	if(v != pr[v])print(pr[v]);
	s.pb(v);
}
main(){
	NeedForSpeed
	//freopen("subsequence.in", "r", stdin);
	//freopen("subsequence.out", "w", stdout);
    cin>>n;
    for(int i=1; i<=n; i++)cin>>a[i];
    for(int i=1; i<=n; i++)cin>>b[i];
	
	for(int i=1; i<=n; i++){
		dp[i] = 1;
		pr[i] = 0;
		for(int j=1; j<i; j++){
			if(__builtin_popcount(a[j] & a[i]) == b[i]){
				if(dp[j] + 1 > dp[i]){
					dp[i] = dp[j] + 1;
					pr[i] = j;
				}
			}
		}
	}
	for(int i=1; i<=n; i++)
		if(dp[i] > mx){
			mx = dp[i];
			x = i;
		}
	
	
	//print(x);
	while(x > 0){
		s.pb(x);
		x = pr[x];
	}
	reverse(all(s));
	cout<<s.size()<<endl;
	for(int i : s){
		cout<<i<<" ";
	}



	return 0;
}

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

subsequence.cpp:39:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   39 | main(){
      | ^~~~

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