제출 #312282

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

subsequence

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5, half = (1 << 11) + 5, K = 21;
int n, a[N], k[N], f[half][half][K], dp[N], trace[N];

int bi(string s) {
	reverse(s.begin(), s.end());
	int res = 0;
	for (int i = 0; i < s.size(); ++i) if (s[i] == '1')
		res += (1 << i);
	return res;
}

string show(int d) {
	string ret; ret.clear();
	while (d) {
		ret = char((d % 2) + '0') + ret;
		d /= 2;
	}
	return ret;
}



signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; ++i)
		cin >> k[i];
	int halve = (1 << 10) - 1, res = 0;
	int f38 = a[38] >> 10, s38 = a[38] & halve, f52 = a[52] >> 10, s52 = a[52] & halve;

	for (int i = 1; i <= n; ++i) {
		int s = (a[i] & halve);
		dp[i] = 1;
		for (int fd = 0; fd <= halve; ++fd) {
			int fbc = __builtin_popcount((a[i] >> 10) & fd);
			if (fbc > k[i]) continue;
			int val = dp[f[fd][s][k[i] - fbc]] + 1;
			if (dp[i] < val) {
				dp[i] = val;
				trace[i] = f[fd][s][k[i] - fbc];
			}
		}
		for (int sc = 0; sc <= halve; ++sc) {
			int pre = dp[f[a[i] >> 10][sc][__builtin_popcount(s & sc)]];
			if (pre < dp[i]) {
				f[a[i] >> 10][sc][__builtin_popcount(s & sc)] = i;
			}
		}
		// if (i == 38) cerr << f[f38][s52][k[52] - __builtin_popcount(f52 & f38)] << endl;
		res = max(res, dp[i]);
	}
	cout << res << endl;
	int i;
	for (i = 1; i <= n; ++i) if (dp[i] == res)
		break;
	vector <int> ans; ans.clear();
	while (i) {
		ans.push_back(i);
		i = trace[i];
	}
	reverse(ans.begin(), ans.end());
	for (int j : ans) cout << j << ' ';

	return 0;
}

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

subsequence.cpp: In function 'int bi(std::string)':
subsequence.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for (int i = 0; i < s.size(); ++i) if (s[i] == '1')
      |                  ~~^~~~~~~~~~
subsequence.cpp: In function 'int main()':
subsequence.cpp:37:6: warning: unused variable 'f38' [-Wunused-variable]
   37 |  int f38 = a[38] >> 10, s38 = a[38] & halve, f52 = a[52] >> 10, s52 = a[52] & halve;
      |      ^~~
subsequence.cpp:37:25: warning: unused variable 's38' [-Wunused-variable]
   37 |  int f38 = a[38] >> 10, s38 = a[38] & halve, f52 = a[52] >> 10, s52 = a[52] & halve;
      |                         ^~~
subsequence.cpp:37:46: warning: unused variable 'f52' [-Wunused-variable]
   37 |  int f38 = a[38] >> 10, s38 = a[38] & halve, f52 = a[52] >> 10, s52 = a[52] & halve;
      |                                              ^~~
subsequence.cpp:37:65: warning: unused variable 's52' [-Wunused-variable]
   37 |  int f38 = a[38] >> 10, s38 = a[38] & halve, f52 = a[52] >> 10, s52 = a[52] & halve;
      |                                                                 ^~~

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