제출 #36090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36090		UncleGrandpa925	Longest beautiful sequence (IZhO17_subsequence)	C++14	23 / 100	159 ms	3728 KiB

subsequence

/*input
5
5 3 5 3 5
10 1 20 1 20
4
1 2 3 4
10 0 1 0
4
1 2 3 4
10 0 1 0
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define N 100005
#define bit(x,y) ((x>>y)&1LL)
#define na(x) (#x) << ":" << x
ostream& operator << (ostream &os, vector<int>&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << sp;
	return os;
}
ostream& operator << (ostream &os, pair<int, int> x) {
	cout << x.fi << sp << x.se << sp;
	return os;
}
ostream& operator << (ostream &os, vector<pair<int, int> >&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << endl;
	return os;
}

int n;
int a[N], b[N];
int dp[N];
int par[N];
vector<int> order;
pair<int, int> bestMask[(1 << 8)];

void solveSub2() {
	pair<int, int> ans = mp(1, 1);
	for (int i = 1; i <= n; i++) {
		dp[i] = 1;
		for (int j = 1; j <= i - 1; j++) {
			if (dp[j] + 1 > dp[i] && __builtin_popcount(a[j]&a[i]) == b[i]) {
				dp[i] = dp[j] + 1;
				par[i] = j;
				ans = max(ans, mp(dp[i], i));
			}
		}
	}
	cout << ans.fi << endl;
	while (ans.fi >= 1) {
		order.push_back(ans.se);
		ans.se = par[ans.se];
		ans.fi--;
	}
	reverse(order.begin(), order.end());
	cout << order << endl;
}

set<int> st;
void solveSub3() {
	pair<int, int> ans = mp(1, 1);
	for (int i = 1; i <= n; i++) {
		dp[i] = 1;
		for (int mask = 0; mask < (1 << 8); mask++) {
			if (bestMask[mask].fi != 0)
				assert(a[bestMask[mask].se] == mask);
			if (bestMask[mask].fi + 1 > dp[i] && __builtin_popcount(mask & a[i]) == b[i]) {
				dp[i] = bestMask[mask].fi + 1;
				par[i] = bestMask[mask].se;
				ans = max(ans, mp(dp[i], i));
			}
		}
		if (bestMask[a[i]].fi < dp[i]) {
			bestMask[a[i]] = mp(dp[i], i);
		}
	}
	printf("%d\n", order.size());
	while (ans.fi >= 1) {
		order.push_back(ans.se);
		ans.se = par[ans.se];
		ans.fi--;
	}
	reverse(order.begin(), order.end());
	for (int i = 0; i < order.size(); i++) printf("%d ", order[i]);
}

signed main() {
#ifdef in1code
	freopen("1test.inp", "r", stdin);
#endif
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
	if (n <= 5000) solveSub2();
	else solveSub3();
}

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

subsequence.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<int>&)':
subsequence.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << sp;
                    ^
subsequence.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<std::pair<int, int> >&)':
subsequence.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << endl;
                    ^
subsequence.cpp: In function 'void solveSub3()':
subsequence.cpp:82:29: 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", order.size());
                             ^
subsequence.cpp:89:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < order.size(); i++) printf("%d ", order[i]);
                    ^
subsequence.cpp: In function 'int main()':
subsequence.cpp:96:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
subsequence.cpp:97:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
                                                 ^
subsequence.cpp:98:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
                                                 ^

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