Submission #501631

#	Time	Username	Problem	Language	Result	Execution time	Memory
501631		mansur	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	1 ms	312 KiB

subsequence

#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
 
const int inf = 1e9, N = 5e5 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int lst[20], mx, pos;

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);  
	int n;
	cin >> n;
	int a[n + 1], k[n + 1];
	vector<int> dp(n + 1, 1), l(n + 1);
	dp[0] = a[0] = 0;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> k[i];
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 20; j++) {
			if (__builtin_popcount(a[lst[j]] & a[i]) == k[i]) {
				if (dp[i] < dp[lst[j]] + 1) {
					dp[i] = dp[lst[j]] + 1;
					l[i] = lst[j];
				}
			}
			if (a[i] >> j & 1) lst[j] = i;
		}
		if (dp[pos] < dp[i]) {
			pos = i;
		}
	}
	vector<int> ans;
	while (pos) {
		ans.pb(pos);
		pos = l[pos];
	}
	cout << sz(ans) << nl;
	reverse(all(ans));
	for (auto e: ans) cout << e << ' ';
}

Compilation message (stderr)

subsequence.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
subsequence.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
subsequence.cpp:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main() {
      | ^~~~

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