Submission #167748

#	Time	Username	Problem	Language	Result	Execution time	Memory
167748		abil	Longest beautiful sequence (IZhO17_subsequence)	C++14	7 / 100	6027 ms	12760 KiB

subsequence

#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long

using namespace std;

const int N = ((1 << 20) + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);

int a[N], dp[N], path[N], k[N], bit[N], ind[N];
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 = 0;i < (1 << 20); i++){
		bit[i] = __builtin_popcount(i);
	}
	for(int i = 1;i <= n; i++){
		int mx = 1, id = 0;
		for(int j = 0;j < (1 << 20); j++){
			if(bit[(j & a[i])] == k[i]){
				if(dp[j] + 1 > mx){
					mx = dp[j] + 1;
					id = ind[j];
				}			
			}
		}
		if(mx > dp[a[i]]){
			dp[a[i]] = mx;
			path[i] = id;
			ind[a[i]] = i;		
		}
	}
	int mx = 0, val;
	for(int i = 0; i < (1 << 20); i++){
		if(dp[i] > mx){
			mx = dp[i];
			val = ind[i];
		}
	}
	printf("%d\n", mx);
	vector<int > ans;
	while(val){
		ans.pb(val);
		val = path[val];
	}
	reverse(all(ans));
	for(auto to : ans){
		 printf("%d ", to);
	}
}

Compilation message (stderr)

subsequence.cpp:17:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
subsequence.cpp: In function 'int main()':
subsequence.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
subsequence.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~
subsequence.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &k[i]);
   ~~~~~^~~~~~~~~~~~~

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