# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167009 | Dovran | Bank (IZhO14_bank) | C++11 | 27 ms | 23928 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 N 1000009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define pp pop_back
#define ll long long
using namespace std;
int n, m, v[N], c[N], b[N], mxx;
int vis[N];
vector<int>e[N];
bool asd;
vector<int>bt;
map<vector<int>, int>vss;
void pr(int x, int y);
void f(int x){
if(x==n+1){
cout<<"YES\n";
asd=1;
return;
}
b[0]=1;
for(int i=1; i<=m; i++){
if(vis[c[i]]>0){
for(int j=v[x]; j>=0; j--){
# | 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... |