# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594055 | vbee | Bank (IZhO14_bank) | C++14 | 173 ms | 1324 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 fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define MASK(i) (1 << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define ll long long
#define pb push_back
#define TASK "task"
using namespace std;
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int LOG = 18;
const int BASE = 323;
const int N = 20;
int n, m, a[N], b[N];
bool f[MASK(N)];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen(TASK".inp", "r", stdin);
// freopen(TASK".out", "w", stdout);
cin >> n >> m;
int totsum = 0;
for (int i = 0; i < n; i++) cin >> a[i], totsum += a[i];
# | 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... |