# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978040 | BentoOreo | Bank (IZhO14_bank) | C++14 | 1000 ms | 41304 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>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
const ll INF = numeric_limits<ll>::max();
const int inf = numeric_limits<int>::max();
const char nl = '\n', sp = ' ';
ll cantor_hash(ll x, ll y){
return (((x + y) * (x + y + 1)) >> 1) + y;
}
unordered_map<ll, vector<ll> > ks;
// void get_key_signature(ll orig, ll curr, int mask, int id,vector<ll> &billz){
// if(curr == 0){
// ks[orig].push_back(mask);
// return;
// }
// if(id == billz.size()){
// return;
// }
// if(curr - billz[id] >= 0){
// get_key_signature(orig, curr - billz[id], mask + (1 << id), id + 1, billz);
// get_key_signature(orig, curr, mask, id + 1, billz);
// }
// }
unordered_map<ll, bool> vis;
bool pathexists(int node, int mask,vector<ll> &salary, vector<ll> &billz){
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... |