제출 #1001745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001745		vjudge1	은행 (IZhO14_bank)	C++17	0 / 100	19 ms	33272 KiB

bank

#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define ii pair<ll,ll>
using namespace std;
const ll mod=1e9+7;
const ll len=21;
ll res=0,mi,gcd=0,d=0,i,n,m,j;
ll a[len],b[len];
ii dp[1<<len];
ii cmp(ii a,ii b)
{
    return (a.fi==b.fi?(a.se<b.se? a:b):(a.fi>b.fi?a:b));
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
cin>>n>>m;
for(i=1;i<=n;i++)
    cin>>a[i];
for(i=0;i<m;i++)
    cin>>b[i];
// dp[mask] còn bnh thg cần fill
memset(dp,-1,sizeof(dp));
dp[0]={0,a[1]};
//8cout<<cmp(dp[1],dp[0]).fi<<" ";
for(ll mask=0;mask<(1<<m);mask++)
{
    for(ll i=0;i<m;i++)
    if(!(mask&(1<<i)))
    {
       // if(mask==0)cout<<mask<<" "<<(mask|(1<<i))<<'\n';
        if(b[i]<=dp[i].se)
        {
         if(b[i]==dp[i].se)
        {
             if(dp[i].fi==n-1) return cout<<"YES",0;
        dp[mask|(1<<i)]=cmp(dp[mask|(1<<i)],{dp[i].fi+1,a[dp[i].fi+2]});
        }
        else
        {
        dp[mask|(1<<i)]=cmp(dp[mask|(1<<i)],{dp[i].fi,dp[mask].se-b[i]});
        }
        }
    }
}
//cout<<dp[2].fi<<' '<<dp[2].se<<" ";
cout<<"NO";
return 0;
}
// d=ma-mi mi=2*x-ma

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp: In function 'int main()':
bank.cpp:28:24: warning: 'void* memset(void*, int, size_t)' writing to an object of type 'struct std::pair<long long int, long long int>' with no trivial copy-assignment [-Wclass-memaccess]
   28 | memset(dp,-1,sizeof(dp));
      |                        ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from bank.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<long long int, long long int>' declared here
  211 |     struct pair
      |            ^~~~

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29