# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43661 | gnoor | Bali Sculptures (APIO15_sculpture) | C++14 | 132 ms | 748 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 <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
long long tbl[5000];
int dis[5000];
bool mic[300][300];
int n,a,b;
int num(long long mask) {
memset(dis,63,sizeof(dis));
dis[0]=0;
for (int i=0;i<=n;i++) {
for (int j=i+1;j<=n;j++) {
if (((tbl[j]-tbl[i])&(~mask))==0) {
dis[j]=min(dis[j],dis[i]+1);
}
}
}
return dis[n];
}
bool work(long long mask) {
memset(mic,0,sizeof(mic));
mic[0][0]=true;
for (int k=1;k<=b;k++) {
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... |