Submission #305100

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

subsequence

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

using pii = pair<int, int>;

#define ff first
#define ss second

#define pb push_back

constexpr int maxn = 1e5+10;

int a[maxn], k[maxn];

int dp[maxn], dp_mask[1<<10]; // for the 3rd subtask

int ant[maxn], pos_mask[1<<10];

void print(int ans) {
	printf("%d\n", dp[ans]);
	vector<int> resp;
	while(ans) {
		resp.pb(ans);
		ans = ant[ans];
	}
	reverse(resp.begin(), resp.end());
	for(auto it : resp)
		printf("%d ", it);
	printf("\n");
}

int main() {
	int n; scanf("%d", &n);
	for(int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	for(int i = 1; i <= n; i++)
		scanf("%d", &k[i]);
	for(int i = 1; i <= n; i++) {
		dp[i] = 1;
		for(int mask = 0; mask < (1<<8); mask++)
			if(__builtin_popcount(mask&a[i]) == k[i] && dp[i] <= dp_mask[mask])
				dp[i] = dp_mask[mask]+1, ant[i] = pos_mask[mask];
		if(dp[i] > dp_mask[a[i]])
			dp_mask[a[i]] = dp[i], pos_mask[a[i]] = i;
	}
	int ans = 0;
	for(int i = 1; i <= n; i++)
		if(dp[i] >= dp[ans])
			ans = i;
	print(ans);
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |  int n; scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
subsequence.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~
subsequence.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |   scanf("%d", &k[i]);
      |   ~~~~~^~~~~~~~~~~~~

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