Submission #7403

#	Time	Username	Problem	Language	Result	Execution time	Memory
7403		gs13068	고기잡이 (KOI13_fish)	C++98	0 / 18	0 ms	1088 KiB

fish

#include<cstdio>
#include<algorithm>

std::pair<int,int> a[100];

int x[100];
int y[100];

int main()
{
  int res=0;
  int i,j,k,t,n,m;
  scanf("%*d%d%d",&n,&m);
  n>>=1;
  for(i=0;i<m;i++)scanf("%d%d",&a[i].first,&a[i].second);
  std::sort(a,a+n);
  for(i=0;i<m;i++)for(j=0;j<m;j++)
  {
    for(k=0;k<n;k++)x[k]=y[k]=0;
    for(k=0;k<m;k++)if(a[k].first>=a[i].first&&a[k].second>=a[j].second&&a[k].first+a[k].second-a[i].first-a[j].second<n)
    {
      x[a[k].first-a[i].first]++;
      y[a[k].second-a[j].second]++;
    }
    t=0;
    for(k=0;k<n;k++)
    {
      t+=x[k];
      if(t>res)res=t;
      t-=y[n-k-1];
    }
  }
  printf("%d",res);
}

• Subtask 1: 0 / 2.16
• Subtask 2: 0 / 2.7
• Subtask 3: 0 / 3.42
• Subtask 4: 0 / 4.32
• Subtask 5: 0 / 5.4