제출 #1278553

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

subsequence

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 1e5 + 10, M = 1e7 + 10;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

int a[N], b[N];
int bc[257][257], bc1[5001][5001];

void solve(int tc) {
    int n;
    cin >> n;
    vector<int>par(n+1, 0);
    for(int i = 0; i < 257; i++){
        for(int j = 0; j < 257; j++){
            bc[i][j] = __builtin_popcount(i&j);
        }
    }
    int m = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        m = max(m, a[i]);
    }
    for(int i = 1; i <= n; i++){
        cin >> b[i];
    }
    if(m < (1 << 8)){
        vector<pair<int,int>>dp(257,{0, 0});
        int ans = 0, id = -1;
        for(int i = 1; i <= n; i++){
            if(dp[a[i]].first == 0){
                dp[a[i]] = {1, i};
            }
            for(int j = 0; j < (1 << 8); j++){
                if(bc[j][a[i]] == b[i] && dp[j].first + 1 > dp[a[i]].first){
                    dp[a[i]].first = dp[j].first + 1;
                    dp[a[i]].second = i;
                    par[i] = dp[j].second;
                }
            }
            if(dp[a[i]].first > ans){
                ans = dp[a[i]].first;
                id = i;
            }
        }
        cout << ans << endl;
        vector<int>res;
        while(par[id] != 0){
            res.push_back(id);
            id = par[id];
        }
        res.push_back(id);
        reverse(all(res));
        for(auto i : res) cout << i << ' ';
        cout << endl;
        return;
    }
    vector<int>dp1(n+1, 0);
    dp1[0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            bc[i][j] = __builtin_popcount(a[i] & a[j]);
        }
    }
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j < i; j++) {
            if (bc[j][i] == b[i]) {
                if (dp1[i] < dp1[j] + 1) {
                    dp1[i] = dp1[j] + 1;
                    par[i] = j;
                }
            }
        }
    }
    ll id = -1, mx = 0;
    for (int i = 1; i <= n; i++) {
        if (dp1[i] > mx) {
            mx = dp1[i];
            id = i;
        }
    }
    cout << mx << endl;
    vector<int>ans;
    while (id != 0) {
        ans.push_back(id);
        id = par[id];
    }
    reverse(all(ans));
    for (auto i : ans) cout << i << ' ';
    cout << endl;
}


void precalc() {

}

int main() {
    // SetIO("clumsy");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

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

subsequence.cpp: In function 'void SetIO(std::string)':
subsequence.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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