제출 #39317

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

subsequence

/// In The Name Of God
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)1e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int n;
int a[N], b[N], Mx[N];
int dp[N], opt[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> b[i];
		dp[i] = 1;
	}
	int mx = 1, ptr = 1;
	for (int i = 1; i <= n; i++) {
		Mx[i] = max(Mx[i - 1], dp[i]);
		if (__builtin_popcount(a[i]) < b[i]) continue;
		for (int j = i - 1; j >= 1; j--) {
			if (__builtin_popcount(a[i] & a[j]) == b[i]) {
				if (dp[j] >= dp[i]) {
					dp[i] = dp[j] + 1;
					opt[i] = j;
				}
				if (dp[i] > mx) {
					mx = dp[i];
					ptr = i;
				}
			}
			if (Mx[j] < dp[i]) break;
		}	
		Mx[i] = max(Mx[i - 1], dp[i]);
		if (clock() / (double)CLOCKS_PER_SEC > 2.95) break;
	}
	vector <int> ans;
	while (ptr) {
		ans.pb(ptr);
		ptr = opt[ptr];
	}
	reverse(all(ans));
	cout << sz(ans) << nl;
	for (auto it : ans) {
		cout << it << ' ';
	}
	ioi
}

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