# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4833 | gs13068 | 수족관 1 (KOI13_aqua1) | C++98 | 4 ms | 1148 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>
int x[2500];
int y[2500];
int t[2500];
int m;
int res;
bool backtracking(int l,int r,int d)
{
if(l<r)
{
bool flag=false;
int i,j=l;
for(i=l;i<r;i++)if(y[i]<y[j])j=i;
if(backtracking(l,j,y[j]))flag=true;
if(backtracking(j+1,r,y[j]))flag=true;
if(flag)return true;
for(i=0;i<m;i++)if(t[i]==x[j])return true;
res+=(x[r]-x[l])*(y[j]-d);
}
return false;
}
int main()
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d%d",&x[i/2],&y[i/2]);
# | 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... |