# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
10090 | gs14004 | 고기잡이 (KOI13_fish) | C++98 | 4 ms | 1284 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> px,py;
int n,l,m;
int x[101],y[101];
int lx[101], ly[101], sx, sy;
int a[101][101];
int area(int sx, int sy, int ex, int ey){
int res = a[ex][ey];
if(sx) res -= a[sx-1][ey];
if(sy) res -= a[ex][sy-1];
if(sx && sy) res += a[sx-1][sy-1];
return res;
}
int length(int sx, int sy, int ex, int ey){
return lx[ex] - lx[sx] + ly[ey] - ly[sy];
}
int f(int x, int y){
int res = 0, tx = sx-1;
for (int i = y+1; i<sy; i++) {
while (tx > x && length(x,y,tx,i) > l) tx--;
if(tx == x) break;
res = max(res,area(x,y,tx,i));
}
return res;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |