oj.uz

Submission #967187

# Submission time Handle Problem Language Result Execution time Memory
967187 2024-04-21T13:18:46 Z AlphaMale06 Longest beautiful sequence (IZhO17_subsequence) C++17
0 / 100
 15 ms 47964 KB 
#include <bits/stdc++.h>

using namespace std;
const int N = 1e5+3;
const int bits=10;
const int mask = 1<<bits;
int dp[bits+1][mask][mask], prv[N], from[bits+1][mask][mask], cnt[mask], a[N], b[N], l[N], r[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for(int i=0; i<mask; i++)cnt[i]=__builtin_popcount(i);
    int n;
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        l[i]=a[i]>>10;
        r[i]=a[i]&((1<<11)-1);
    }
    for(int i=1; i<=n; i++)cin >> b[i];
    int mxans=0, mxst=0;
    for(int i=1; i<=n; i++){
        int mx=0;
        for(int j=0; j<mask; j++){
            int share = cnt[j&r[i]];
            if(b[i]-share>=0 && b[i]-share<=10){
                mx=max(mx, dp[b[i]-share][l[i]][j]);
                if(mx==dp[b[i]-share][l[i]][j])prv[i]=from[b[i]-share][l[i]][j];
            }
        }
        mx++;
        for(int j=0; j<mask; j++){
            dp[cnt[j&l[i]]][j][r[i]]=max(dp[cnt[j&l[i]]][j][r[i]], mx);
            if(dp[cnt[j&l[i]]][j][r[i]]==mx)from[cnt[j&l[i]]][j][r[i]] = i;
        }
        if(mx>mxans){
            mxans=mx;
            mxst = i;
        }
    }
    cout << mxans << '\n';
    vector<int> cons;
    while(mxst!=0){
        cons.push_back(mxst);
        mxst=prv[mxst];
    }
    reverse(cons.begin(), cons.end());
    for(int e : cons)cout << e << " ";
    cout << '\n';
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12380 KB answer = 4
2 Correct 3 ms 10588 KB answer = 1
3 Correct 3 ms 12380 KB answer = 2
4 Correct 4 ms 10588 KB answer = 1
5 Correct 3 ms 12392 KB answer = 2
6 Correct 15 ms 42608 KB answer = 1
7 Correct 5 ms 29020 KB answer = 1
8 Incorrect 10 ms 47964 KB jury has the better answer: jans = 3, pans = 2
9 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12380 KB answer = 4
2 Correct 3 ms 10588 KB answer = 1
3 Correct 3 ms 12380 KB answer = 2
4 Correct 4 ms 10588 KB answer = 1
5 Correct 3 ms 12392 KB answer = 2
6 Correct 15 ms 42608 KB answer = 1
7 Correct 5 ms 29020 KB answer = 1
8 Incorrect 10 ms 47964 KB jury has the better answer: jans = 3, pans = 2
9 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12380 KB answer = 4
2 Correct 3 ms 10588 KB answer = 1
3 Correct 3 ms 12380 KB answer = 2
4 Correct 4 ms 10588 KB answer = 1
5 Correct 3 ms 12392 KB answer = 2
6 Correct 15 ms 42608 KB answer = 1
7 Correct 5 ms 29020 KB answer = 1
8 Incorrect 10 ms 47964 KB jury has the better answer: jans = 3, pans = 2
9 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12380 KB answer = 4
2 Correct 3 ms 10588 KB answer = 1
3 Correct 3 ms 12380 KB answer = 2
4 Correct 4 ms 10588 KB answer = 1
5 Correct 3 ms 12392 KB answer = 2
6 Correct 15 ms 42608 KB answer = 1
7 Correct 5 ms 29020 KB answer = 1
8 Incorrect 10 ms 47964 KB jury has the better answer: jans = 3, pans = 2
9 Halted 0 ms 0 KB -