Submission #4833

#	Time	Username	Problem	Language	Result	Execution time	Memory
4833		gs13068	수족관 1 (KOI13_aqua1)	C++98	100 / 100	4 ms	1148 KiB

aqua1

#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);
}

• Subtask 1: 23 / 23
• Subtask 2: 19 / 19
• Subtask 3: 22 / 22
• Subtask 4: 36 / 36