Submission #36921

#	Time	Username	Problem	Language	Result	Execution time	Memory
36921		top34051	Longest beautiful sequence (IZhO17_subsequence)	C++14	40 / 100	6000 ms	214520 KiB

subsequence

#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>

const int maxn = 1e5 + 5;
const int cut = 1024;

int n;
int a[maxn], b[maxn], k[maxn];
int op[cut+5][cut+5];
pii dp[cut+5][cut+5][25];
int track[maxn];

void maxx(pii &x, pii y) {
    if(y>x) x = y;
}

void f(int x) {
    if(x==0) return ;
    f(track[x]);
    printf("%d ",x);
}

int main() {
    int i,x,y;
    pii cur, ans;
    scanf("%d",&n);
    for(i=1;i<=n;i++) {
        scanf("%d",&x);
        a[i] = x/cut;
        b[i] = x%cut;
    }
    for(i=1;i<=n;i++) scanf("%d",&k[i]);
    for(x=0;x<cut;x++) {
        for(y=0;y<cut;y++) {
            for(i=x&y;i>0;i/=2) op[x][y] += (i&1);
        }
    }
    ans = {0,0};
    for(i=1;i<=n;i++) {
        //fix C (x)
        cur = {0,0};
        for(x=0;x<cut;x++) {
            if(k[i]-op[a[i]][x]>=0) maxx(cur, dp[x][b[i]][k[i]-op[a[i]][x]]);
        }
        track[i] = cur.second;
        cur.first++; cur.second = i;
        maxx(ans, cur);
        //fix B (x)
        for(x=0;x<cut;x++) maxx(dp[a[i]][x][op[b[i]][x]], cur);
    }
    printf("%d\n",ans.first);
    f(ans.second);
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:28:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
subsequence.cpp:30:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
                       ^
subsequence.cpp:34:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1;i<=n;i++) scanf("%d",&k[i]);
                                        ^

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