Submission #1072

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1072	2013-06-24 16:04:28	tncks0121	고기잡이 (KOI13_fish)	C++98	18 / 18	104 ms	900 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>
FILE *in = stdin;
FILE *out = stdout;
#define inside(a, b, c) ((a)<=(c) && (c)<=(b))
int N, M, L;
int X[1000], Y[1000];
int Fx[1000], Fy[1000];
int main(){
int i, j, k;
int w, h;
int cnt;
int ans = 0;
fscanf(in, "%d%d%d", &N, &L, &M);
for (i=0; i<M; i++){
fscanf(in, "%d%d", &Fx[i], &Fy[i]);
X[i] = Fx[i]; Y[i] = Fy[i];
}std::sort(X, X+M);
std::sort(Y, Y+M);
L /= 2;
for (w=1; w<L; w++){
h = L-w;
for (i=0; i<M; i++){
for (j=0; j<M; j++){
cnt = 0;
for (k=0; k<M; k++){
if (inside(X[i], X[i]+w, Fx[k]) &&
inside(Y[j], Y[j]+h, Fy[k]))
cnt ++;
}if (ans<cnt) ans = cnt;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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