제출 #1159119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159119		PieArmy	Longest beautiful sequence (IZhO17_subsequence)	C++20	0 / 100	0 ms	328 KiB

subsequence

typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}

int n;
int a[100023],k[100023];
int ans[100023],par[100023],best[(1<<20)];

void code(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		cin>>k[i];
	}
	int mx=1;
	for(int i=1;i<=n;i++){
		ans[i]=1;
		par[i]=0;
		for(int j=0;j<pie(8);j++){
			int x=(j&a[i]);
			int cnt=0;
			for(int l=0;l<8;l++){
				if(x&pie(l))cnt++;
			}
			if(cnt==k[i]&&ans[i]<ans[best[j]]+1){
				ans[i]=ans[best[j]]+1;
				par[i]=best[j];
			}
		}
		if(ans[i]>ans[mx])mx=i;
		if(ans[i]>ans[best[a[i]]])best[a[i]]=i;
	}
	cout<<ans[mx]<<endl;
	vector<int>v;
	while(mx){
		v.pb(mx);
		mx=par[mx];
	}
	while(v.size()){
		cout<<v.back()<<" ";
		v.pop_back();
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
	int t=1;
	if(!t)cin>>t;
	while(t--){code();cout<<endl;}
	return 0;
}

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

subsequence.cpp: In function 'int main()':
subsequence.cpp:58:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
      |                                ~~~~~~~^~~~~~~~~~~~~~~~~
subsequence.cpp:58:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~

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