Submission #36120

#	Time	Username	Problem	Language	Result	Execution time	Memory
36120		aome	Longest beautiful sequence (IZhO17_subsequence)	C++14	0 / 100	29 ms	93852 KiB

subsequence

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

const int N = 100005;
const int M = 1024;
const int INF = 1e9;

int n, a[N], b[N], cnt[M];
pair<int, int> f[N];
pair<int, int> g[M][M][11];

int main() {
	ios::sync_with_stdio(false);
	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 = 0; i < M; ++i) {
		for (int j = 0; j < 10; ++j) cnt[i] += i >> j & 1;
	}
	for (int i = 0; i < M; ++i) for (int j = 0; j < M; ++j) {
		for (int k = 0; k < 10; ++k) {
			g[i][j][k] = make_pair(-INF, 0);
		}
	}
	int pos = 0;
	for (int i = 1; i <= n; ++i) {
		int pre = 0, suf = 0;
		for (int j = 0; j < 10; ++j) {
			if (a[i] >> j & 1) pre |= 1 << j;
		}
		for (int j = 10; j < 20; ++j) {
			if (a[i] >> j & 1) suf |= 1 << (j - 10);
		}
		f[i] = make_pair(1, 0);
		for (int j = 0; j < M; ++j) {
			int tmp = j & pre;
			if (cnt[tmp] > b[i]) continue;
			f[i] = max(f[i], g[j][suf][b[i] - cnt[tmp]]);
		}
		for (int j = 0; j < M; ++j) {
			int tmp = suf & j;
			g[pre][j][cnt[tmp]] = max(g[pre][j][cnt[tmp]], make_pair(f[i].first + 1, i));
		}
		if (f[pos].first < f[i].first) pos = i;
	}
	vector<int> res;
	int cur = pos;
	while (cur) {
		res.push_back(cur), cur = f[cur].second;
	}
	reverse(res.begin(), res.end());
	printf("%d\n", res.size());
	for (int i = 0; i < res.size(); ++i) printf("%d ", res[i]);
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:52:27: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
  printf("%d\n", res.size());
                           ^
subsequence.cpp:53:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < res.size(); ++i) printf("%d ", res[i]);
                    ^

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