Submission #36924

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

subsequence

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

#define pii pair<int,int>
#define X first
#define Y second

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

int n;
int p[maxn], k[maxn];
int cnt[cut*cut+5];
pii dp[cut+5][cut+5][25];
int track[maxn];

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

int main() {
    int i,x,y,a,b,mx,pos;
    pii ans;
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",&p[i]);
    for(i=1;i<=n;i++) scanf("%d",&k[i]);
    for(x=0;x<cut;x++) for(i=x;i>0;i/=2) cnt[x] += (i&1);
    ans = {0,0};
    for(i=1;i<=n;++i) {
        a = p[i]>>10; b = p[i]%cut; mx = 1; pos = 0;
        //fix C (x)
        for(x=0;x<cut;++x) {
            int want = k[i] - cnt[a&x];
            if(want<0 || want>10) continue;
            if(mx < dp[x][b][want].X + 1) mx = dp[x][b][want].X + 1, pos = dp[x][b][want].Y;
        }
        track[i] = pos;
        if(ans.X < mx) ans = make_pair(mx, i);
        //fix B (x)
        for(x=0;x<cut;++x) {
            int want = cnt[b&x];
            if(dp[a][x][want].X < mx) dp[a][x][want] = make_pair(mx, i);
        }
    }
    printf("%d\n",ans.X);
    f(ans.Y);
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:24:13: warning: unused variable 'y' [-Wunused-variable]
     int i,x,y,a,b,mx,pos;
             ^
subsequence.cpp:26:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
subsequence.cpp:27: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",&p[i]);
                                        ^
subsequence.cpp:28: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