제출 #37607

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
37607		Kerim	Longest beautiful sequence (IZhO17_subsequence)	C++14	23 / 100	6000 ms	7672 KiB

subsequence

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int dp[MAXN],arr[MAXN],rr[MAXN],bit[1<<20],par[MAXN];
int main(){
    //~ freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
		scanf("%d",arr+i);
	for(int i=1;i<(1<<20);i++)
		bit[i]=__builtin_popcount(i);
	for(int i=1;i<=n;i++)
		scanf("%d",rr+i);
	int ans=0,who;	
	for(int i=1;i<=n;i++){
		dp[i]=1;
		for(int j=1;j<i;j++)
			if(rr[i]==bit[arr[i]&arr[j]] and umax(dp[i],dp[j]+1))
				par[i]=j;
		if(umax(ans,dp[i]))
			who=i;
	}
	printf("%d\n",ans);
	vector<int>res;
	while(who){
		res.pb(who);
		who=par[who];
	}reverse(all(res));
	tr(it,res)
		printf("%d ",*it);
	puts("");	
	return 0;
}

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

subsequence.cpp: In function 'int main()':
subsequence.cpp:24:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
subsequence.cpp:26:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",arr+i);
                    ^
subsequence.cpp:30:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",rr+i);
                   ^

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