제출 #763424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
763424		Alora	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	55 ms	1192 KiB

subsequence

#include <bits/stdc++.h>
#define name "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define pb push_back
#define all(v) v.begin(), v.end()
#define maxn 100005
const int M = 1e9 + 7;
using namespace std;
int n, a[maxn], k[maxn];

void sub1(){
    int res = 1, luu = 1;
    fi(msk, 1, (1 << n) - 1){
        int id = __builtin_ctz(msk);
        int sl = __builtin_popcount(msk);
        if(sl < 2) continue;
        int pre = id, ok = 1;
        fi(i, id + 1, n - 1) if(getbit(msk,  i)){
            if(__builtin_popcount(a[i + 1] & a[pre + 1]) != k[i + 1]){
                ok = 0;
                break;
            }
            else pre = i;
        }
        if(!ok) continue;
        if(sl > res) res = sl, luu = msk;
    }
    cout << res << '\n';
    fi(i, 0, n - 1) if(getbit(luu, i)) cout << i + 1 << " ";
    exit(0);
}
pii L[maxn];
int ans[maxn];
void sub2(){
    int res = 0;
    fi(i, 2, n)
        fi(j, 1, i - 1) if(__builtin_popcount(a[i] & a[j]) == k[i]){
            L[i] = max(L[i], {L[j].f + 1, j});
            res = max(res, L[i].f);
        }
    fi(i, 1, n) if(L[i].f == res){
        cout << L[i].f + 1 << '\n';
        int sl = 0;
        int x = i;
        while(x != 0){
            ans[++sl] = x;
            x = L[x].se;
        }
        fid(j, sl, 1) cout << ans[j] << " ";
        exit(0);
    }

}
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
   // freopen(name".in", "r", stdin);
   // freopen(name".out", "w", stdout);
    cin >> n;
    fi(i, 1, n) cin >> a[i];
    fi(i, 1, n) cin >> k[i];
    if(n <= 15) sub1();
    if(n <= 5000) sub2();

}

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