# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115682 | suzy | Bali Sculptures (APIO15_sculpture) | C++17 | 94 ms | 19072 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 <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long lli;
lli a[2001], p[2001];
int n, L, R;
vector<int> con[2001], tmp[2001];
int d1[101][101], d2[2001];
int f1(int c, int k) {
if(k>n) return L<=c && c<=R;
if(d1[c][k]>=0) return d1[c][k];
for(int i=0;i<con[k].size();i++) {
int v=con[k][i];
if(f1(c+1,v+1)) return d1[c][k]=1;
}
return d1[c][k]=0;
}
int f2(int k) {
if(k>n) return 0;
if(d2[k]>=0) return d2[k];
int ret=(1<<30);
for(int i=0;i<con[k].size();i++) {
int v=con[k][i];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |