제출 #4568

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
4568	2013-11-01 15:59:13	ansol4328	고기잡이 (KOI13_fish)	C++98	2.16 / 18	4 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>
int n, l, m;
int fish[102][4];
int max;
int input()
{
    int i, x=2100000000, y=2100000000;
    scanf("%d %d %d",&n,&l,&m);
    for(i=1 ; i<=n ; i++)
    {
        scanf("%d %d",&fish[i][1],&fish[i][2]);
        if(fish[i][1]<x) x=fish[i][1];
        if(fish[i][2]<y) y=fish[i][2];
    }
    fish[0][1]=x;
    fish[0][2]=y;
    return 0;
}
int process()
{
    int i, j, k, r=0;
    int a, b;
    for(i=0 ; i<=m ; i++)
    {
        for(j=1 ; j<=l/2 ; j++)
        {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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