Submission #201574

#	Time	Username	Problem	Language	Result	Execution time	Memory
201574		_7_7_	Longest beautiful sequence (IZhO17_subsequence)	C++14	100 / 100	4394 ms	48504 KiB

subsequence

#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


inline int R () {
    char c;
    int ans = 0;
    bool started = 0, is_negative = 0;
    while (1) {
        c = getchar();
        if ((c < '0' || c > '9') && c != '-' && !started)
            continue;
        if ((c < '0' || c > '9') && c != '-' && started)
            break;
        if (started)
            ans = ans * 10;
        started = 1;
        if (c == '-')
            is_negative = 1;
        else
            ans += c - '0';
    }
    
    if (is_negative)
        ans = -ans;
    return ans;
}

int n, a[N], k[N], dp[1030][1030][11], ans[N];

main () {
    n = R();
    forn (i, 1, n)
        a[i] = R();
    
    forn (i, 1, n)
        k[i] = R();
            
    forn (i, 1, n) {
        int h1 = a[i] & 1023, h2 = a[i] >> 10;
        ans[i] = 1;
        forn (mask, 0, 1023) {
            int c = __builtin_popcount(h1 & mask);
            if (c > k[i] || k[i] - c > 10)
                continue;
            ans[i] = max(ans[i], dp[mask][h2][k[i] - c] + 1);
        }
        
        forn (mask, 0, 1023) {
            int c = __builtin_popcount(h2 & mask);
            dp[h1][mask][c] = max(dp[h1][mask][c], ans[i]); 
        }
    }
    
    int j = 1;
    forn (i, 2, n)
        if (ans[i] > ans[j])
            j = i;
    vi res;
    while (1) {
        res.pb(j);
        if (ans[j] == 1)
            break;
        int x = j - 1;
        while (1) {
            if (ans[x] == ans[j] - 1 && __builtin_popcount(a[j] & a[x]) == k[j]) {
                j = x;
                break;
            }
            --x;
        }
    }            
    reverse(all(res));
    printf("%d\n", sz(res));
    for (auto x : res)
        printf("%d ", x);
}

Compilation message (stderr)

subsequence.cpp:67:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

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