# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9482 | sior | On grid (kriii2_O) | C++98 | 0 ms | 2384 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 <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <utility>
using namespace std;
#define INF 987654
int cache[301][301];
int board[301][301];
int numOfX, numOfY;
int gridSum(int y1, int x1, int y2, int x2);
int generate(int y_here, int x_here/*현재 위치*/);
int main()
{
cin >> numOfX >> numOfY;
memset(cache, -1, sizeof(cache));
for (int y = 0; y < numOfY; y++)
{
for (int x = 0; x < numOfX; x++)
{
cin >> board[y][x];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |