Submission #1099718

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099718		KasymK	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	6053 ms	2232 KiB

subsequence

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
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;}
const int N = 1e5+5;
int a[N], k[N], wow[N], dp[N];

int main(){
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", a+i);
    for(int i = 1; i <= n; ++i)
        scanf("%d", k+i);
    int answer = 0, eyes = 0;
    for(int i = 1; i <= n; ++i){
        dp[i] = 1;
        for(int j = 1; j < i; ++j)
            if(__builtin_popcount(a[i]&a[j]) == k[i] and umax(dp[i], dp[j]+1))
                wow[i] = j;
        if(umax(answer, dp[i]))
            eyes = i;
    }
    printf("%d\n", answer);
    vector<int> A;
    while(eyes){
        A.pb(eyes);
        eyes = wow[eyes];
    }
    reverse(all(A));
    for(int i : A)
        printf("%d ", i);
    puts("");
    return 0;
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
subsequence.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%d", a+i);
      |         ~~~~~^~~~~~~~~~~
subsequence.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d", k+i);
      |         ~~~~~^~~~~~~~~~~

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