| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 4833 |
2014-01-04T15:47:11 Z |
gs13068 |
수족관 1 (KOI13_aqua1) |
C++ |
|
4 ms |
1148 KB |
#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]);
scanf("%d",&m);
for(i=0;i<m;i++)scanf("%d%*d%*d%*d",&t[i]);
backtracking(0,n/2,0);
printf("%d",res);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1116 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1116 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1116 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 4 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 5 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 6 |
Correct |
4 ms |
1148 KB |
Output is correct |
| 7 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 8 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1116 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1116 KB |
Output is correct |
