Submission #440666

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
440666	2021-07-02 17:34:31	Autron	Longest beautiful sequence (IZhO17_subsequence)	C++17	40 / 100	6097 ms	89044 KiB

subsequence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
int last[1<<10][1<<10][21];
int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  cin>>n;
  vector<int> len(n+1), pr(n+1), a(n+1), k(n+1);
  for(int i=1;i<=n;++i) cin>>a[i];
  for(int i=1;i<=n;++i) cin>>k[i];
  for(int i=1;i<=n;++i){
    int lef=a[i]&((1<<10)-1), rig=a[i]>>10;
    for(int mask=0;mask<(1<<10);++mask){
      int tar=k[i]-__builtin_popcount(mask&lef);
      if(0<=tar&&tar<=10&&(len[i]<len[last[mask][rig][tar]])){
        len[i]=len[last[mask][rig][tar]];
        pr[i]=last[mask][rig][tar];
      }
    }
    len[i]++;
    for(int mask=0;mask<(1<<10);++mask){
      if(len[last[lef][mask][__builtin_popcount(mask&rig)]]<len[i]){
        last[lef][mask][__builtin_popcount(mask&rig)]=i;
      }
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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