Submission #501928

#	Time	Username	Problem	Language	Result	Execution time	Memory
501928		tmn2005	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	2 ms	332 KiB

subsequence

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

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b[N],c;

main(){
	NeedForSpeed
	//freopen("subsequence.in", "r", stdin);
	//freopen("subsequence.out", "w", stdout);
	
    cin>>n;
    for(int i=1; i<=n; i++)cin>>a[i];
	for(int i=1; i<=n; i++)cin>>b[i];
	
	set<pii> s;
	l = 1, r = 1;
	for(int i=2; i<=n; i++){
		if((__builtin_popcount(a[i-1] & a[i])) == b[i]){
			r++;
		}
		else{
			s.ins({l, r});
			l = i;
			r = i;
		}
	}
	s.ins({l, r});
	for(auto i : s){
		if(i.sc - i.fr + 1 > res){
			res = i.sc - i.fr + 1;
			l = i.fr;
			r = i.sc;
		}
	}
	cout<<res<<endl;
	for(int i=l; i<=r; i++)cout<<i<<" ";




	return 0;
}

Compilation message (stderr)

subsequence.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

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