oj.uz

Submission #352382

# Submission time Handle Problem Language Result Execution time Memory
352382 2021-01-20T17:21:59 Z b00n0rp Longest beautiful sequence (IZhO17_subsequence) C++17
100 / 100
 5734 ms 93844 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 100005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n;
int a[MAXN],k[MAXN];
pii dp[MAXN];

pii gg[1025][1025][11];
 
void solvethetestcase(){
    cin >> n;
    FOR(i,1,n+1) cin >> a[i];
    FOR(i,1,n+1) cin >> k[i];
    pii ans = {0,0};
    FOR(i,1,n+1){
        dp[i] = {1,0};
        // a[i] = lol1*(1<<10)+lol2 ; lol1,lol2 < (1<<10)
        // a[j] = lmao1*(1<<10)+lmao2 ; lmao1,lmao2 < (1<<10)
        int lol1 = (a[i]>>10);
        int lol2 = a[i]-(lol1<<10);
        REP(lmao1,(1<<10)){
            int com1 = __builtin_popcount(lol1&lmao1);
            int com2 = k[i]-com1;
            if(com2 < 0 or com2 > 10) continue;
            remax(dp[i],gg[lmao1][lol2][com2]);
        }
        REP(lmao2,(1<<10)){
            remax(gg[lol1][lmao2][__builtin_popcount(lmao2&lol2)],mp(dp[i].F+1,i));
        }
        remax(ans,mp(dp[i].F,i));
    }
    cout << ans.F << endl;
    vi v;
    int cur = ans.S;
    REP(i,ans.F){
        v.pb(cur);
        cur = dp[cur].S;
    }
    reverse(all(v));
    for(auto x:v) cout << x << " ";
    cout << "\n";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB answer = 4
2 Correct 1 ms 620 KB answer = 1
3 Correct 1 ms 620 KB answer = 2
4 Correct 1 ms 492 KB answer = 1
5 Correct 2 ms 620 KB answer = 2
6 Correct 1 ms 748 KB answer = 1
7 Correct 1 ms 492 KB answer = 1
8 Correct 4 ms 1772 KB answer = 3
9 Correct 6 ms 1772 KB answer = 2
10 Correct 5 ms 1772 KB answer = 3
11 Correct 3 ms 1772 KB answer = 2
12 Correct 4 ms 1900 KB answer = 3
13 Correct 5 ms 1644 KB answer = 2
14 Correct 7 ms 1516 KB answer = 1
15 Correct 7 ms 1900 KB answer = 1
16 Correct 9 ms 1900 KB answer = 1
17 Correct 7 ms 1644 KB answer = 1
18 Correct 4 ms 748 KB answer = 1
19 Correct 4 ms 748 KB answer = 1
20 Correct 4 ms 748 KB answer = 1
21 Correct 4 ms 768 KB answer = 1

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB answer = 4
2 Correct 1 ms 620 KB answer = 1
3 Correct 1 ms 620 KB answer = 2
4 Correct 1 ms 492 KB answer = 1
5 Correct 2 ms 620 KB answer = 2
6 Correct 1 ms 748 KB answer = 1
7 Correct 1 ms 492 KB answer = 1
8 Correct 4 ms 1772 KB answer = 3
9 Correct 6 ms 1772 KB answer = 2
10 Correct 5 ms 1772 KB answer = 3
11 Correct 3 ms 1772 KB answer = 2
12 Correct 4 ms 1900 KB answer = 3
13 Correct 5 ms 1644 KB answer = 2
14 Correct 7 ms 1516 KB answer = 1
15 Correct 7 ms 1900 KB answer = 1
16 Correct 9 ms 1900 KB answer = 1
17 Correct 7 ms 1644 KB answer = 1
18 Correct 4 ms 748 KB answer = 1
19 Correct 4 ms 748 KB answer = 1
20 Correct 4 ms 748 KB answer = 1
21 Correct 4 ms 768 KB answer = 1
22 Correct 246 ms 90224 KB answer = 358
23 Correct 235 ms 90240 KB answer = 336
24 Correct 245 ms 90092 KB answer = 339
25 Correct 238 ms 90476 KB answer = 357
26 Correct 236 ms 90348 KB answer = 354
27 Correct 221 ms 84204 KB answer = 333
28 Correct 225 ms 85356 KB answer = 314
29 Correct 228 ms 84716 KB answer = 322
30 Correct 229 ms 85612 KB answer = 339
31 Correct 231 ms 84332 KB answer = 351
32 Correct 309 ms 86272 KB answer = 1
33 Correct 319 ms 85996 KB answer = 1
34 Correct 309 ms 85612 KB answer = 1
35 Correct 319 ms 86124 KB answer = 1
36 Correct 305 ms 85228 KB answer = 1
37 Correct 115 ms 4844 KB answer = 1
38 Correct 106 ms 4844 KB answer = 1
39 Correct 106 ms 4844 KB answer = 1
40 Correct 113 ms 4844 KB answer = 1

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB answer = 4
2 Correct 1 ms 620 KB answer = 1
3 Correct 1 ms 620 KB answer = 2
4 Correct 1 ms 492 KB answer = 1
5 Correct 2 ms 620 KB answer = 2
6 Correct 1 ms 748 KB answer = 1
7 Correct 1 ms 492 KB answer = 1
8 Correct 4 ms 1772 KB answer = 3
9 Correct 6 ms 1772 KB answer = 2
10 Correct 5 ms 1772 KB answer = 3
11 Correct 3 ms 1772 KB answer = 2
12 Correct 4 ms 1900 KB answer = 3
13 Correct 5 ms 1644 KB answer = 2
14 Correct 7 ms 1516 KB answer = 1
15 Correct 7 ms 1900 KB answer = 1
16 Correct 9 ms 1900 KB answer = 1
17 Correct 7 ms 1644 KB answer = 1
18 Correct 4 ms 748 KB answer = 1
19 Correct 4 ms 748 KB answer = 1
20 Correct 4 ms 748 KB answer = 1
21 Correct 4 ms 768 KB answer = 1
22 Correct 246 ms 90224 KB answer = 358
23 Correct 235 ms 90240 KB answer = 336
24 Correct 245 ms 90092 KB answer = 339
25 Correct 238 ms 90476 KB answer = 357
26 Correct 236 ms 90348 KB answer = 354
27 Correct 221 ms 84204 KB answer = 333
28 Correct 225 ms 85356 KB answer = 314
29 Correct 228 ms 84716 KB answer = 322
30 Correct 229 ms 85612 KB answer = 339
31 Correct 231 ms 84332 KB answer = 351
32 Correct 309 ms 86272 KB answer = 1
33 Correct 319 ms 85996 KB answer = 1
34 Correct 309 ms 85612 KB answer = 1
35 Correct 319 ms 86124 KB answer = 1
36 Correct 305 ms 85228 KB answer = 1
37 Correct 115 ms 4844 KB answer = 1
38 Correct 106 ms 4844 KB answer = 1
39 Correct 106 ms 4844 KB answer = 1
40 Correct 113 ms 4844 KB answer = 1
41 Correct 1412 ms 2388 KB answer = 6296
42 Correct 1382 ms 2540 KB answer = 6267
43 Correct 1378 ms 2412 KB answer = 6264
44 Correct 1375 ms 2284 KB answer = 6384
45 Correct 1393 ms 2472 KB answer = 6272
46 Correct 1404 ms 2412 KB answer = 6177
47 Correct 1420 ms 2404 KB answer = 6144
48 Correct 1381 ms 2280 KB answer = 6272
49 Correct 1366 ms 2412 KB answer = 6241
50 Correct 1395 ms 2412 KB answer = 6169
51 Correct 937 ms 2348 KB answer = 1
52 Correct 930 ms 2284 KB answer = 1
53 Correct 938 ms 2284 KB answer = 1
54 Correct 956 ms 2284 KB answer = 1
55 Correct 932 ms 2156 KB answer = 1
56 Correct 1845 ms 2276 KB answer = 1426
57 Correct 1844 ms 2264 KB answer = 1427
58 Correct 1895 ms 2432 KB answer = 1428
59 Correct 1854 ms 2560 KB answer = 1427

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB answer = 4
2 Correct 1 ms 620 KB answer = 1
3 Correct 1 ms 620 KB answer = 2
4 Correct 1 ms 492 KB answer = 1
5 Correct 2 ms 620 KB answer = 2
6 Correct 1 ms 748 KB answer = 1
7 Correct 1 ms 492 KB answer = 1
8 Correct 4 ms 1772 KB answer = 3
9 Correct 6 ms 1772 KB answer = 2
10 Correct 5 ms 1772 KB answer = 3
11 Correct 3 ms 1772 KB answer = 2
12 Correct 4 ms 1900 KB answer = 3
13 Correct 5 ms 1644 KB answer = 2
14 Correct 7 ms 1516 KB answer = 1
15 Correct 7 ms 1900 KB answer = 1
16 Correct 9 ms 1900 KB answer = 1
17 Correct 7 ms 1644 KB answer = 1
18 Correct 4 ms 748 KB answer = 1
19 Correct 4 ms 748 KB answer = 1
20 Correct 4 ms 748 KB answer = 1
21 Correct 4 ms 768 KB answer = 1
22 Correct 246 ms 90224 KB answer = 358
23 Correct 235 ms 90240 KB answer = 336
24 Correct 245 ms 90092 KB answer = 339
25 Correct 238 ms 90476 KB answer = 357
26 Correct 236 ms 90348 KB answer = 354
27 Correct 221 ms 84204 KB answer = 333
28 Correct 225 ms 85356 KB answer = 314
29 Correct 228 ms 84716 KB answer = 322
30 Correct 229 ms 85612 KB answer = 339
31 Correct 231 ms 84332 KB answer = 351
32 Correct 309 ms 86272 KB answer = 1
33 Correct 319 ms 85996 KB answer = 1
34 Correct 309 ms 85612 KB answer = 1
35 Correct 319 ms 86124 KB answer = 1
36 Correct 305 ms 85228 KB answer = 1
37 Correct 115 ms 4844 KB answer = 1
38 Correct 106 ms 4844 KB answer = 1
39 Correct 106 ms 4844 KB answer = 1
40 Correct 113 ms 4844 KB answer = 1
41 Correct 1412 ms 2388 KB answer = 6296
42 Correct 1382 ms 2540 KB answer = 6267
43 Correct 1378 ms 2412 KB answer = 6264
44 Correct 1375 ms 2284 KB answer = 6384
45 Correct 1393 ms 2472 KB answer = 6272
46 Correct 1404 ms 2412 KB answer = 6177
47 Correct 1420 ms 2404 KB answer = 6144
48 Correct 1381 ms 2280 KB answer = 6272
49 Correct 1366 ms 2412 KB answer = 6241
50 Correct 1395 ms 2412 KB answer = 6169
51 Correct 937 ms 2348 KB answer = 1
52 Correct 930 ms 2284 KB answer = 1
53 Correct 938 ms 2284 KB answer = 1
54 Correct 956 ms 2284 KB answer = 1
55 Correct 932 ms 2156 KB answer = 1
56 Correct 1845 ms 2276 KB answer = 1426
57 Correct 1844 ms 2264 KB answer = 1427
58 Correct 1895 ms 2432 KB answer = 1428
59 Correct 1854 ms 2560 KB answer = 1427
60 Correct 3815 ms 92508 KB answer = 7034
61 Correct 3814 ms 93492 KB answer = 7045
62 Correct 3854 ms 93564 KB answer = 7147
63 Correct 3855 ms 93512 KB answer = 7038
64 Correct 3829 ms 93592 KB answer = 7169
65 Correct 3843 ms 93484 KB answer = 6735
66 Correct 3841 ms 93280 KB answer = 6713
67 Correct 3870 ms 93300 KB answer = 6748
68 Correct 3840 ms 92908 KB answer = 6607
69 Correct 3843 ms 93308 KB answer = 6722
70 Correct 5712 ms 93264 KB answer = 1
71 Correct 5690 ms 93604 KB answer = 1
72 Correct 5734 ms 93352 KB answer = 1
73 Correct 5663 ms 93172 KB answer = 1
74 Correct 5679 ms 93104 KB answer = 1
75 Correct 2791 ms 52596 KB answer = 1
76 Correct 2789 ms 52624 KB answer = 1
77 Correct 2766 ms 52316 KB answer = 1
78 Correct 2810 ms 52520 KB answer = 1
79 Correct 2877 ms 37484 KB answer = 21
80 Correct 3892 ms 59616 KB answer = 7
81 Correct 4330 ms 78100 KB answer = 3
82 Correct 4159 ms 88776 KB answer = 2
83 Correct 3526 ms 80536 KB answer = 1
84 Correct 3039 ms 62060 KB answer = 1
85 Correct 2828 ms 52460 KB answer = 1
86 Correct 2824 ms 37612 KB answer = 11
87 Correct 3844 ms 59884 KB answer = 11
88 Correct 4356 ms 78060 KB answer = 6
89 Correct 4214 ms 88684 KB answer = 4
90 Correct 3565 ms 80532 KB answer = 2
91 Correct 3086 ms 62212 KB answer = 2
92 Correct 3159 ms 52276 KB answer = 2
93 Correct 4226 ms 93312 KB answer = 7211
94 Correct 3899 ms 93780 KB answer = 7032
95 Correct 3877 ms 93604 KB answer = 7092
96 Correct 4941 ms 93844 KB answer = 14167
97 Correct 4912 ms 93592 KB answer = 14159
98 Correct 4850 ms 93656 KB answer = 14125
99 Correct 4888 ms 93752 KB answer = 14121
100 Correct 4858 ms 93728 KB answer = 14010
101 Correct 4837 ms 93636 KB answer = 13976
102 Correct 2786 ms 52460 KB answer = 3
103 Correct 3118 ms 62160 KB answer = 2
104 Correct 3615 ms 80492 KB answer = 3
105 Correct 2721 ms 51656 KB answer = 2
106 Correct 2787 ms 62188 KB answer = 3
107 Correct 3002 ms 88556 KB answer = 4
108 Correct 2852 ms 78316 KB answer = 5
109 Correct 2271 ms 59756 KB answer = 8
110 Correct 1646 ms 37868 KB answer = 22
111 Correct 3877 ms 93344 KB answer = 6760
112 Correct 3900 ms 93036 KB answer = 6788
113 Correct 3828 ms 93164 KB answer = 6632