Submission #686639

#	Time	Username	Problem	Language	Result	Execution time	Memory
686639		MarwenElarbi	Longest beautiful sequence (IZhO17_subsequence)	C++14	23 / 100	6077 ms	2388 KiB

subsequence

#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
const int MOD = 1e9+7;
const int nax = 2*1e5+5;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
typedef complex<int> Point;
#define X real()
#define Y imag()
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
int main(){
    optimise;
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
    //setIO("breedflip");
    int n;
    cin>>n;
    vi tab(n);
    vi k(n);
    for (int i = 0; i < n; ++i)
    {
        cin>>tab[i];
    }
    for (int i = 0; i < n; ++i)
    {
        cin>>k[i];
    }
    pair<int,int> dp[n];
    memset(dp,0,sizeof dp);
    dp[0]={1,0};
    pair<int,int> last={1,0};
    for (int i = 0; i < n; ++i)
    {
        dp[i].fi=1;
        dp[i].se=i;
        for (int j = 0; j < i; ++j)
        {
            int res=0;
            for (int k = 0; k < 21 ; ++k)
            {
                if ((tab[i]&(1<<k))&&(tab[j]&(1<<k)))
                    res++;
            }
            if (res==k[i]&&dp[i].fi<dp[j].fi+1)
            {
                dp[i].fi=dp[j].fi+1;
                dp[i].se=j;
                if (last.fi<dp[i].fi){
                    last.se=i;
                    last.fi=dp[i].fi;
                }
            }
        }
    }
    cout << last.fi<<endl;
    int c=last.se;
    vi nabba;
    while (dp[c].se!=c)
    {
        nabba.pb(c);
        c=dp[c].se;
    }
    nabba.pb(c);
    for (int i = nabba.size()-1; i >=0 ; --i)
    {
        cout << nabba[i]+1<<" ";
    }

}   

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:54:26: warning: 'void* memset(void*, int, size_t)' clearing an object of type 'struct std::pair<int, int>' with no trivial copy-assignment; use assignment instead [-Wclass-memaccess]
   54 |     memset(dp,0,sizeof dp);
      |                          ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from subsequence.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<int, int>' declared here
  211 |     struct pair
      |            ^~~~
subsequence.cpp: In function 'void setIO(std::string)':
subsequence.cpp:31:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:32:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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