Submission #5672

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

fish

#include<stdio.h>
#include<algorithm>

int n, l, m, x[102], y[102], fish[102][4];
int max;

int input()
{
    int i;
    scanf("%d %d %d",&n,&l,&m);
    for(i=1 ; i<=m ; i++)
    {
        scanf("%d %d",&fish[i][1],&fish[i][2]);
        y[i]=fish[i][1], x[i]=fish[i][2];
    }
    std::sort(x+1,x+1+m);
    std::sort(y+1,y+1+m);
    return 0;
}

int process()
{
    int i, j, k, li, tx, ty, a, b, cnt;

    for(i=1 ; i<=m ; i++)
    {
        for(j=1 ; j<=m ; j++)
        {
            ty=y[i], tx=x[j];
            for(li=1 ; li<=l/2 ; li++)
            {
                a=li, b=(l/2)-li;
                cnt=0;
                for(k=1 ; k<=m ; k++)
                {
                    if(tx<=fish[k][2] && tx+a>=fish[k][2] && ty<=fish[k][1] && ty+b>=fish[k][1]) cnt++;
                }
                if(max<cnt) max=cnt;
                cnt=0;
                for(k=1 ; k<=m ; k++)
                {
                    if(tx<=fish[k][2] && tx+a>=fish[k][2] && ty>=fish[k][1] && ty-b<=fish[k][1]) cnt++;
                }
                if(max<cnt) max=cnt;
                cnt=0;
                for(k=1 ; k<=m ; k++)
                {
                    if(tx>=fish[k][2] && tx-a<=fish[k][2] && ty>=fish[k][1] && ty-b<=fish[k][1]) cnt++;
                }
                if(max<cnt) max=cnt;
                cnt=0;
                for(k=1 ; k<=m ; k++)
                {
                    if(tx>=fish[k][2] && tx-a<=fish[k][2] && ty<=fish[k][1] && ty+b>=fish[k][1]) cnt++;
                }
                if(max<cnt) max=cnt;
            }
        }
    }
    return 0;
}

int output()
{
    printf("%d",max);
    return 0;
}

int main()
{
    input();
    process();
    output();
    return 0;
}

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