제출 #516637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
516637		Dasha_Gnedko	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	1 ms	400 KiB

subsequence

#include <bits/stdc++.h>

//#include <ext/pb_ds/detail/standard_policies.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

using namespace std;

//using namespace __gnu_pbds;
//template <typename T> using ordered_set = tree <T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 gen(time(0));

#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define sz(a) int32_t(a.size())
#define endl '\n'
//#define int long long

const int N = 1e5 + 100;
const int M = 31;
const int mod = 998244353;
const int inf = 1e9 + 7;

int a[N], b[N], dp[N], pr[N];

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endif // LOCAL

    int n;
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < n; i++)
        cin >> b[i];
    for(int i = 0; i < n; i++)
    {
        dp[i] = 1;
        pr[i] = -1;
        for(int j = i - 1; j >= 0; j--)
        {
            int c = (a[i] & a[j]);
            c = __builtin_popcount(c);
            if (b[dp[j]] != c) continue;
            if (dp[j] + 1 > dp[i])
            {
                dp[i] = dp[j] + 1;
                pr[i] = j;
            }
        }
    }
    int i = 0;
    for(int j = 1; j < n; j++)
        if (dp[j] > dp[i]) i = j;
    vector < int > ans;
    while (i >= 0)
    {
        ans.pb(i);
        i = pr[i];
    }
    reverse(ans.begin(), ans.end());
    cout << sz(ans) << endl;
    for(auto to: ans)
        cout << to + 1 << " ";

}

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