Acwing game 58

AcWing 4488. seek 1

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
#define x first
#define y second
#define LL long long 
#define int LL
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define PII pair<int,int>
#define ll_INF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
#define debug(x) cerr << #x << ": " << x << endl
#define io ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
LL Mod(LL a,LL mod){
    return (a%mod+mod)%mod;}
LL lowbit(LL x){
    return x&-x;}// Its lowest 1 And behind it 0 The value of composition 
LL qmi(LL a,LL b,LL mod) {
    LL ans = 1; while(b){
     if(b & 1) ans = ans * (a % mod) % mod; a = a % mod * (a % mod) % mod; b >>= 1;} return ans; }
int _;
int n;
void solve()
{
    
    cin>>n;
    bool f=false;
    for(int i=0;i<n;i++)
    {
    
        int x;
        cin>>x;
        if(x==1)
        {
    
            f=true;
            cout<<"YES"<<endl;
            break;
        }
    }
    if(!f)cout<<"NO"<<endl;
}
signed main()
{
    
    io;
    //cin>>_; 
    //while(_--)
    solve();
    return 0;
}

AcWing 4489. The longest subsequence

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
#define x first
#define y second
#define LL long long 
#define int LL
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define PII pair<int,int>
#define ll_INF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
#define debug(x) cerr << #x << ": " << x << endl
#define io ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
LL Mod(LL a,LL mod){
    return (a%mod+mod)%mod;}
LL lowbit(LL x){
    return x&-x;}// Its lowest 1 And behind it 0 The value of composition 
LL qmi(LL a,LL b,LL mod) {
    LL ans = 1; while(b){
     if(b & 1) ans = ans * (a % mod) % mod; a = a % mod * (a % mod) % mod; b >>= 1;} return ans; }
int _;
int n;
const int N=2e5+10;
int a[N];
int dp[N];
void solve()
{
    
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    int maxv=1;
    for(int i=1;i<=n;i++)dp[i]=1;
    for(int i=2;i<=n;i++)
    {
    
        if(a[i]<=a[i-1]*2)dp[i]=dp[i-1]+1;
        maxv=max(maxv,dp[i]);
    }
    cout<<maxv<<endl;
}
signed main()
{
    
    io;
    //cin>>_; 
    //while(_--)
    solve();
    return 0;
}

AcWing 4490. dyeing

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
#define x first
#define y second
#define LL long long 
#define int LL
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define PII pair<int,int>
#define ll_INF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
#define debug(x) cerr << #x << ": " << x << endl
#define io ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
LL Mod(LL a,LL mod){
    return (a%mod+mod)%mod;}
LL lowbit(LL x){
    return x&-x;}// Its lowest 1 And behind it 0 The value of composition 
LL qmi(LL a,LL b,LL mod) {
    LL ans = 1; while(b){
     if(b & 1) ans = ans * (a % mod) % mod; a = a % mod * (a % mod) % mod; b >>= 1;} return ans; }
int _;
int n;
const int N=1e4+10;
int h[N],e[N],ne[N],idx;
int c[N];
void add(int a,int b)
{
    
    e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
int dfs(int u,int color)
{
    
    int res=0;
    if(c[u]!=color)
    {
    
        res++;
        color=c[u];
    }
    for(int i=h[u];~i;i=ne[i])
    {
    
        int j=e[i];
        res+=dfs(j,color);
    }
    return res;
}
void solve()
{
    
    cin>>n;
    memset(h,-1,sizeof h);
    for(int i=2;i<=n;i++)
    {
    
        int x;
        cin>>x;
        add(x,i);
    }
    for(int i=1;i<=n;i++)cin>>c[i];
    cout<<dfs(1,0)<<endl;
}
signed main()
{
    
    io;
    //cin>>_; 
    //while(_--)
    solve();
    return 0;
}