| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1368383 | temurbek1371 | 은행 (IZhO14_bank) | C++20 | 124 ms | 544 KiB |
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vb vector<bool>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define endl '\n'
#define maxx(x) *max_element(all(x))
#define pii pair<int,int>
#define minn(x) *min_element(all(x))
#define vpii vector<pii>
#define di deque<int>
#define mii map<int,int>
#define vap(x) vector<array<int,x>>
constexpr int MOD = (1e9 + 7);
constexpr int inf = 1e18;
void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
ostream& operator<<(ostream& out, vi& a) {
for (int i = 0; a.size() > i; i++)out << a[i] << ' ';
return out;
}
ostream& operator<<(ostream& out, vector<vi>& a) {
for (auto& row : a) {
for (auto& elem : row) out << elem << ' ';
out << '\n';
}
return out;
}
istream& operator>>(istream& in, vi& a) {
for (int i = 0; a.size() > i; i++) in >> a[i];
return in;
}
istream& operator>>(istream& in, vector<vi>& a) {
for(int i = 0;i<a.size();i++){
for(int j = 0;j<a[i].size();j++){
in >> a[i][j];
}
}
return in;
}
int sumofvecor(vi a){
int sm = 0;
for(int i = 0;i<a.size();i++)sm+=a[i];
return sm;
}
bool isprime(int number){
for(int i = 2;i*i<=number;i++){
if(number%i==0)return false;
}
return number>=2;
}
void file_io() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void solve();
signed main(signed argc, char *argv[]) {
clock_t start = clock();
fast_io();
// file_io();
if (argc > 1 && string(argv[1]) == "gg") file_io();
int test = 1;
// cin >> test;
while (test--) {
solve();
}
cerr << "Vaqt " << double(clock() - start) / double(CLOCKS_PER_SEC) * 1000 << " ms\n";
}
void solve(){
int n,m;
cin>>n>>m;
vi a(n),b(m);
cin>>a>>b;
vi pref(n+1);
for(int i = 1;i<=n;i++)pref[i]=pref[i-1]+a[i-1];
vector<bool> dp(1<<m,false);
dp[0]=1;
for(int i = 0;i<(1<<m);i++){
if(!dp[i])continue;
int sm =0;
for(int j =0;j<m;j++)if(i&(1<<j))sm+=b[j];
int l = 0,r = n+1;
while(l<r){
int m = l+r>>1;
if(pref[m]>sm)r = m;
else l = m+1;
}
if(l==n+1){
cout<<"YES\n";return;
}
int rem = sm-pref[l-1];
// cout<<i<<' '<<sm<<' '<<rem<<' '<<l<<endl;
for(int j = 0;j<m;j++){
if(((1<<j)&i)==0 && b[j]+rem<=a[l-1]){
// cout<<j<<endl;
dp[i|(1<<j)]=1;
}
}
}
cout<<"NO\n";
}Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
