Submission #1072

#TimeUsernameProblemLanguageResultExecution timeMemory
1072tncks0121고기잡이 (KOI13_fish)C++98
18 / 18
104 ms900 KiB
#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; } } }fprintf(out, "%d", ans); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...