제출 #5672

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
5672	2014-05-10 15:17:29	ansol4328	고기잡이 (KOI13_fish)	C++98	18 / 18	500 ms	1088 KiB

fish

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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