# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49806 | mra2322001 | Bank (IZhO14_bank) | C++14 | 1096 ms | 92504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f0(i, n) for(int i=(0); i<n; i++)
#define f1(i, n) for(int i=(1); i<=n; i++)
#define bit(x, y) (((x) >> (y))&1)
using namespace std;
typedef long long ll;
const int N = 22;
int n, m, a[N], b[N];
int f[22][1 << 20];
vector <vector <int> > t[N];
int calc(int i, int s){
if(f[i][s] >= 0) return f[i][s];
if(i == n + 1){
cout << "YES";
exit(0);
}
int &ans = f[i][s];
ans = 0;
for(auto x:t[i]){
bool ok = 1;
for(auto y:x){
if(bit(s, y)) ok = 0;
}
if(ok){
int r = s;
for(auto y:x){
r = r + (1 << y);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |