# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7349 | ansol4328 | 배열 탈출 (GA8_array) | C++98 | 636 ms | 39764 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<stdio.h>
#define INF 2100000000
int n, m[2225][2225];
int dp[2225][2225];
int min(int a, int b)
{
if(a<=b) return a;
if(a>b) return b;
}
int p(int a, int b)
{
if(a-b>0) return 0;
if(a-b<=0) return b-a+1;
}
int main()
{
int i, j;
scanf("%d",&n);
for(i=1 ; i<=n ; i++)
{
for(j=1 ; j<=n ; j++)
{
scanf("%d",&m[i][j]);
dp[i][j]=INF;
}
# | 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... |